src/HOL/Fun.thy
 author berghofe Mon Oct 19 16:43:45 2009 +0200 (2009-10-19) changeset 32998 31b19fa0de0b parent 32988 d1d4d7a08a66 child 33044 fd0a9c794ec1 permissions -rw-r--r--
Renamed inv to the_inv and turned it into an abbreviation (based on the_inv_onto).
 clasohm@1475 ` 1` ```(* Title: HOL/Fun.thy ``` clasohm@1475 ` 2` ``` Author: Tobias Nipkow, Cambridge University Computer Laboratory ``` clasohm@923 ` 3` ``` Copyright 1994 University of Cambridge ``` huffman@18154 ` 4` ```*) ``` clasohm@923 ` 5` huffman@18154 ` 6` ```header {* Notions about functions *} ``` clasohm@923 ` 7` paulson@15510 ` 8` ```theory Fun ``` haftmann@32139 ` 9` ```imports Complete_Lattice ``` haftmann@32554 ` 10` ```uses ("Tools/transfer.ML") ``` nipkow@15131 ` 11` ```begin ``` nipkow@2912 ` 12` haftmann@26147 ` 13` ```text{*As a simplification rule, it replaces all function equalities by ``` haftmann@26147 ` 14` ``` first-order equalities.*} ``` haftmann@26147 ` 15` ```lemma expand_fun_eq: "f = g \ (\x. f x = g x)" ``` haftmann@26147 ` 16` ```apply (rule iffI) ``` haftmann@26147 ` 17` ```apply (simp (no_asm_simp)) ``` haftmann@26147 ` 18` ```apply (rule ext) ``` haftmann@26147 ` 19` ```apply (simp (no_asm_simp)) ``` haftmann@26147 ` 20` ```done ``` oheimb@5305 ` 21` haftmann@26147 ` 22` ```lemma apply_inverse: ``` haftmann@26357 ` 23` ``` "f x = u \ (\x. P x \ g (f x) = x) \ P x \ x = g u" ``` haftmann@26147 ` 24` ``` by auto ``` nipkow@2912 ` 25` wenzelm@12258 ` 26` haftmann@26147 ` 27` ```subsection {* The Identity Function @{text id} *} ``` paulson@6171 ` 28` haftmann@22744 ` 29` ```definition ``` haftmann@22744 ` 30` ``` id :: "'a \ 'a" ``` haftmann@22744 ` 31` ```where ``` haftmann@22744 ` 32` ``` "id = (\x. x)" ``` nipkow@13910 ` 33` haftmann@26147 ` 34` ```lemma id_apply [simp]: "id x = x" ``` haftmann@26147 ` 35` ``` by (simp add: id_def) ``` haftmann@26147 ` 36` haftmann@26147 ` 37` ```lemma image_ident [simp]: "(%x. x) ` Y = Y" ``` haftmann@26147 ` 38` ```by blast ``` haftmann@26147 ` 39` haftmann@26147 ` 40` ```lemma image_id [simp]: "id ` Y = Y" ``` haftmann@26147 ` 41` ```by (simp add: id_def) ``` haftmann@26147 ` 42` haftmann@26147 ` 43` ```lemma vimage_ident [simp]: "(%x. x) -` Y = Y" ``` haftmann@26147 ` 44` ```by blast ``` haftmann@26147 ` 45` haftmann@26147 ` 46` ```lemma vimage_id [simp]: "id -` A = A" ``` haftmann@26147 ` 47` ```by (simp add: id_def) ``` haftmann@26147 ` 48` haftmann@26147 ` 49` haftmann@26147 ` 50` ```subsection {* The Composition Operator @{text "f \ g"} *} ``` haftmann@26147 ` 51` haftmann@22744 ` 52` ```definition ``` haftmann@22744 ` 53` ``` comp :: "('b \ 'c) \ ('a \ 'b) \ 'a \ 'c" (infixl "o" 55) ``` haftmann@22744 ` 54` ```where ``` haftmann@22744 ` 55` ``` "f o g = (\x. f (g x))" ``` oheimb@11123 ` 56` wenzelm@21210 ` 57` ```notation (xsymbols) ``` wenzelm@19656 ` 58` ``` comp (infixl "\" 55) ``` wenzelm@19656 ` 59` wenzelm@21210 ` 60` ```notation (HTML output) ``` wenzelm@19656 ` 61` ``` comp (infixl "\" 55) ``` wenzelm@19656 ` 62` paulson@13585 ` 63` ```text{*compatibility*} ``` paulson@13585 ` 64` ```lemmas o_def = comp_def ``` nipkow@2912 ` 65` paulson@13585 ` 66` ```lemma o_apply [simp]: "(f o g) x = f (g x)" ``` paulson@13585 ` 67` ```by (simp add: comp_def) ``` paulson@13585 ` 68` paulson@13585 ` 69` ```lemma o_assoc: "f o (g o h) = f o g o h" ``` paulson@13585 ` 70` ```by (simp add: comp_def) ``` paulson@13585 ` 71` paulson@13585 ` 72` ```lemma id_o [simp]: "id o g = g" ``` paulson@13585 ` 73` ```by (simp add: comp_def) ``` paulson@13585 ` 74` paulson@13585 ` 75` ```lemma o_id [simp]: "f o id = f" ``` paulson@13585 ` 76` ```by (simp add: comp_def) ``` paulson@13585 ` 77` paulson@13585 ` 78` ```lemma image_compose: "(f o g) ` r = f`(g`r)" ``` paulson@13585 ` 79` ```by (simp add: comp_def, blast) ``` paulson@13585 ` 80` paulson@13585 ` 81` ```lemma UN_o: "UNION A (g o f) = UNION (f`A) g" ``` paulson@13585 ` 82` ```by (unfold comp_def, blast) ``` paulson@13585 ` 83` paulson@13585 ` 84` haftmann@26588 ` 85` ```subsection {* The Forward Composition Operator @{text fcomp} *} ``` haftmann@26357 ` 86` haftmann@26357 ` 87` ```definition ``` haftmann@26357 ` 88` ``` fcomp :: "('a \ 'b) \ ('b \ 'c) \ 'a \ 'c" (infixl "o>" 60) ``` haftmann@26357 ` 89` ```where ``` haftmann@26357 ` 90` ``` "f o> g = (\x. g (f x))" ``` haftmann@26357 ` 91` haftmann@26357 ` 92` ```lemma fcomp_apply: "(f o> g) x = g (f x)" ``` haftmann@26357 ` 93` ``` by (simp add: fcomp_def) ``` haftmann@26357 ` 94` haftmann@26357 ` 95` ```lemma fcomp_assoc: "(f o> g) o> h = f o> (g o> h)" ``` haftmann@26357 ` 96` ``` by (simp add: fcomp_def) ``` haftmann@26357 ` 97` haftmann@26357 ` 98` ```lemma id_fcomp [simp]: "id o> g = g" ``` haftmann@26357 ` 99` ``` by (simp add: fcomp_def) ``` haftmann@26357 ` 100` haftmann@26357 ` 101` ```lemma fcomp_id [simp]: "f o> id = f" ``` haftmann@26357 ` 102` ``` by (simp add: fcomp_def) ``` haftmann@26357 ` 103` haftmann@31202 ` 104` ```code_const fcomp ``` haftmann@31202 ` 105` ``` (Eval infixl 1 "#>") ``` haftmann@31202 ` 106` haftmann@26588 ` 107` ```no_notation fcomp (infixl "o>" 60) ``` haftmann@26588 ` 108` haftmann@26357 ` 109` haftmann@26147 ` 110` ```subsection {* Injectivity and Surjectivity *} ``` haftmann@26147 ` 111` haftmann@26147 ` 112` ```constdefs ``` haftmann@26147 ` 113` ``` inj_on :: "['a => 'b, 'a set] => bool" -- "injective" ``` haftmann@26147 ` 114` ``` "inj_on f A == ! x:A. ! y:A. f(x)=f(y) --> x=y" ``` haftmann@26147 ` 115` haftmann@26147 ` 116` ```text{*A common special case: functions injective over the entire domain type.*} ``` haftmann@26147 ` 117` haftmann@26147 ` 118` ```abbreviation ``` haftmann@26147 ` 119` ``` "inj f == inj_on f UNIV" ``` paulson@13585 ` 120` haftmann@26147 ` 121` ```definition ``` haftmann@26147 ` 122` ``` bij_betw :: "('a => 'b) => 'a set => 'b set => bool" where -- "bijective" ``` haftmann@28562 ` 123` ``` [code del]: "bij_betw f A B \ inj_on f A & f ` A = B" ``` haftmann@26147 ` 124` haftmann@26147 ` 125` ```constdefs ``` haftmann@26147 ` 126` ``` surj :: "('a => 'b) => bool" (*surjective*) ``` haftmann@26147 ` 127` ``` "surj f == ! y. ? x. y=f(x)" ``` paulson@13585 ` 128` haftmann@26147 ` 129` ``` bij :: "('a => 'b) => bool" (*bijective*) ``` haftmann@26147 ` 130` ``` "bij f == inj f & surj f" ``` haftmann@26147 ` 131` haftmann@26147 ` 132` ```lemma injI: ``` haftmann@26147 ` 133` ``` assumes "\x y. f x = f y \ x = y" ``` haftmann@26147 ` 134` ``` shows "inj f" ``` haftmann@26147 ` 135` ``` using assms unfolding inj_on_def by auto ``` paulson@13585 ` 136` haftmann@31775 ` 137` ```text{*For Proofs in @{text "Tools/Datatype/datatype_rep_proofs"}*} ``` paulson@13585 ` 138` ```lemma datatype_injI: ``` paulson@13585 ` 139` ``` "(!! x. ALL y. f(x) = f(y) --> x=y) ==> inj(f)" ``` paulson@13585 ` 140` ```by (simp add: inj_on_def) ``` paulson@13585 ` 141` berghofe@13637 ` 142` ```theorem range_ex1_eq: "inj f \ b : range f = (EX! x. b = f x)" ``` berghofe@13637 ` 143` ``` by (unfold inj_on_def, blast) ``` berghofe@13637 ` 144` paulson@13585 ` 145` ```lemma injD: "[| inj(f); f(x) = f(y) |] ==> x=y" ``` paulson@13585 ` 146` ```by (simp add: inj_on_def) ``` paulson@13585 ` 147` nipkow@32988 ` 148` ```lemma inj_on_eq_iff: "inj_on f A ==> x:A ==> y:A ==> (f(x) = f(y)) = (x=y)" ``` paulson@13585 ` 149` ```by (force simp add: inj_on_def) ``` paulson@13585 ` 150` nipkow@32988 ` 151` ```lemma inj_eq: "inj f ==> (f(x) = f(y)) = (x=y)" ``` nipkow@32988 ` 152` ```by (simp add: inj_on_eq_iff) ``` nipkow@32988 ` 153` haftmann@26147 ` 154` ```lemma inj_on_id[simp]: "inj_on id A" ``` haftmann@26147 ` 155` ``` by (simp add: inj_on_def) ``` paulson@13585 ` 156` haftmann@26147 ` 157` ```lemma inj_on_id2[simp]: "inj_on (%x. x) A" ``` haftmann@26147 ` 158` ```by (simp add: inj_on_def) ``` haftmann@26147 ` 159` haftmann@26147 ` 160` ```lemma surj_id[simp]: "surj id" ``` haftmann@26147 ` 161` ```by (simp add: surj_def) ``` haftmann@26147 ` 162` haftmann@26147 ` 163` ```lemma bij_id[simp]: "bij id" ``` haftmann@26147 ` 164` ```by (simp add: bij_def inj_on_id surj_id) ``` paulson@13585 ` 165` paulson@13585 ` 166` ```lemma inj_onI: ``` paulson@13585 ` 167` ``` "(!! x y. [| x:A; y:A; f(x) = f(y) |] ==> x=y) ==> inj_on f A" ``` paulson@13585 ` 168` ```by (simp add: inj_on_def) ``` paulson@13585 ` 169` paulson@13585 ` 170` ```lemma inj_on_inverseI: "(!!x. x:A ==> g(f(x)) = x) ==> inj_on f A" ``` paulson@13585 ` 171` ```by (auto dest: arg_cong [of concl: g] simp add: inj_on_def) ``` paulson@13585 ` 172` paulson@13585 ` 173` ```lemma inj_onD: "[| inj_on f A; f(x)=f(y); x:A; y:A |] ==> x=y" ``` paulson@13585 ` 174` ```by (unfold inj_on_def, blast) ``` paulson@13585 ` 175` paulson@13585 ` 176` ```lemma inj_on_iff: "[| inj_on f A; x:A; y:A |] ==> (f(x)=f(y)) = (x=y)" ``` paulson@13585 ` 177` ```by (blast dest!: inj_onD) ``` paulson@13585 ` 178` paulson@13585 ` 179` ```lemma comp_inj_on: ``` paulson@13585 ` 180` ``` "[| inj_on f A; inj_on g (f`A) |] ==> inj_on (g o f) A" ``` paulson@13585 ` 181` ```by (simp add: comp_def inj_on_def) ``` paulson@13585 ` 182` nipkow@15303 ` 183` ```lemma inj_on_imageI: "inj_on (g o f) A \ inj_on g (f ` A)" ``` nipkow@15303 ` 184` ```apply(simp add:inj_on_def image_def) ``` nipkow@15303 ` 185` ```apply blast ``` nipkow@15303 ` 186` ```done ``` nipkow@15303 ` 187` nipkow@15439 ` 188` ```lemma inj_on_image_iff: "\ ALL x:A. ALL y:A. (g(f x) = g(f y)) = (g x = g y); ``` nipkow@15439 ` 189` ``` inj_on f A \ \ inj_on g (f ` A) = inj_on g A" ``` nipkow@15439 ` 190` ```apply(unfold inj_on_def) ``` nipkow@15439 ` 191` ```apply blast ``` nipkow@15439 ` 192` ```done ``` nipkow@15439 ` 193` paulson@13585 ` 194` ```lemma inj_on_contraD: "[| inj_on f A; ~x=y; x:A; y:A |] ==> ~ f(x)=f(y)" ``` paulson@13585 ` 195` ```by (unfold inj_on_def, blast) ``` wenzelm@12258 ` 196` paulson@13585 ` 197` ```lemma inj_singleton: "inj (%s. {s})" ``` paulson@13585 ` 198` ```by (simp add: inj_on_def) ``` paulson@13585 ` 199` nipkow@15111 ` 200` ```lemma inj_on_empty[iff]: "inj_on f {}" ``` nipkow@15111 ` 201` ```by(simp add: inj_on_def) ``` nipkow@15111 ` 202` nipkow@15303 ` 203` ```lemma subset_inj_on: "[| inj_on f B; A <= B |] ==> inj_on f A" ``` paulson@13585 ` 204` ```by (unfold inj_on_def, blast) ``` paulson@13585 ` 205` nipkow@15111 ` 206` ```lemma inj_on_Un: ``` nipkow@15111 ` 207` ``` "inj_on f (A Un B) = ``` nipkow@15111 ` 208` ``` (inj_on f A & inj_on f B & f`(A-B) Int f`(B-A) = {})" ``` nipkow@15111 ` 209` ```apply(unfold inj_on_def) ``` nipkow@15111 ` 210` ```apply (blast intro:sym) ``` nipkow@15111 ` 211` ```done ``` nipkow@15111 ` 212` nipkow@15111 ` 213` ```lemma inj_on_insert[iff]: ``` nipkow@15111 ` 214` ``` "inj_on f (insert a A) = (inj_on f A & f a ~: f`(A-{a}))" ``` nipkow@15111 ` 215` ```apply(unfold inj_on_def) ``` nipkow@15111 ` 216` ```apply (blast intro:sym) ``` nipkow@15111 ` 217` ```done ``` nipkow@15111 ` 218` nipkow@15111 ` 219` ```lemma inj_on_diff: "inj_on f A ==> inj_on f (A-B)" ``` nipkow@15111 ` 220` ```apply(unfold inj_on_def) ``` nipkow@15111 ` 221` ```apply (blast) ``` nipkow@15111 ` 222` ```done ``` nipkow@15111 ` 223` paulson@13585 ` 224` ```lemma surjI: "(!! x. g(f x) = x) ==> surj g" ``` paulson@13585 ` 225` ```apply (simp add: surj_def) ``` paulson@13585 ` 226` ```apply (blast intro: sym) ``` paulson@13585 ` 227` ```done ``` paulson@13585 ` 228` paulson@13585 ` 229` ```lemma surj_range: "surj f ==> range f = UNIV" ``` paulson@13585 ` 230` ```by (auto simp add: surj_def) ``` paulson@13585 ` 231` paulson@13585 ` 232` ```lemma surjD: "surj f ==> EX x. y = f x" ``` paulson@13585 ` 233` ```by (simp add: surj_def) ``` paulson@13585 ` 234` paulson@13585 ` 235` ```lemma surjE: "surj f ==> (!!x. y = f x ==> C) ==> C" ``` paulson@13585 ` 236` ```by (simp add: surj_def, blast) ``` paulson@13585 ` 237` paulson@13585 ` 238` ```lemma comp_surj: "[| surj f; surj g |] ==> surj (g o f)" ``` paulson@13585 ` 239` ```apply (simp add: comp_def surj_def, clarify) ``` paulson@13585 ` 240` ```apply (drule_tac x = y in spec, clarify) ``` paulson@13585 ` 241` ```apply (drule_tac x = x in spec, blast) ``` paulson@13585 ` 242` ```done ``` paulson@13585 ` 243` paulson@13585 ` 244` ```lemma bijI: "[| inj f; surj f |] ==> bij f" ``` paulson@13585 ` 245` ```by (simp add: bij_def) ``` paulson@13585 ` 246` paulson@13585 ` 247` ```lemma bij_is_inj: "bij f ==> inj f" ``` paulson@13585 ` 248` ```by (simp add: bij_def) ``` paulson@13585 ` 249` paulson@13585 ` 250` ```lemma bij_is_surj: "bij f ==> surj f" ``` paulson@13585 ` 251` ```by (simp add: bij_def) ``` paulson@13585 ` 252` nipkow@26105 ` 253` ```lemma bij_betw_imp_inj_on: "bij_betw f A B \ inj_on f A" ``` nipkow@26105 ` 254` ```by (simp add: bij_betw_def) ``` nipkow@26105 ` 255` nipkow@32337 ` 256` ```lemma bij_comp: "bij f \ bij g \ bij (g o f)" ``` nipkow@32337 ` 257` ```by(fastsimp intro: comp_inj_on comp_surj simp: bij_def surj_range) ``` nipkow@32337 ` 258` nipkow@31438 ` 259` ```lemma bij_betw_trans: ``` nipkow@31438 ` 260` ``` "bij_betw f A B \ bij_betw g B C \ bij_betw (g o f) A C" ``` nipkow@31438 ` 261` ```by(auto simp add:bij_betw_def comp_inj_on) ``` nipkow@31438 ` 262` nipkow@26105 ` 263` ```lemma bij_betw_inv: assumes "bij_betw f A B" shows "EX g. bij_betw g B A" ``` nipkow@26105 ` 264` ```proof - ``` nipkow@26105 ` 265` ``` have i: "inj_on f A" and s: "f ` A = B" ``` nipkow@26105 ` 266` ``` using assms by(auto simp:bij_betw_def) ``` nipkow@26105 ` 267` ``` let ?P = "%b a. a:A \ f a = b" let ?g = "%b. The (?P b)" ``` nipkow@26105 ` 268` ``` { fix a b assume P: "?P b a" ``` nipkow@26105 ` 269` ``` hence ex1: "\a. ?P b a" using s unfolding image_def by blast ``` nipkow@26105 ` 270` ``` hence uex1: "\!a. ?P b a" by(blast dest:inj_onD[OF i]) ``` nipkow@26105 ` 271` ``` hence " ?g b = a" using the1_equality[OF uex1, OF P] P by simp ``` nipkow@26105 ` 272` ``` } note g = this ``` nipkow@26105 ` 273` ``` have "inj_on ?g B" ``` nipkow@26105 ` 274` ``` proof(rule inj_onI) ``` nipkow@26105 ` 275` ``` fix x y assume "x:B" "y:B" "?g x = ?g y" ``` nipkow@26105 ` 276` ``` from s `x:B` obtain a1 where a1: "?P x a1" unfolding image_def by blast ``` nipkow@26105 ` 277` ``` from s `y:B` obtain a2 where a2: "?P y a2" unfolding image_def by blast ``` nipkow@26105 ` 278` ``` from g[OF a1] a1 g[OF a2] a2 `?g x = ?g y` show "x=y" by simp ``` nipkow@26105 ` 279` ``` qed ``` nipkow@26105 ` 280` ``` moreover have "?g ` B = A" ``` nipkow@26105 ` 281` ``` proof(auto simp:image_def) ``` nipkow@26105 ` 282` ``` fix b assume "b:B" ``` nipkow@26105 ` 283` ``` with s obtain a where P: "?P b a" unfolding image_def by blast ``` nipkow@26105 ` 284` ``` thus "?g b \ A" using g[OF P] by auto ``` nipkow@26105 ` 285` ``` next ``` nipkow@26105 ` 286` ``` fix a assume "a:A" ``` nipkow@26105 ` 287` ``` then obtain b where P: "?P b a" using s unfolding image_def by blast ``` nipkow@26105 ` 288` ``` then have "b:B" using s unfolding image_def by blast ``` nipkow@26105 ` 289` ``` with g[OF P] show "\b\B. a = ?g b" by blast ``` nipkow@26105 ` 290` ``` qed ``` nipkow@26105 ` 291` ``` ultimately show ?thesis by(auto simp:bij_betw_def) ``` nipkow@26105 ` 292` ```qed ``` nipkow@26105 ` 293` paulson@13585 ` 294` ```lemma surj_image_vimage_eq: "surj f ==> f ` (f -` A) = A" ``` paulson@13585 ` 295` ```by (simp add: surj_range) ``` paulson@13585 ` 296` paulson@13585 ` 297` ```lemma inj_vimage_image_eq: "inj f ==> f -` (f ` A) = A" ``` paulson@13585 ` 298` ```by (simp add: inj_on_def, blast) ``` paulson@13585 ` 299` paulson@13585 ` 300` ```lemma vimage_subsetD: "surj f ==> f -` B <= A ==> B <= f ` A" ``` paulson@13585 ` 301` ```apply (unfold surj_def) ``` paulson@13585 ` 302` ```apply (blast intro: sym) ``` paulson@13585 ` 303` ```done ``` paulson@13585 ` 304` paulson@13585 ` 305` ```lemma vimage_subsetI: "inj f ==> B <= f ` A ==> f -` B <= A" ``` paulson@13585 ` 306` ```by (unfold inj_on_def, blast) ``` paulson@13585 ` 307` paulson@13585 ` 308` ```lemma vimage_subset_eq: "bij f ==> (f -` B <= A) = (B <= f ` A)" ``` paulson@13585 ` 309` ```apply (unfold bij_def) ``` paulson@13585 ` 310` ```apply (blast del: subsetI intro: vimage_subsetI vimage_subsetD) ``` paulson@13585 ` 311` ```done ``` paulson@13585 ` 312` nipkow@31438 ` 313` ```lemma inj_on_Un_image_eq_iff: "inj_on f (A \ B) \ f ` A = f ` B \ A = B" ``` nipkow@31438 ` 314` ```by(blast dest: inj_onD) ``` nipkow@31438 ` 315` paulson@13585 ` 316` ```lemma inj_on_image_Int: ``` paulson@13585 ` 317` ``` "[| inj_on f C; A<=C; B<=C |] ==> f`(A Int B) = f`A Int f`B" ``` paulson@13585 ` 318` ```apply (simp add: inj_on_def, blast) ``` paulson@13585 ` 319` ```done ``` paulson@13585 ` 320` paulson@13585 ` 321` ```lemma inj_on_image_set_diff: ``` paulson@13585 ` 322` ``` "[| inj_on f C; A<=C; B<=C |] ==> f`(A-B) = f`A - f`B" ``` paulson@13585 ` 323` ```apply (simp add: inj_on_def, blast) ``` paulson@13585 ` 324` ```done ``` paulson@13585 ` 325` paulson@13585 ` 326` ```lemma image_Int: "inj f ==> f`(A Int B) = f`A Int f`B" ``` paulson@13585 ` 327` ```by (simp add: inj_on_def, blast) ``` paulson@13585 ` 328` paulson@13585 ` 329` ```lemma image_set_diff: "inj f ==> f`(A-B) = f`A - f`B" ``` paulson@13585 ` 330` ```by (simp add: inj_on_def, blast) ``` paulson@13585 ` 331` paulson@13585 ` 332` ```lemma inj_image_mem_iff: "inj f ==> (f a : f`A) = (a : A)" ``` paulson@13585 ` 333` ```by (blast dest: injD) ``` paulson@13585 ` 334` paulson@13585 ` 335` ```lemma inj_image_subset_iff: "inj f ==> (f`A <= f`B) = (A<=B)" ``` paulson@13585 ` 336` ```by (simp add: inj_on_def, blast) ``` paulson@13585 ` 337` paulson@13585 ` 338` ```lemma inj_image_eq_iff: "inj f ==> (f`A = f`B) = (A = B)" ``` paulson@13585 ` 339` ```by (blast dest: injD) ``` paulson@13585 ` 340` paulson@13585 ` 341` ```(*injectivity's required. Left-to-right inclusion holds even if A is empty*) ``` paulson@13585 ` 342` ```lemma image_INT: ``` paulson@13585 ` 343` ``` "[| inj_on f C; ALL x:A. B x <= C; j:A |] ``` paulson@13585 ` 344` ``` ==> f ` (INTER A B) = (INT x:A. f ` B x)" ``` paulson@13585 ` 345` ```apply (simp add: inj_on_def, blast) ``` paulson@13585 ` 346` ```done ``` paulson@13585 ` 347` paulson@13585 ` 348` ```(*Compare with image_INT: no use of inj_on, and if f is surjective then ``` paulson@13585 ` 349` ``` it doesn't matter whether A is empty*) ``` paulson@13585 ` 350` ```lemma bij_image_INT: "bij f ==> f ` (INTER A B) = (INT x:A. f ` B x)" ``` paulson@13585 ` 351` ```apply (simp add: bij_def) ``` paulson@13585 ` 352` ```apply (simp add: inj_on_def surj_def, blast) ``` paulson@13585 ` 353` ```done ``` paulson@13585 ` 354` paulson@13585 ` 355` ```lemma surj_Compl_image_subset: "surj f ==> -(f`A) <= f`(-A)" ``` paulson@13585 ` 356` ```by (auto simp add: surj_def) ``` paulson@13585 ` 357` paulson@13585 ` 358` ```lemma inj_image_Compl_subset: "inj f ==> f`(-A) <= -(f`A)" ``` paulson@13585 ` 359` ```by (auto simp add: inj_on_def) ``` paulson@5852 ` 360` paulson@13585 ` 361` ```lemma bij_image_Compl_eq: "bij f ==> f`(-A) = -(f`A)" ``` paulson@13585 ` 362` ```apply (simp add: bij_def) ``` paulson@13585 ` 363` ```apply (rule equalityI) ``` paulson@13585 ` 364` ```apply (simp_all (no_asm_simp) add: inj_image_Compl_subset surj_Compl_image_subset) ``` paulson@13585 ` 365` ```done ``` paulson@13585 ` 366` paulson@13585 ` 367` paulson@13585 ` 368` ```subsection{*Function Updating*} ``` paulson@13585 ` 369` haftmann@26147 ` 370` ```constdefs ``` haftmann@26147 ` 371` ``` fun_upd :: "('a => 'b) => 'a => 'b => ('a => 'b)" ``` haftmann@26147 ` 372` ``` "fun_upd f a b == % x. if x=a then b else f x" ``` haftmann@26147 ` 373` haftmann@26147 ` 374` ```nonterminals ``` haftmann@26147 ` 375` ``` updbinds updbind ``` haftmann@26147 ` 376` ```syntax ``` haftmann@26147 ` 377` ``` "_updbind" :: "['a, 'a] => updbind" ("(2_ :=/ _)") ``` haftmann@26147 ` 378` ``` "" :: "updbind => updbinds" ("_") ``` haftmann@26147 ` 379` ``` "_updbinds":: "[updbind, updbinds] => updbinds" ("_,/ _") ``` haftmann@26147 ` 380` ``` "_Update" :: "['a, updbinds] => 'a" ("_/'((_)')" [1000,0] 900) ``` haftmann@26147 ` 381` haftmann@26147 ` 382` ```translations ``` haftmann@26147 ` 383` ``` "_Update f (_updbinds b bs)" == "_Update (_Update f b) bs" ``` haftmann@26147 ` 384` ``` "f(x:=y)" == "fun_upd f x y" ``` haftmann@26147 ` 385` haftmann@26147 ` 386` ```(* Hint: to define the sum of two functions (or maps), use sum_case. ``` haftmann@26147 ` 387` ``` A nice infix syntax could be defined (in Datatype.thy or below) by ``` haftmann@26147 ` 388` ```consts ``` haftmann@26147 ` 389` ``` fun_sum :: "('a => 'c) => ('b => 'c) => (('a+'b) => 'c)" (infixr "'(+')"80) ``` haftmann@26147 ` 390` ```translations ``` haftmann@26147 ` 391` ``` "fun_sum" == sum_case ``` haftmann@26147 ` 392` ```*) ``` haftmann@26147 ` 393` paulson@13585 ` 394` ```lemma fun_upd_idem_iff: "(f(x:=y) = f) = (f x = y)" ``` paulson@13585 ` 395` ```apply (simp add: fun_upd_def, safe) ``` paulson@13585 ` 396` ```apply (erule subst) ``` paulson@13585 ` 397` ```apply (rule_tac [2] ext, auto) ``` paulson@13585 ` 398` ```done ``` paulson@13585 ` 399` paulson@13585 ` 400` ```(* f x = y ==> f(x:=y) = f *) ``` paulson@13585 ` 401` ```lemmas fun_upd_idem = fun_upd_idem_iff [THEN iffD2, standard] ``` paulson@13585 ` 402` paulson@13585 ` 403` ```(* f(x := f x) = f *) ``` paulson@17084 ` 404` ```lemmas fun_upd_triv = refl [THEN fun_upd_idem] ``` paulson@17084 ` 405` ```declare fun_upd_triv [iff] ``` paulson@13585 ` 406` paulson@13585 ` 407` ```lemma fun_upd_apply [simp]: "(f(x:=y))z = (if z=x then y else f z)" ``` paulson@17084 ` 408` ```by (simp add: fun_upd_def) ``` paulson@13585 ` 409` paulson@13585 ` 410` ```(* fun_upd_apply supersedes these two, but they are useful ``` paulson@13585 ` 411` ``` if fun_upd_apply is intentionally removed from the simpset *) ``` paulson@13585 ` 412` ```lemma fun_upd_same: "(f(x:=y)) x = y" ``` paulson@13585 ` 413` ```by simp ``` paulson@13585 ` 414` paulson@13585 ` 415` ```lemma fun_upd_other: "z~=x ==> (f(x:=y)) z = f z" ``` paulson@13585 ` 416` ```by simp ``` paulson@13585 ` 417` paulson@13585 ` 418` ```lemma fun_upd_upd [simp]: "f(x:=y,x:=z) = f(x:=z)" ``` paulson@13585 ` 419` ```by (simp add: expand_fun_eq) ``` paulson@13585 ` 420` paulson@13585 ` 421` ```lemma fun_upd_twist: "a ~= c ==> (m(a:=b))(c:=d) = (m(c:=d))(a:=b)" ``` paulson@13585 ` 422` ```by (rule ext, auto) ``` paulson@13585 ` 423` nipkow@15303 ` 424` ```lemma inj_on_fun_updI: "\ inj_on f A; y \ f`A \ \ inj_on (f(x:=y)) A" ``` nipkow@15303 ` 425` ```by(fastsimp simp:inj_on_def image_def) ``` nipkow@15303 ` 426` paulson@15510 ` 427` ```lemma fun_upd_image: ``` paulson@15510 ` 428` ``` "f(x:=y) ` A = (if x \ A then insert y (f ` (A-{x})) else f ` A)" ``` paulson@15510 ` 429` ```by auto ``` paulson@15510 ` 430` nipkow@31080 ` 431` ```lemma fun_upd_comp: "f \ (g(x := y)) = (f \ g)(x := f y)" ``` nipkow@31080 ` 432` ```by(auto intro: ext) ``` nipkow@31080 ` 433` haftmann@26147 ` 434` haftmann@26147 ` 435` ```subsection {* @{text override_on} *} ``` haftmann@26147 ` 436` haftmann@26147 ` 437` ```definition ``` haftmann@26147 ` 438` ``` override_on :: "('a \ 'b) \ ('a \ 'b) \ 'a set \ 'a \ 'b" ``` haftmann@26147 ` 439` ```where ``` haftmann@26147 ` 440` ``` "override_on f g A = (\a. if a \ A then g a else f a)" ``` nipkow@13910 ` 441` nipkow@15691 ` 442` ```lemma override_on_emptyset[simp]: "override_on f g {} = f" ``` nipkow@15691 ` 443` ```by(simp add:override_on_def) ``` nipkow@13910 ` 444` nipkow@15691 ` 445` ```lemma override_on_apply_notin[simp]: "a ~: A ==> (override_on f g A) a = f a" ``` nipkow@15691 ` 446` ```by(simp add:override_on_def) ``` nipkow@13910 ` 447` nipkow@15691 ` 448` ```lemma override_on_apply_in[simp]: "a : A ==> (override_on f g A) a = g a" ``` nipkow@15691 ` 449` ```by(simp add:override_on_def) ``` nipkow@13910 ` 450` haftmann@26147 ` 451` haftmann@26147 ` 452` ```subsection {* @{text swap} *} ``` paulson@15510 ` 453` haftmann@22744 ` 454` ```definition ``` haftmann@22744 ` 455` ``` swap :: "'a \ 'a \ ('a \ 'b) \ ('a \ 'b)" ``` haftmann@22744 ` 456` ```where ``` haftmann@22744 ` 457` ``` "swap a b f = f (a := f b, b:= f a)" ``` paulson@15510 ` 458` paulson@15510 ` 459` ```lemma swap_self: "swap a a f = f" ``` nipkow@15691 ` 460` ```by (simp add: swap_def) ``` paulson@15510 ` 461` paulson@15510 ` 462` ```lemma swap_commute: "swap a b f = swap b a f" ``` paulson@15510 ` 463` ```by (rule ext, simp add: fun_upd_def swap_def) ``` paulson@15510 ` 464` paulson@15510 ` 465` ```lemma swap_nilpotent [simp]: "swap a b (swap a b f) = f" ``` paulson@15510 ` 466` ```by (rule ext, simp add: fun_upd_def swap_def) ``` paulson@15510 ` 467` paulson@15510 ` 468` ```lemma inj_on_imp_inj_on_swap: ``` haftmann@22744 ` 469` ``` "[|inj_on f A; a \ A; b \ A|] ==> inj_on (swap a b f) A" ``` paulson@15510 ` 470` ```by (simp add: inj_on_def swap_def, blast) ``` paulson@15510 ` 471` paulson@15510 ` 472` ```lemma inj_on_swap_iff [simp]: ``` paulson@15510 ` 473` ``` assumes A: "a \ A" "b \ A" shows "inj_on (swap a b f) A = inj_on f A" ``` paulson@15510 ` 474` ```proof ``` paulson@15510 ` 475` ``` assume "inj_on (swap a b f) A" ``` paulson@15510 ` 476` ``` with A have "inj_on (swap a b (swap a b f)) A" ``` nipkow@17589 ` 477` ``` by (iprover intro: inj_on_imp_inj_on_swap) ``` paulson@15510 ` 478` ``` thus "inj_on f A" by simp ``` paulson@15510 ` 479` ```next ``` paulson@15510 ` 480` ``` assume "inj_on f A" ``` nipkow@27165 ` 481` ``` with A show "inj_on (swap a b f) A" by(iprover intro: inj_on_imp_inj_on_swap) ``` paulson@15510 ` 482` ```qed ``` paulson@15510 ` 483` paulson@15510 ` 484` ```lemma surj_imp_surj_swap: "surj f ==> surj (swap a b f)" ``` paulson@15510 ` 485` ```apply (simp add: surj_def swap_def, clarify) ``` wenzelm@27125 ` 486` ```apply (case_tac "y = f b", blast) ``` wenzelm@27125 ` 487` ```apply (case_tac "y = f a", auto) ``` paulson@15510 ` 488` ```done ``` paulson@15510 ` 489` paulson@15510 ` 490` ```lemma surj_swap_iff [simp]: "surj (swap a b f) = surj f" ``` paulson@15510 ` 491` ```proof ``` paulson@15510 ` 492` ``` assume "surj (swap a b f)" ``` paulson@15510 ` 493` ``` hence "surj (swap a b (swap a b f))" by (rule surj_imp_surj_swap) ``` paulson@15510 ` 494` ``` thus "surj f" by simp ``` paulson@15510 ` 495` ```next ``` paulson@15510 ` 496` ``` assume "surj f" ``` paulson@15510 ` 497` ``` thus "surj (swap a b f)" by (rule surj_imp_surj_swap) ``` paulson@15510 ` 498` ```qed ``` paulson@15510 ` 499` paulson@15510 ` 500` ```lemma bij_swap_iff: "bij (swap a b f) = bij f" ``` paulson@15510 ` 501` ```by (simp add: bij_def) ``` haftmann@21547 ` 502` nipkow@27188 ` 503` ```hide (open) const swap ``` haftmann@21547 ` 504` haftmann@31949 ` 505` haftmann@31949 ` 506` ```subsection {* Inversion of injective functions *} ``` haftmann@31949 ` 507` nipkow@32961 ` 508` ```definition the_inv_onto :: "'a set => ('a => 'b) => ('b => 'a)" where ``` nipkow@32961 ` 509` ```"the_inv_onto A f == %x. THE y. y : A & f y = x" ``` nipkow@32961 ` 510` nipkow@32961 ` 511` ```lemma the_inv_onto_f_f: ``` nipkow@32961 ` 512` ``` "[| inj_on f A; x : A |] ==> the_inv_onto A f (f x) = x" ``` nipkow@32961 ` 513` ```apply (simp add: the_inv_onto_def inj_on_def) ``` nipkow@32961 ` 514` ```apply (blast intro: the_equality) ``` nipkow@32961 ` 515` ```done ``` nipkow@32961 ` 516` nipkow@32961 ` 517` ```lemma f_the_inv_onto_f: ``` nipkow@32961 ` 518` ``` "inj_on f A ==> y : f`A ==> f (the_inv_onto A f y) = y" ``` nipkow@32961 ` 519` ```apply (simp add: the_inv_onto_def) ``` nipkow@32961 ` 520` ```apply (rule the1I2) ``` nipkow@32961 ` 521` ``` apply(blast dest: inj_onD) ``` nipkow@32961 ` 522` ```apply blast ``` nipkow@32961 ` 523` ```done ``` nipkow@32961 ` 524` nipkow@32961 ` 525` ```lemma the_inv_onto_into: ``` nipkow@32961 ` 526` ``` "[| inj_on f A; x : f ` A; A <= B |] ==> the_inv_onto A f x : B" ``` nipkow@32961 ` 527` ```apply (simp add: the_inv_onto_def) ``` nipkow@32961 ` 528` ```apply (rule the1I2) ``` nipkow@32961 ` 529` ``` apply(blast dest: inj_onD) ``` nipkow@32961 ` 530` ```apply blast ``` nipkow@32961 ` 531` ```done ``` nipkow@32961 ` 532` nipkow@32961 ` 533` ```lemma the_inv_onto_onto[simp]: ``` nipkow@32961 ` 534` ``` "inj_on f A ==> the_inv_onto A f ` (f ` A) = A" ``` nipkow@32961 ` 535` ```by (fast intro:the_inv_onto_into the_inv_onto_f_f[symmetric]) ``` nipkow@32961 ` 536` nipkow@32961 ` 537` ```lemma the_inv_onto_f_eq: ``` nipkow@32961 ` 538` ``` "[| inj_on f A; f x = y; x : A |] ==> the_inv_onto A f y = x" ``` nipkow@32961 ` 539` ``` apply (erule subst) ``` nipkow@32961 ` 540` ``` apply (erule the_inv_onto_f_f, assumption) ``` nipkow@32961 ` 541` ``` done ``` nipkow@32961 ` 542` nipkow@32961 ` 543` ```lemma the_inv_onto_comp: ``` nipkow@32961 ` 544` ``` "[| inj_on f (g ` A); inj_on g A; x : f ` g ` A |] ==> ``` nipkow@32961 ` 545` ``` the_inv_onto A (f o g) x = (the_inv_onto A g o the_inv_onto (g ` A) f) x" ``` nipkow@32961 ` 546` ```apply (rule the_inv_onto_f_eq) ``` nipkow@32961 ` 547` ``` apply (fast intro: comp_inj_on) ``` nipkow@32961 ` 548` ``` apply (simp add: f_the_inv_onto_f the_inv_onto_into) ``` nipkow@32961 ` 549` ```apply (simp add: the_inv_onto_into) ``` nipkow@32961 ` 550` ```done ``` nipkow@32961 ` 551` nipkow@32961 ` 552` ```lemma inj_on_the_inv_onto: ``` nipkow@32961 ` 553` ``` "inj_on f A \ inj_on (the_inv_onto A f) (f ` A)" ``` nipkow@32961 ` 554` ```by (auto intro: inj_onI simp: image_def the_inv_onto_f_f) ``` nipkow@32961 ` 555` nipkow@32961 ` 556` ```lemma bij_betw_the_inv_onto: ``` nipkow@32961 ` 557` ``` "bij_betw f A B \ bij_betw (the_inv_onto A f) B A" ``` nipkow@32961 ` 558` ```by (auto simp add: bij_betw_def inj_on_the_inv_onto the_inv_onto_into) ``` nipkow@32961 ` 559` berghofe@32998 ` 560` ```abbreviation the_inv :: "('a \ 'b) \ ('b \ 'a)" where ``` berghofe@32998 ` 561` ``` "the_inv f \ the_inv_onto UNIV f" ``` berghofe@32998 ` 562` berghofe@32998 ` 563` ```lemma the_inv_f_f: ``` berghofe@32998 ` 564` ``` assumes "inj f" ``` berghofe@32998 ` 565` ``` shows "the_inv f (f x) = x" using assms UNIV_I ``` berghofe@32998 ` 566` ``` by (rule the_inv_onto_f_f) ``` berghofe@32998 ` 567` haftmann@31949 ` 568` haftmann@22845 ` 569` ```subsection {* Proof tool setup *} ``` haftmann@22845 ` 570` haftmann@22845 ` 571` ```text {* simplifies terms of the form ``` haftmann@22845 ` 572` ``` f(...,x:=y,...,x:=z,...) to f(...,x:=z,...) *} ``` haftmann@22845 ` 573` wenzelm@24017 ` 574` ```simproc_setup fun_upd2 ("f(v := w, x := y)") = {* fn _ => ``` haftmann@22845 ` 575` ```let ``` haftmann@22845 ` 576` ``` fun gen_fun_upd NONE T _ _ = NONE ``` wenzelm@24017 ` 577` ``` | gen_fun_upd (SOME f) T x y = SOME (Const (@{const_name fun_upd}, T) \$ f \$ x \$ y) ``` haftmann@22845 ` 578` ``` fun dest_fun_T1 (Type (_, T :: Ts)) = T ``` haftmann@22845 ` 579` ``` fun find_double (t as Const (@{const_name fun_upd},T) \$ f \$ x \$ y) = ``` haftmann@22845 ` 580` ``` let ``` haftmann@22845 ` 581` ``` fun find (Const (@{const_name fun_upd},T) \$ g \$ v \$ w) = ``` haftmann@22845 ` 582` ``` if v aconv x then SOME g else gen_fun_upd (find g) T v w ``` haftmann@22845 ` 583` ``` | find t = NONE ``` haftmann@22845 ` 584` ``` in (dest_fun_T1 T, gen_fun_upd (find f) T x y) end ``` wenzelm@24017 ` 585` wenzelm@24017 ` 586` ``` fun proc ss ct = ``` wenzelm@24017 ` 587` ``` let ``` wenzelm@24017 ` 588` ``` val ctxt = Simplifier.the_context ss ``` wenzelm@24017 ` 589` ``` val t = Thm.term_of ct ``` wenzelm@24017 ` 590` ``` in ``` wenzelm@24017 ` 591` ``` case find_double t of ``` wenzelm@24017 ` 592` ``` (T, NONE) => NONE ``` wenzelm@24017 ` 593` ``` | (T, SOME rhs) => ``` wenzelm@27330 ` 594` ``` SOME (Goal.prove ctxt [] [] (Logic.mk_equals (t, rhs)) ``` wenzelm@24017 ` 595` ``` (fn _ => ``` wenzelm@24017 ` 596` ``` rtac eq_reflection 1 THEN ``` wenzelm@24017 ` 597` ``` rtac ext 1 THEN ``` wenzelm@24017 ` 598` ``` simp_tac (Simplifier.inherit_context ss @{simpset}) 1)) ``` wenzelm@24017 ` 599` ``` end ``` wenzelm@24017 ` 600` ```in proc end ``` haftmann@22845 ` 601` ```*} ``` haftmann@22845 ` 602` haftmann@22845 ` 603` haftmann@32554 ` 604` ```subsection {* Generic transfer procedure *} ``` haftmann@32554 ` 605` haftmann@32554 ` 606` ```definition TransferMorphism:: "('b \ 'a) \ 'b set \ bool" ``` haftmann@32554 ` 607` ``` where "TransferMorphism a B \ True" ``` haftmann@32554 ` 608` haftmann@32554 ` 609` ```use "Tools/transfer.ML" ``` haftmann@32554 ` 610` haftmann@32554 ` 611` ```setup Transfer.setup ``` haftmann@32554 ` 612` haftmann@32554 ` 613` haftmann@21870 ` 614` ```subsection {* Code generator setup *} ``` haftmann@21870 ` 615` berghofe@25886 ` 616` ```types_code ``` berghofe@25886 ` 617` ``` "fun" ("(_ ->/ _)") ``` berghofe@25886 ` 618` ```attach (term_of) {* ``` berghofe@25886 ` 619` ```fun term_of_fun_type _ aT _ bT _ = Free ("", aT --> bT); ``` berghofe@25886 ` 620` ```*} ``` berghofe@25886 ` 621` ```attach (test) {* ``` berghofe@25886 ` 622` ```fun gen_fun_type aF aT bG bT i = ``` berghofe@25886 ` 623` ``` let ``` wenzelm@32740 ` 624` ``` val tab = Unsynchronized.ref []; ``` berghofe@25886 ` 625` ``` fun mk_upd (x, (_, y)) t = Const ("Fun.fun_upd", ``` berghofe@25886 ` 626` ``` (aT --> bT) --> aT --> bT --> aT --> bT) \$ t \$ aF x \$ y () ``` berghofe@25886 ` 627` ``` in ``` berghofe@25886 ` 628` ``` (fn x => ``` berghofe@25886 ` 629` ``` case AList.lookup op = (!tab) x of ``` berghofe@25886 ` 630` ``` NONE => ``` berghofe@25886 ` 631` ``` let val p as (y, _) = bG i ``` berghofe@25886 ` 632` ``` in (tab := (x, p) :: !tab; y) end ``` berghofe@25886 ` 633` ``` | SOME (y, _) => y, ``` berghofe@28711 ` 634` ``` fn () => Basics.fold mk_upd (!tab) (Const ("HOL.undefined", aT --> bT))) ``` berghofe@25886 ` 635` ``` end; ``` berghofe@25886 ` 636` ```*} ``` berghofe@25886 ` 637` haftmann@21870 ` 638` ```code_const "op \" ``` haftmann@21870 ` 639` ``` (SML infixl 5 "o") ``` haftmann@21870 ` 640` ``` (Haskell infixr 9 ".") ``` haftmann@21870 ` 641` haftmann@21906 ` 642` ```code_const "id" ``` haftmann@21906 ` 643` ``` (Haskell "id") ``` haftmann@21906 ` 644` nipkow@2912 ` 645` ```end ```