author | nipkow |
Mon, 13 May 2002 15:27:28 +0200 | |
changeset 13145 | 59bc43b51aa2 |
parent 12459 | 6978ab7cac64 |
permissions | -rw-r--r-- |
(* Title: HOL/ex/PiSets.thy ID: $Id$ Author: Florian Kammueller, University of Cambridge The bijection between elements of the Pi set and functional graphs *) PiSets = Group + constdefs (* bijection between Pi_sig and Pi_=> *) PiBij :: "['a set, 'a => 'b set, 'a => 'b] => ('a * 'b) set" "PiBij A B == %f: Pi A B. {(x, y). x: A & y = f x}" Graph :: "['a set, 'a => 'b set] => ('a * 'b) set set" "Graph A B == {f. f \\<in> Pow(Sigma A B) & (\\<forall>x\\<in>A. \\<exists>!y. (x, y) \\<in> f)}" end