src/ZF/Constructible/Separation.thy
 author paulson Wed Jul 17 15:48:54 2002 +0200 (2002-07-17) changeset 13385 31df66ca0780 parent 13363 c26eeb000470 child 13428 99e52e78eb65 permissions -rw-r--r--
Expressing Lset and L without using length and arity; simplifies Separation
proofs
 paulson@13339 ` 1` ```header{*Early Instances of Separation and Strong Replacement*} ``` paulson@13323 ` 2` paulson@13324 ` 3` ```theory Separation = L_axioms + WF_absolute: ``` paulson@13306 ` 4` paulson@13339 ` 5` ```text{*This theory proves all instances needed for locale @{text "M_axioms"}*} ``` paulson@13339 ` 6` paulson@13306 ` 7` ```text{*Helps us solve for de Bruijn indices!*} ``` paulson@13306 ` 8` ```lemma nth_ConsI: "[|nth(n,l) = x; n \ nat|] ==> nth(succ(n), Cons(a,l)) = x" ``` paulson@13306 ` 9` ```by simp ``` paulson@13306 ` 10` paulson@13316 ` 11` ```lemmas nth_rules = nth_0 nth_ConsI nat_0I nat_succI ``` paulson@13323 ` 12` ```lemmas sep_rules = nth_0 nth_ConsI FOL_iff_sats function_iff_sats ``` paulson@13323 ` 13` ``` fun_plus_iff_sats ``` paulson@13306 ` 14` paulson@13306 ` 15` ```lemma Collect_conj_in_DPow: ``` paulson@13306 ` 16` ``` "[| {x\A. P(x)} \ DPow(A); {x\A. Q(x)} \ DPow(A) |] ``` paulson@13306 ` 17` ``` ==> {x\A. P(x) & Q(x)} \ DPow(A)" ``` paulson@13306 ` 18` ```by (simp add: Int_in_DPow Collect_Int_Collect_eq [symmetric]) ``` paulson@13306 ` 19` paulson@13306 ` 20` ```lemma Collect_conj_in_DPow_Lset: ``` paulson@13306 ` 21` ``` "[|z \ Lset(j); {x \ Lset(j). P(x)} \ DPow(Lset(j))|] ``` paulson@13306 ` 22` ``` ==> {x \ Lset(j). x \ z & P(x)} \ DPow(Lset(j))" ``` paulson@13306 ` 23` ```apply (frule mem_Lset_imp_subset_Lset) ``` paulson@13306 ` 24` ```apply (simp add: Collect_conj_in_DPow Collect_mem_eq ``` paulson@13306 ` 25` ``` subset_Int_iff2 elem_subset_in_DPow) ``` paulson@13306 ` 26` ```done ``` paulson@13306 ` 27` paulson@13306 ` 28` ```lemma separation_CollectI: ``` paulson@13306 ` 29` ``` "(\z. L(z) ==> L({x \ z . P(x)})) ==> separation(L, \x. P(x))" ``` paulson@13306 ` 30` ```apply (unfold separation_def, clarify) ``` paulson@13306 ` 31` ```apply (rule_tac x="{x\z. P(x)}" in rexI) ``` paulson@13306 ` 32` ```apply simp_all ``` paulson@13306 ` 33` ```done ``` paulson@13306 ` 34` paulson@13306 ` 35` ```text{*Reduces the original comprehension to the reflected one*} ``` paulson@13306 ` 36` ```lemma reflection_imp_L_separation: ``` paulson@13306 ` 37` ``` "[| \x\Lset(j). P(x) <-> Q(x); ``` paulson@13306 ` 38` ``` {x \ Lset(j) . Q(x)} \ DPow(Lset(j)); ``` paulson@13306 ` 39` ``` Ord(j); z \ Lset(j)|] ==> L({x \ z . P(x)})" ``` paulson@13306 ` 40` ```apply (rule_tac i = "succ(j)" in L_I) ``` paulson@13306 ` 41` ``` prefer 2 apply simp ``` paulson@13306 ` 42` ```apply (subgoal_tac "{x \ z. P(x)} = {x \ Lset(j). x \ z & (Q(x))}") ``` paulson@13306 ` 43` ``` prefer 2 ``` paulson@13306 ` 44` ``` apply (blast dest: mem_Lset_imp_subset_Lset) ``` paulson@13306 ` 45` ```apply (simp add: Lset_succ Collect_conj_in_DPow_Lset) ``` paulson@13306 ` 46` ```done ``` paulson@13306 ` 47` paulson@13306 ` 48` paulson@13316 ` 49` ```subsection{*Separation for Intersection*} ``` paulson@13306 ` 50` paulson@13306 ` 51` ```lemma Inter_Reflects: ``` paulson@13314 ` 52` ``` "REFLECTS[\x. \y[L]. y\A --> x \ y, ``` paulson@13314 ` 53` ``` \i x. \y\Lset(i). y\A --> x \ y]" ``` paulson@13323 ` 54` ```by (intro FOL_reflections) ``` paulson@13306 ` 55` paulson@13306 ` 56` ```lemma Inter_separation: ``` paulson@13306 ` 57` ``` "L(A) ==> separation(L, \x. \y[L]. y\A --> x\y)" ``` paulson@13306 ` 58` ```apply (rule separation_CollectI) ``` paulson@13306 ` 59` ```apply (rule_tac A="{A,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 60` ```apply (rule ReflectsE [OF Inter_Reflects], assumption) ``` paulson@13306 ` 61` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 62` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 63` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 64` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 65` ```apply (rule ball_iff_sats) ``` paulson@13306 ` 66` ```apply (rule imp_iff_sats) ``` paulson@13306 ` 67` ```apply (rule_tac [2] i=1 and j=0 and env="[y,x,A]" in mem_iff_sats) ``` paulson@13306 ` 68` ```apply (rule_tac i=0 and j=2 in mem_iff_sats) ``` paulson@13306 ` 69` ```apply (simp_all add: succ_Un_distrib [symmetric]) ``` paulson@13306 ` 70` ```done ``` paulson@13306 ` 71` paulson@13316 ` 72` ```subsection{*Separation for Cartesian Product*} ``` paulson@13306 ` 73` paulson@13323 ` 74` ```lemma cartprod_Reflects: ``` paulson@13314 ` 75` ``` "REFLECTS[\z. \x[L]. x\A & (\y[L]. y\B & pair(L,x,y,z)), ``` paulson@13306 ` 76` ``` \i z. \x\Lset(i). x\A & (\y\Lset(i). y\B & ``` paulson@13314 ` 77` ``` pair(**Lset(i),x,y,z))]" ``` paulson@13323 ` 78` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 79` paulson@13306 ` 80` ```lemma cartprod_separation: ``` paulson@13306 ` 81` ``` "[| L(A); L(B) |] ``` paulson@13306 ` 82` ``` ==> separation(L, \z. \x[L]. x\A & (\y[L]. y\B & pair(L,x,y,z)))" ``` paulson@13306 ` 83` ```apply (rule separation_CollectI) ``` paulson@13306 ` 84` ```apply (rule_tac A="{A,B,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 85` ```apply (rule ReflectsE [OF cartprod_Reflects], assumption) ``` paulson@13306 ` 86` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 87` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 88` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 89` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 90` ```apply (rename_tac u) ``` paulson@13306 ` 91` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 92` ```apply (rule conj_iff_sats) ``` paulson@13306 ` 93` ```apply (rule_tac i=0 and j=2 and env="[x,u,A,B]" in mem_iff_sats, simp_all) ``` paulson@13316 ` 94` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 95` ```done ``` paulson@13306 ` 96` paulson@13316 ` 97` ```subsection{*Separation for Image*} ``` paulson@13306 ` 98` paulson@13306 ` 99` ```lemma image_Reflects: ``` paulson@13314 ` 100` ``` "REFLECTS[\y. \p[L]. p\r & (\x[L]. x\A & pair(L,x,y,p)), ``` paulson@13314 ` 101` ``` \i y. \p\Lset(i). p\r & (\x\Lset(i). x\A & pair(**Lset(i),x,y,p))]" ``` paulson@13323 ` 102` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 103` paulson@13306 ` 104` ```lemma image_separation: ``` paulson@13306 ` 105` ``` "[| L(A); L(r) |] ``` paulson@13306 ` 106` ``` ==> separation(L, \y. \p[L]. p\r & (\x[L]. x\A & pair(L,x,y,p)))" ``` paulson@13306 ` 107` ```apply (rule separation_CollectI) ``` paulson@13306 ` 108` ```apply (rule_tac A="{A,r,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 109` ```apply (rule ReflectsE [OF image_Reflects], assumption) ``` paulson@13306 ` 110` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 111` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 112` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 113` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 114` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 115` ```apply (rule conj_iff_sats) ``` paulson@13306 ` 116` ```apply (rule_tac env="[p,y,A,r]" in mem_iff_sats) ``` paulson@13316 ` 117` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 118` ```done ``` paulson@13306 ` 119` paulson@13306 ` 120` paulson@13316 ` 121` ```subsection{*Separation for Converse*} ``` paulson@13306 ` 122` paulson@13306 ` 123` ```lemma converse_Reflects: ``` paulson@13314 ` 124` ``` "REFLECTS[\z. \p[L]. p\r & (\x[L]. \y[L]. pair(L,x,y,p) & pair(L,y,x,z)), ``` paulson@13306 ` 125` ``` \i z. \p\Lset(i). p\r & (\x\Lset(i). \y\Lset(i). ``` paulson@13314 ` 126` ``` pair(**Lset(i),x,y,p) & pair(**Lset(i),y,x,z))]" ``` paulson@13323 ` 127` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 128` paulson@13306 ` 129` ```lemma converse_separation: ``` paulson@13306 ` 130` ``` "L(r) ==> separation(L, ``` paulson@13306 ` 131` ``` \z. \p[L]. p\r & (\x[L]. \y[L]. pair(L,x,y,p) & pair(L,y,x,z)))" ``` paulson@13306 ` 132` ```apply (rule separation_CollectI) ``` paulson@13306 ` 133` ```apply (rule_tac A="{r,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 134` ```apply (rule ReflectsE [OF converse_Reflects], assumption) ``` paulson@13306 ` 135` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 136` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 137` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 138` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 139` ```apply (rename_tac u) ``` paulson@13306 ` 140` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 141` ```apply (rule conj_iff_sats) ``` paulson@13339 ` 142` ```apply (rule_tac i=0 and j=2 and env="[p,u,r]" in mem_iff_sats, simp_all) ``` paulson@13316 ` 143` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 144` ```done ``` paulson@13306 ` 145` paulson@13306 ` 146` paulson@13316 ` 147` ```subsection{*Separation for Restriction*} ``` paulson@13306 ` 148` paulson@13306 ` 149` ```lemma restrict_Reflects: ``` paulson@13314 ` 150` ``` "REFLECTS[\z. \x[L]. x\A & (\y[L]. pair(L,x,y,z)), ``` paulson@13314 ` 151` ``` \i z. \x\Lset(i). x\A & (\y\Lset(i). pair(**Lset(i),x,y,z))]" ``` paulson@13323 ` 152` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 153` paulson@13306 ` 154` ```lemma restrict_separation: ``` paulson@13306 ` 155` ``` "L(A) ==> separation(L, \z. \x[L]. x\A & (\y[L]. pair(L,x,y,z)))" ``` paulson@13306 ` 156` ```apply (rule separation_CollectI) ``` paulson@13306 ` 157` ```apply (rule_tac A="{A,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 158` ```apply (rule ReflectsE [OF restrict_Reflects], assumption) ``` paulson@13306 ` 159` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 160` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 161` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 162` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 163` ```apply (rename_tac u) ``` paulson@13306 ` 164` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 165` ```apply (rule conj_iff_sats) ``` paulson@13339 ` 166` ```apply (rule_tac i=0 and j=2 and env="[x,u,A]" in mem_iff_sats, simp_all) ``` paulson@13316 ` 167` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 168` ```done ``` paulson@13306 ` 169` paulson@13306 ` 170` paulson@13316 ` 171` ```subsection{*Separation for Composition*} ``` paulson@13306 ` 172` paulson@13306 ` 173` ```lemma comp_Reflects: ``` paulson@13314 ` 174` ``` "REFLECTS[\xz. \x[L]. \y[L]. \z[L]. \xy[L]. \yz[L]. ``` paulson@13306 ` 175` ``` pair(L,x,z,xz) & pair(L,x,y,xy) & pair(L,y,z,yz) & ``` paulson@13306 ` 176` ``` xy\s & yz\r, ``` paulson@13306 ` 177` ``` \i xz. \x\Lset(i). \y\Lset(i). \z\Lset(i). \xy\Lset(i). \yz\Lset(i). ``` paulson@13306 ` 178` ``` pair(**Lset(i),x,z,xz) & pair(**Lset(i),x,y,xy) & ``` paulson@13314 ` 179` ``` pair(**Lset(i),y,z,yz) & xy\s & yz\r]" ``` paulson@13323 ` 180` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 181` paulson@13306 ` 182` ```lemma comp_separation: ``` paulson@13306 ` 183` ``` "[| L(r); L(s) |] ``` paulson@13306 ` 184` ``` ==> separation(L, \xz. \x[L]. \y[L]. \z[L]. \xy[L]. \yz[L]. ``` paulson@13306 ` 185` ``` pair(L,x,z,xz) & pair(L,x,y,xy) & pair(L,y,z,yz) & ``` paulson@13306 ` 186` ``` xy\s & yz\r)" ``` paulson@13306 ` 187` ```apply (rule separation_CollectI) ``` paulson@13306 ` 188` ```apply (rule_tac A="{r,s,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 189` ```apply (rule ReflectsE [OF comp_Reflects], assumption) ``` paulson@13306 ` 190` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 191` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 192` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 193` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 194` ```apply (rename_tac u) ``` paulson@13306 ` 195` ```apply (rule bex_iff_sats)+ ``` paulson@13306 ` 196` ```apply (rename_tac x y z) ``` paulson@13306 ` 197` ```apply (rule conj_iff_sats) ``` paulson@13306 ` 198` ```apply (rule_tac env="[z,y,x,u,r,s]" in pair_iff_sats) ``` paulson@13316 ` 199` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 200` ```done ``` paulson@13306 ` 201` paulson@13316 ` 202` ```subsection{*Separation for Predecessors in an Order*} ``` paulson@13306 ` 203` paulson@13306 ` 204` ```lemma pred_Reflects: ``` paulson@13314 ` 205` ``` "REFLECTS[\y. \p[L]. p\r & pair(L,y,x,p), ``` paulson@13314 ` 206` ``` \i y. \p \ Lset(i). p\r & pair(**Lset(i),y,x,p)]" ``` paulson@13323 ` 207` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 208` paulson@13306 ` 209` ```lemma pred_separation: ``` paulson@13306 ` 210` ``` "[| L(r); L(x) |] ==> separation(L, \y. \p[L]. p\r & pair(L,y,x,p))" ``` paulson@13306 ` 211` ```apply (rule separation_CollectI) ``` paulson@13306 ` 212` ```apply (rule_tac A="{r,x,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 213` ```apply (rule ReflectsE [OF pred_Reflects], assumption) ``` paulson@13306 ` 214` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 215` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 216` ``` apply (simp_all add: lt_Ord2, clarify) ``` paulson@13385 ` 217` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 218` ```apply (rename_tac u) ``` paulson@13306 ` 219` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 220` ```apply (rule conj_iff_sats) ``` paulson@13306 ` 221` ```apply (rule_tac env = "[p,u,r,x]" in mem_iff_sats) ``` paulson@13316 ` 222` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 223` ```done ``` paulson@13306 ` 224` paulson@13306 ` 225` paulson@13316 ` 226` ```subsection{*Separation for the Membership Relation*} ``` paulson@13306 ` 227` paulson@13306 ` 228` ```lemma Memrel_Reflects: ``` paulson@13314 ` 229` ``` "REFLECTS[\z. \x[L]. \y[L]. pair(L,x,y,z) & x \ y, ``` paulson@13314 ` 230` ``` \i z. \x \ Lset(i). \y \ Lset(i). pair(**Lset(i),x,y,z) & x \ y]" ``` paulson@13323 ` 231` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 232` paulson@13306 ` 233` ```lemma Memrel_separation: ``` paulson@13306 ` 234` ``` "separation(L, \z. \x[L]. \y[L]. pair(L,x,y,z) & x \ y)" ``` paulson@13306 ` 235` ```apply (rule separation_CollectI) ``` paulson@13306 ` 236` ```apply (rule_tac A="{z}" in subset_LsetE, blast ) ``` paulson@13306 ` 237` ```apply (rule ReflectsE [OF Memrel_Reflects], assumption) ``` paulson@13306 ` 238` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 239` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 240` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 241` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 242` ```apply (rename_tac u) ``` paulson@13316 ` 243` ```apply (rule bex_iff_sats conj_iff_sats)+ ``` paulson@13306 ` 244` ```apply (rule_tac env = "[y,x,u]" in pair_iff_sats) ``` paulson@13316 ` 245` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 246` ```done ``` paulson@13306 ` 247` paulson@13306 ` 248` paulson@13316 ` 249` ```subsection{*Replacement for FunSpace*} ``` paulson@13306 ` 250` ``` ``` paulson@13306 ` 251` ```lemma funspace_succ_Reflects: ``` paulson@13314 ` 252` ``` "REFLECTS[\z. \p[L]. p\A & (\f[L]. \b[L]. \nb[L]. \cnbf[L]. ``` paulson@13306 ` 253` ``` pair(L,f,b,p) & pair(L,n,b,nb) & is_cons(L,nb,f,cnbf) & ``` paulson@13306 ` 254` ``` upair(L,cnbf,cnbf,z)), ``` paulson@13306 ` 255` ``` \i z. \p \ Lset(i). p\A & (\f \ Lset(i). \b \ Lset(i). ``` paulson@13306 ` 256` ``` \nb \ Lset(i). \cnbf \ Lset(i). ``` paulson@13306 ` 257` ``` pair(**Lset(i),f,b,p) & pair(**Lset(i),n,b,nb) & ``` paulson@13314 ` 258` ``` is_cons(**Lset(i),nb,f,cnbf) & upair(**Lset(i),cnbf,cnbf,z))]" ``` paulson@13323 ` 259` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 260` paulson@13306 ` 261` ```lemma funspace_succ_replacement: ``` paulson@13306 ` 262` ``` "L(n) ==> ``` paulson@13306 ` 263` ``` strong_replacement(L, \p z. \f[L]. \b[L]. \nb[L]. \cnbf[L]. ``` paulson@13306 ` 264` ``` pair(L,f,b,p) & pair(L,n,b,nb) & is_cons(L,nb,f,cnbf) & ``` paulson@13306 ` 265` ``` upair(L,cnbf,cnbf,z))" ``` paulson@13306 ` 266` ```apply (rule strong_replacementI) ``` paulson@13306 ` 267` ```apply (rule rallI) ``` paulson@13306 ` 268` ```apply (rule separation_CollectI) ``` paulson@13306 ` 269` ```apply (rule_tac A="{n,A,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 270` ```apply (rule ReflectsE [OF funspace_succ_Reflects], assumption) ``` paulson@13306 ` 271` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 272` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 273` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 274` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 275` ```apply (rename_tac u) ``` paulson@13306 ` 276` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 277` ```apply (rule conj_iff_sats) ``` paulson@13339 ` 278` ```apply (rule_tac env = "[p,u,n,A]" in mem_iff_sats) ``` paulson@13316 ` 279` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 280` ```done ``` paulson@13306 ` 281` paulson@13306 ` 282` paulson@13316 ` 283` ```subsection{*Separation for Order-Isomorphisms*} ``` paulson@13306 ` 284` paulson@13306 ` 285` ```lemma well_ord_iso_Reflects: ``` paulson@13314 ` 286` ``` "REFLECTS[\x. x\A --> ``` paulson@13314 ` 287` ``` (\y[L]. \p[L]. fun_apply(L,f,x,y) & pair(L,y,x,p) & p \ r), ``` paulson@13314 ` 288` ``` \i x. x\A --> (\y \ Lset(i). \p \ Lset(i). ``` paulson@13314 ` 289` ``` fun_apply(**Lset(i),f,x,y) & pair(**Lset(i),y,x,p) & p \ r)]" ``` paulson@13323 ` 290` ```by (intro FOL_reflections function_reflections) ``` paulson@13306 ` 291` paulson@13306 ` 292` ```lemma well_ord_iso_separation: ``` paulson@13306 ` 293` ``` "[| L(A); L(f); L(r) |] ``` paulson@13306 ` 294` ``` ==> separation (L, \x. x\A --> (\y[L]. (\p[L]. ``` paulson@13306 ` 295` ``` fun_apply(L,f,x,y) & pair(L,y,x,p) & p \ r)))" ``` paulson@13306 ` 296` ```apply (rule separation_CollectI) ``` paulson@13306 ` 297` ```apply (rule_tac A="{A,f,r,z}" in subset_LsetE, blast ) ``` paulson@13306 ` 298` ```apply (rule ReflectsE [OF well_ord_iso_Reflects], assumption) ``` paulson@13306 ` 299` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13306 ` 300` ```apply (erule reflection_imp_L_separation) ``` paulson@13306 ` 301` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 302` ```apply (rule DPow_LsetI) ``` paulson@13306 ` 303` ```apply (rename_tac u) ``` paulson@13306 ` 304` ```apply (rule imp_iff_sats) ``` paulson@13306 ` 305` ```apply (rule_tac env = "[u,A,f,r]" in mem_iff_sats) ``` paulson@13316 ` 306` ```apply (rule sep_rules | simp)+ ``` paulson@13316 ` 307` ```done ``` paulson@13316 ` 308` paulson@13316 ` 309` paulson@13316 ` 310` ```subsection{*Separation for @{term "obase"}*} ``` paulson@13316 ` 311` paulson@13316 ` 312` ```lemma obase_reflects: ``` paulson@13316 ` 313` ``` "REFLECTS[\a. \x[L]. \g[L]. \mx[L]. \par[L]. ``` paulson@13316 ` 314` ``` ordinal(L,x) & membership(L,x,mx) & pred_set(L,A,a,r,par) & ``` paulson@13316 ` 315` ``` order_isomorphism(L,par,r,x,mx,g), ``` paulson@13316 ` 316` ``` \i a. \x \ Lset(i). \g \ Lset(i). \mx \ Lset(i). \par \ Lset(i). ``` paulson@13316 ` 317` ``` ordinal(**Lset(i),x) & membership(**Lset(i),x,mx) & pred_set(**Lset(i),A,a,r,par) & ``` paulson@13316 ` 318` ``` order_isomorphism(**Lset(i),par,r,x,mx,g)]" ``` paulson@13323 ` 319` ```by (intro FOL_reflections function_reflections fun_plus_reflections) ``` paulson@13316 ` 320` paulson@13316 ` 321` ```lemma obase_separation: ``` paulson@13316 ` 322` ``` --{*part of the order type formalization*} ``` paulson@13316 ` 323` ``` "[| L(A); L(r) |] ``` paulson@13316 ` 324` ``` ==> separation(L, \a. \x[L]. \g[L]. \mx[L]. \par[L]. ``` paulson@13316 ` 325` ``` ordinal(L,x) & membership(L,x,mx) & pred_set(L,A,a,r,par) & ``` paulson@13316 ` 326` ``` order_isomorphism(L,par,r,x,mx,g))" ``` paulson@13316 ` 327` ```apply (rule separation_CollectI) ``` paulson@13316 ` 328` ```apply (rule_tac A="{A,r,z}" in subset_LsetE, blast ) ``` paulson@13316 ` 329` ```apply (rule ReflectsE [OF obase_reflects], assumption) ``` paulson@13316 ` 330` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13316 ` 331` ```apply (erule reflection_imp_L_separation) ``` paulson@13316 ` 332` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 333` ```apply (rule DPow_LsetI) ``` paulson@13316 ` 334` ```apply (rename_tac u) ``` paulson@13306 ` 335` ```apply (rule bex_iff_sats) ``` paulson@13306 ` 336` ```apply (rule conj_iff_sats) ``` paulson@13316 ` 337` ```apply (rule_tac env = "[x,u,A,r]" in ordinal_iff_sats) ``` paulson@13316 ` 338` ```apply (rule sep_rules | simp)+ ``` paulson@13316 ` 339` ```done ``` paulson@13316 ` 340` paulson@13316 ` 341` paulson@13319 ` 342` ```subsection{*Separation for a Theorem about @{term "obase"}*} ``` paulson@13316 ` 343` paulson@13316 ` 344` ```lemma obase_equals_reflects: ``` paulson@13316 ` 345` ``` "REFLECTS[\x. x\A --> ~(\y[L]. \g[L]. ``` paulson@13316 ` 346` ``` ordinal(L,y) & (\my[L]. \pxr[L]. ``` paulson@13316 ` 347` ``` membership(L,y,my) & pred_set(L,A,x,r,pxr) & ``` paulson@13316 ` 348` ``` order_isomorphism(L,pxr,r,y,my,g))), ``` paulson@13316 ` 349` ``` \i x. x\A --> ~(\y \ Lset(i). \g \ Lset(i). ``` paulson@13316 ` 350` ``` ordinal(**Lset(i),y) & (\my \ Lset(i). \pxr \ Lset(i). ``` paulson@13316 ` 351` ``` membership(**Lset(i),y,my) & pred_set(**Lset(i),A,x,r,pxr) & ``` paulson@13316 ` 352` ``` order_isomorphism(**Lset(i),pxr,r,y,my,g)))]" ``` paulson@13323 ` 353` ```by (intro FOL_reflections function_reflections fun_plus_reflections) ``` paulson@13316 ` 354` paulson@13316 ` 355` paulson@13316 ` 356` ```lemma obase_equals_separation: ``` paulson@13316 ` 357` ``` "[| L(A); L(r) |] ``` paulson@13316 ` 358` ``` ==> separation (L, \x. x\A --> ~(\y[L]. \g[L]. ``` paulson@13316 ` 359` ``` ordinal(L,y) & (\my[L]. \pxr[L]. ``` paulson@13316 ` 360` ``` membership(L,y,my) & pred_set(L,A,x,r,pxr) & ``` paulson@13316 ` 361` ``` order_isomorphism(L,pxr,r,y,my,g))))" ``` paulson@13316 ` 362` ```apply (rule separation_CollectI) ``` paulson@13316 ` 363` ```apply (rule_tac A="{A,r,z}" in subset_LsetE, blast ) ``` paulson@13316 ` 364` ```apply (rule ReflectsE [OF obase_equals_reflects], assumption) ``` paulson@13316 ` 365` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13316 ` 366` ```apply (erule reflection_imp_L_separation) ``` paulson@13316 ` 367` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 368` ```apply (rule DPow_LsetI) ``` paulson@13316 ` 369` ```apply (rename_tac u) ``` paulson@13316 ` 370` ```apply (rule imp_iff_sats ball_iff_sats disj_iff_sats not_iff_sats)+ ``` paulson@13316 ` 371` ```apply (rule_tac env = "[u,A,r]" in mem_iff_sats) ``` paulson@13316 ` 372` ```apply (rule sep_rules | simp)+ ``` paulson@13316 ` 373` ```done ``` paulson@13316 ` 374` paulson@13316 ` 375` paulson@13316 ` 376` ```subsection{*Replacement for @{term "omap"}*} ``` paulson@13316 ` 377` paulson@13316 ` 378` ```lemma omap_reflects: ``` paulson@13316 ` 379` ``` "REFLECTS[\z. \a[L]. a\B & (\x[L]. \g[L]. \mx[L]. \par[L]. ``` paulson@13316 ` 380` ``` ordinal(L,x) & pair(L,a,x,z) & membership(L,x,mx) & ``` paulson@13316 ` 381` ``` pred_set(L,A,a,r,par) & order_isomorphism(L,par,r,x,mx,g)), ``` paulson@13316 ` 382` ``` \i z. \a \ Lset(i). a\B & (\x \ Lset(i). \g \ Lset(i). \mx \ Lset(i). ``` paulson@13316 ` 383` ``` \par \ Lset(i). ``` paulson@13316 ` 384` ``` ordinal(**Lset(i),x) & pair(**Lset(i),a,x,z) & ``` paulson@13316 ` 385` ``` membership(**Lset(i),x,mx) & pred_set(**Lset(i),A,a,r,par) & ``` paulson@13316 ` 386` ``` order_isomorphism(**Lset(i),par,r,x,mx,g))]" ``` paulson@13323 ` 387` ```by (intro FOL_reflections function_reflections fun_plus_reflections) ``` paulson@13316 ` 388` paulson@13316 ` 389` ```lemma omap_replacement: ``` paulson@13316 ` 390` ``` "[| L(A); L(r) |] ``` paulson@13316 ` 391` ``` ==> strong_replacement(L, ``` paulson@13316 ` 392` ``` \a z. \x[L]. \g[L]. \mx[L]. \par[L]. ``` paulson@13316 ` 393` ``` ordinal(L,x) & pair(L,a,x,z) & membership(L,x,mx) & ``` paulson@13316 ` 394` ``` pred_set(L,A,a,r,par) & order_isomorphism(L,par,r,x,mx,g))" ``` paulson@13316 ` 395` ```apply (rule strong_replacementI) ``` paulson@13316 ` 396` ```apply (rule rallI) ``` paulson@13316 ` 397` ```apply (rename_tac B) ``` paulson@13316 ` 398` ```apply (rule separation_CollectI) ``` paulson@13316 ` 399` ```apply (rule_tac A="{A,B,r,z}" in subset_LsetE, blast ) ``` paulson@13316 ` 400` ```apply (rule ReflectsE [OF omap_reflects], assumption) ``` paulson@13316 ` 401` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13316 ` 402` ```apply (erule reflection_imp_L_separation) ``` paulson@13316 ` 403` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 404` ```apply (rule DPow_LsetI) ``` paulson@13316 ` 405` ```apply (rename_tac u) ``` paulson@13316 ` 406` ```apply (rule bex_iff_sats conj_iff_sats)+ ``` paulson@13339 ` 407` ```apply (rule_tac env = "[a,u,A,B,r]" in mem_iff_sats) ``` paulson@13316 ` 408` ```apply (rule sep_rules | simp)+ ``` paulson@13306 ` 409` ```done ``` paulson@13306 ` 410` paulson@13323 ` 411` paulson@13323 ` 412` ```subsection{*Separation for a Theorem about @{term "obase"}*} ``` paulson@13323 ` 413` paulson@13323 ` 414` ```lemma is_recfun_reflects: ``` paulson@13323 ` 415` ``` "REFLECTS[\x. \xa[L]. \xb[L]. ``` paulson@13323 ` 416` ``` pair(L,x,a,xa) & xa \ r & pair(L,x,b,xb) & xb \ r & ``` paulson@13323 ` 417` ``` (\fx[L]. \gx[L]. fun_apply(L,f,x,fx) & fun_apply(L,g,x,gx) & ``` paulson@13323 ` 418` ``` fx \ gx), ``` paulson@13323 ` 419` ``` \i x. \xa \ Lset(i). \xb \ Lset(i). ``` paulson@13323 ` 420` ``` pair(**Lset(i),x,a,xa) & xa \ r & pair(**Lset(i),x,b,xb) & xb \ r & ``` paulson@13323 ` 421` ``` (\fx \ Lset(i). \gx \ Lset(i). fun_apply(**Lset(i),f,x,fx) & ``` paulson@13323 ` 422` ``` fun_apply(**Lset(i),g,x,gx) & fx \ gx)]" ``` paulson@13323 ` 423` ```by (intro FOL_reflections function_reflections fun_plus_reflections) ``` paulson@13323 ` 424` paulson@13323 ` 425` ```lemma is_recfun_separation: ``` paulson@13323 ` 426` ``` --{*for well-founded recursion*} ``` paulson@13323 ` 427` ``` "[| L(r); L(f); L(g); L(a); L(b) |] ``` paulson@13323 ` 428` ``` ==> separation(L, ``` paulson@13323 ` 429` ``` \x. \xa[L]. \xb[L]. ``` paulson@13323 ` 430` ``` pair(L,x,a,xa) & xa \ r & pair(L,x,b,xb) & xb \ r & ``` paulson@13323 ` 431` ``` (\fx[L]. \gx[L]. fun_apply(L,f,x,fx) & fun_apply(L,g,x,gx) & ``` paulson@13323 ` 432` ``` fx \ gx))" ``` paulson@13323 ` 433` ```apply (rule separation_CollectI) ``` paulson@13323 ` 434` ```apply (rule_tac A="{r,f,g,a,b,z}" in subset_LsetE, blast ) ``` paulson@13323 ` 435` ```apply (rule ReflectsE [OF is_recfun_reflects], assumption) ``` paulson@13323 ` 436` ```apply (drule subset_Lset_ltD, assumption) ``` paulson@13323 ` 437` ```apply (erule reflection_imp_L_separation) ``` paulson@13323 ` 438` ``` apply (simp_all add: lt_Ord2) ``` paulson@13385 ` 439` ```apply (rule DPow_LsetI) ``` paulson@13323 ` 440` ```apply (rename_tac u) ``` paulson@13323 ` 441` ```apply (rule bex_iff_sats conj_iff_sats)+ ``` paulson@13339 ` 442` ```apply (rule_tac env = "[xa,u,r,f,g,a,b]" in pair_iff_sats) ``` paulson@13323 ` 443` ```apply (rule sep_rules | simp)+ ``` paulson@13323 ` 444` ```done ``` paulson@13323 ` 445` paulson@13323 ` 446` paulson@13363 ` 447` ```subsection{*Instantiating the locale @{text M_axioms}*} ``` paulson@13363 ` 448` ```text{*Separation (and Strong Replacement) for basic set-theoretic constructions ``` paulson@13363 ` 449` ```such as intersection, Cartesian Product and image.*} ``` paulson@13363 ` 450` paulson@13323 ` 451` ```ML ``` paulson@13323 ` 452` ```{* ``` paulson@13323 ` 453` ```val Inter_separation = thm "Inter_separation"; ``` paulson@13323 ` 454` ```val cartprod_separation = thm "cartprod_separation"; ``` paulson@13323 ` 455` ```val image_separation = thm "image_separation"; ``` paulson@13323 ` 456` ```val converse_separation = thm "converse_separation"; ``` paulson@13323 ` 457` ```val restrict_separation = thm "restrict_separation"; ``` paulson@13323 ` 458` ```val comp_separation = thm "comp_separation"; ``` paulson@13323 ` 459` ```val pred_separation = thm "pred_separation"; ``` paulson@13323 ` 460` ```val Memrel_separation = thm "Memrel_separation"; ``` paulson@13323 ` 461` ```val funspace_succ_replacement = thm "funspace_succ_replacement"; ``` paulson@13323 ` 462` ```val well_ord_iso_separation = thm "well_ord_iso_separation"; ``` paulson@13323 ` 463` ```val obase_separation = thm "obase_separation"; ``` paulson@13323 ` 464` ```val obase_equals_separation = thm "obase_equals_separation"; ``` paulson@13323 ` 465` ```val omap_replacement = thm "omap_replacement"; ``` paulson@13323 ` 466` ```val is_recfun_separation = thm "is_recfun_separation"; ``` paulson@13323 ` 467` paulson@13323 ` 468` ```val m_axioms = ``` paulson@13323 ` 469` ``` [Inter_separation, cartprod_separation, image_separation, ``` paulson@13323 ` 470` ``` converse_separation, restrict_separation, comp_separation, ``` paulson@13323 ` 471` ``` pred_separation, Memrel_separation, funspace_succ_replacement, ``` paulson@13323 ` 472` ``` well_ord_iso_separation, obase_separation, ``` paulson@13323 ` 473` ``` obase_equals_separation, omap_replacement, is_recfun_separation] ``` paulson@13323 ` 474` paulson@13363 ` 475` ```fun axioms_L th = ``` paulson@13363 ` 476` ``` kill_flex_triv_prems (m_axioms MRS (triv_axioms_L th)); ``` paulson@13323 ` 477` paulson@13363 ` 478` ```bind_thm ("cartprod_iff", axioms_L (thm "M_axioms.cartprod_iff")); ``` paulson@13363 ` 479` ```bind_thm ("cartprod_closed", axioms_L (thm "M_axioms.cartprod_closed")); ``` paulson@13363 ` 480` ```bind_thm ("sum_closed", axioms_L (thm "M_axioms.sum_closed")); ``` paulson@13363 ` 481` ```bind_thm ("M_converse_iff", axioms_L (thm "M_axioms.M_converse_iff")); ``` paulson@13363 ` 482` ```bind_thm ("converse_closed", axioms_L (thm "M_axioms.converse_closed")); ``` paulson@13363 ` 483` ```bind_thm ("converse_abs", axioms_L (thm "M_axioms.converse_abs")); ``` paulson@13363 ` 484` ```bind_thm ("image_closed", axioms_L (thm "M_axioms.image_closed")); ``` paulson@13363 ` 485` ```bind_thm ("vimage_abs", axioms_L (thm "M_axioms.vimage_abs")); ``` paulson@13363 ` 486` ```bind_thm ("vimage_closed", axioms_L (thm "M_axioms.vimage_closed")); ``` paulson@13363 ` 487` ```bind_thm ("domain_abs", axioms_L (thm "M_axioms.domain_abs")); ``` paulson@13363 ` 488` ```bind_thm ("domain_closed", axioms_L (thm "M_axioms.domain_closed")); ``` paulson@13363 ` 489` ```bind_thm ("range_abs", axioms_L (thm "M_axioms.range_abs")); ``` paulson@13363 ` 490` ```bind_thm ("range_closed", axioms_L (thm "M_axioms.range_closed")); ``` paulson@13363 ` 491` ```bind_thm ("field_abs", axioms_L (thm "M_axioms.field_abs")); ``` paulson@13363 ` 492` ```bind_thm ("field_closed", axioms_L (thm "M_axioms.field_closed")); ``` paulson@13363 ` 493` ```bind_thm ("relation_abs", axioms_L (thm "M_axioms.relation_abs")); ``` paulson@13363 ` 494` ```bind_thm ("function_abs", axioms_L (thm "M_axioms.function_abs")); ``` paulson@13363 ` 495` ```bind_thm ("apply_closed", axioms_L (thm "M_axioms.apply_closed")); ``` paulson@13363 ` 496` ```bind_thm ("apply_abs", axioms_L (thm "M_axioms.apply_abs")); ``` paulson@13363 ` 497` ```bind_thm ("typed_function_abs", axioms_L (thm "M_axioms.typed_function_abs")); ``` paulson@13363 ` 498` ```bind_thm ("injection_abs", axioms_L (thm "M_axioms.injection_abs")); ``` paulson@13363 ` 499` ```bind_thm ("surjection_abs", axioms_L (thm "M_axioms.surjection_abs")); ``` paulson@13363 ` 500` ```bind_thm ("bijection_abs", axioms_L (thm "M_axioms.bijection_abs")); ``` paulson@13363 ` 501` ```bind_thm ("M_comp_iff", axioms_L (thm "M_axioms.M_comp_iff")); ``` paulson@13363 ` 502` ```bind_thm ("comp_closed", axioms_L (thm "M_axioms.comp_closed")); ``` paulson@13363 ` 503` ```bind_thm ("composition_abs", axioms_L (thm "M_axioms.composition_abs")); ``` paulson@13363 ` 504` ```bind_thm ("restriction_is_function", axioms_L (thm "M_axioms.restriction_is_function")); ``` paulson@13363 ` 505` ```bind_thm ("restriction_abs", axioms_L (thm "M_axioms.restriction_abs")); ``` paulson@13363 ` 506` ```bind_thm ("M_restrict_iff", axioms_L (thm "M_axioms.M_restrict_iff")); ``` paulson@13363 ` 507` ```bind_thm ("restrict_closed", axioms_L (thm "M_axioms.restrict_closed")); ``` paulson@13363 ` 508` ```bind_thm ("Inter_abs", axioms_L (thm "M_axioms.Inter_abs")); ``` paulson@13363 ` 509` ```bind_thm ("Inter_closed", axioms_L (thm "M_axioms.Inter_closed")); ``` paulson@13363 ` 510` ```bind_thm ("Int_closed", axioms_L (thm "M_axioms.Int_closed")); ``` paulson@13363 ` 511` ```bind_thm ("finite_fun_closed", axioms_L (thm "M_axioms.finite_fun_closed")); ``` paulson@13363 ` 512` ```bind_thm ("is_funspace_abs", axioms_L (thm "M_axioms.is_funspace_abs")); ``` paulson@13363 ` 513` ```bind_thm ("succ_fun_eq2", axioms_L (thm "M_axioms.succ_fun_eq2")); ``` paulson@13363 ` 514` ```bind_thm ("funspace_succ", axioms_L (thm "M_axioms.funspace_succ")); ``` paulson@13363 ` 515` ```bind_thm ("finite_funspace_closed", axioms_L (thm "M_axioms.finite_funspace_closed")); ``` paulson@13323 ` 516` ```*} ``` paulson@13323 ` 517` paulson@13323 ` 518` ```ML ``` paulson@13323 ` 519` ```{* ``` paulson@13363 ` 520` ```bind_thm ("is_recfun_equal", axioms_L (thm "M_axioms.is_recfun_equal")); ``` paulson@13363 ` 521` ```bind_thm ("is_recfun_cut", axioms_L (thm "M_axioms.is_recfun_cut")); ``` paulson@13363 ` 522` ```bind_thm ("is_recfun_functional", axioms_L (thm "M_axioms.is_recfun_functional")); ``` paulson@13363 ` 523` ```bind_thm ("is_recfun_relativize", axioms_L (thm "M_axioms.is_recfun_relativize")); ``` paulson@13363 ` 524` ```bind_thm ("is_recfun_restrict", axioms_L (thm "M_axioms.is_recfun_restrict")); ``` paulson@13363 ` 525` ```bind_thm ("univalent_is_recfun", axioms_L (thm "M_axioms.univalent_is_recfun")); ``` paulson@13363 ` 526` ```bind_thm ("exists_is_recfun_indstep", axioms_L (thm "M_axioms.exists_is_recfun_indstep")); ``` paulson@13363 ` 527` ```bind_thm ("wellfounded_exists_is_recfun", axioms_L (thm "M_axioms.wellfounded_exists_is_recfun")); ``` paulson@13363 ` 528` ```bind_thm ("wf_exists_is_recfun", axioms_L (thm "M_axioms.wf_exists_is_recfun")); ``` paulson@13363 ` 529` ```bind_thm ("is_recfun_abs", axioms_L (thm "M_axioms.is_recfun_abs")); ``` paulson@13363 ` 530` ```bind_thm ("irreflexive_abs", axioms_L (thm "M_axioms.irreflexive_abs")); ``` paulson@13363 ` 531` ```bind_thm ("transitive_rel_abs", axioms_L (thm "M_axioms.transitive_rel_abs")); ``` paulson@13363 ` 532` ```bind_thm ("linear_rel_abs", axioms_L (thm "M_axioms.linear_rel_abs")); ``` paulson@13363 ` 533` ```bind_thm ("wellordered_is_trans_on", axioms_L (thm "M_axioms.wellordered_is_trans_on")); ``` paulson@13363 ` 534` ```bind_thm ("wellordered_is_linear", axioms_L (thm "M_axioms.wellordered_is_linear")); ``` paulson@13363 ` 535` ```bind_thm ("wellordered_is_wellfounded_on", axioms_L (thm "M_axioms.wellordered_is_wellfounded_on")); ``` paulson@13363 ` 536` ```bind_thm ("wellfounded_imp_wellfounded_on", axioms_L (thm "M_axioms.wellfounded_imp_wellfounded_on")); ``` paulson@13363 ` 537` ```bind_thm ("wellfounded_on_subset_A", axioms_L (thm "M_axioms.wellfounded_on_subset_A")); ``` paulson@13363 ` 538` ```bind_thm ("wellfounded_on_iff_wellfounded", axioms_L (thm "M_axioms.wellfounded_on_iff_wellfounded")); ``` paulson@13363 ` 539` ```bind_thm ("wellfounded_on_imp_wellfounded", axioms_L (thm "M_axioms.wellfounded_on_imp_wellfounded")); ``` paulson@13363 ` 540` ```bind_thm ("wellfounded_on_field_imp_wellfounded", axioms_L (thm "M_axioms.wellfounded_on_field_imp_wellfounded")); ``` paulson@13363 ` 541` ```bind_thm ("wellfounded_iff_wellfounded_on_field", axioms_L (thm "M_axioms.wellfounded_iff_wellfounded_on_field")); ``` paulson@13363 ` 542` ```bind_thm ("wellfounded_induct", axioms_L (thm "M_axioms.wellfounded_induct")); ``` paulson@13363 ` 543` ```bind_thm ("wellfounded_on_induct", axioms_L (thm "M_axioms.wellfounded_on_induct")); ``` paulson@13363 ` 544` ```bind_thm ("wellfounded_on_induct2", axioms_L (thm "M_axioms.wellfounded_on_induct2")); ``` paulson@13363 ` 545` ```bind_thm ("linear_imp_relativized", axioms_L (thm "M_axioms.linear_imp_relativized")); ``` paulson@13363 ` 546` ```bind_thm ("trans_on_imp_relativized", axioms_L (thm "M_axioms.trans_on_imp_relativized")); ``` paulson@13363 ` 547` ```bind_thm ("wf_on_imp_relativized", axioms_L (thm "M_axioms.wf_on_imp_relativized")); ``` paulson@13363 ` 548` ```bind_thm ("wf_imp_relativized", axioms_L (thm "M_axioms.wf_imp_relativized")); ``` paulson@13363 ` 549` ```bind_thm ("well_ord_imp_relativized", axioms_L (thm "M_axioms.well_ord_imp_relativized")); ``` paulson@13363 ` 550` ```bind_thm ("order_isomorphism_abs", axioms_L (thm "M_axioms.order_isomorphism_abs")); ``` paulson@13363 ` 551` ```bind_thm ("pred_set_abs", axioms_L (thm "M_axioms.pred_set_abs")); ``` paulson@13323 ` 552` ```*} ``` paulson@13323 ` 553` paulson@13323 ` 554` ```ML ``` paulson@13323 ` 555` ```{* ``` paulson@13363 ` 556` ```bind_thm ("pred_closed", axioms_L (thm "M_axioms.pred_closed")); ``` paulson@13363 ` 557` ```bind_thm ("membership_abs", axioms_L (thm "M_axioms.membership_abs")); ``` paulson@13363 ` 558` ```bind_thm ("M_Memrel_iff", axioms_L (thm "M_axioms.M_Memrel_iff")); ``` paulson@13363 ` 559` ```bind_thm ("Memrel_closed", axioms_L (thm "M_axioms.Memrel_closed")); ``` paulson@13363 ` 560` ```bind_thm ("wellordered_iso_predD", axioms_L (thm "M_axioms.wellordered_iso_predD")); ``` paulson@13363 ` 561` ```bind_thm ("wellordered_iso_pred_eq", axioms_L (thm "M_axioms.wellordered_iso_pred_eq")); ``` paulson@13363 ` 562` ```bind_thm ("wellfounded_on_asym", axioms_L (thm "M_axioms.wellfounded_on_asym")); ``` paulson@13363 ` 563` ```bind_thm ("wellordered_asym", axioms_L (thm "M_axioms.wellordered_asym")); ``` paulson@13363 ` 564` ```bind_thm ("ord_iso_pred_imp_lt", axioms_L (thm "M_axioms.ord_iso_pred_imp_lt")); ``` paulson@13363 ` 565` ```bind_thm ("obase_iff", axioms_L (thm "M_axioms.obase_iff")); ``` paulson@13363 ` 566` ```bind_thm ("omap_iff", axioms_L (thm "M_axioms.omap_iff")); ``` paulson@13363 ` 567` ```bind_thm ("omap_unique", axioms_L (thm "M_axioms.omap_unique")); ``` paulson@13363 ` 568` ```bind_thm ("omap_yields_Ord", axioms_L (thm "M_axioms.omap_yields_Ord")); ``` paulson@13363 ` 569` ```bind_thm ("otype_iff", axioms_L (thm "M_axioms.otype_iff")); ``` paulson@13363 ` 570` ```bind_thm ("otype_eq_range", axioms_L (thm "M_axioms.otype_eq_range")); ``` paulson@13363 ` 571` ```bind_thm ("Ord_otype", axioms_L (thm "M_axioms.Ord_otype")); ``` paulson@13363 ` 572` ```bind_thm ("domain_omap", axioms_L (thm "M_axioms.domain_omap")); ``` paulson@13363 ` 573` ```bind_thm ("omap_subset", axioms_L (thm "M_axioms.omap_subset")); ``` paulson@13363 ` 574` ```bind_thm ("omap_funtype", axioms_L (thm "M_axioms.omap_funtype")); ``` paulson@13363 ` 575` ```bind_thm ("wellordered_omap_bij", axioms_L (thm "M_axioms.wellordered_omap_bij")); ``` paulson@13363 ` 576` ```bind_thm ("omap_ord_iso", axioms_L (thm "M_axioms.omap_ord_iso")); ``` paulson@13363 ` 577` ```bind_thm ("Ord_omap_image_pred", axioms_L (thm "M_axioms.Ord_omap_image_pred")); ``` paulson@13363 ` 578` ```bind_thm ("restrict_omap_ord_iso", axioms_L (thm "M_axioms.restrict_omap_ord_iso")); ``` paulson@13363 ` 579` ```bind_thm ("obase_equals", axioms_L (thm "M_axioms.obase_equals")); ``` paulson@13363 ` 580` ```bind_thm ("omap_ord_iso_otype", axioms_L (thm "M_axioms.omap_ord_iso_otype")); ``` paulson@13363 ` 581` ```bind_thm ("obase_exists", axioms_L (thm "M_axioms.obase_exists")); ``` paulson@13363 ` 582` ```bind_thm ("omap_exists", axioms_L (thm "M_axioms.omap_exists")); ``` paulson@13363 ` 583` ```bind_thm ("otype_exists", axioms_L (thm "M_axioms.otype_exists")); ``` paulson@13363 ` 584` ```bind_thm ("omap_ord_iso_otype", axioms_L (thm "M_axioms.omap_ord_iso_otype")); ``` paulson@13363 ` 585` ```bind_thm ("ordertype_exists", axioms_L (thm "M_axioms.ordertype_exists")); ``` paulson@13363 ` 586` ```bind_thm ("relativized_imp_well_ord", axioms_L (thm "M_axioms.relativized_imp_well_ord")); ``` paulson@13363 ` 587` ```bind_thm ("well_ord_abs", axioms_L (thm "M_axioms.well_ord_abs")); ``` paulson@13323 ` 588` ```*} ``` paulson@13323 ` 589` paulson@13323 ` 590` ```declare cartprod_closed [intro,simp] ``` paulson@13323 ` 591` ```declare sum_closed [intro,simp] ``` paulson@13323 ` 592` ```declare converse_closed [intro,simp] ``` paulson@13323 ` 593` ```declare converse_abs [simp] ``` paulson@13323 ` 594` ```declare image_closed [intro,simp] ``` paulson@13323 ` 595` ```declare vimage_abs [simp] ``` paulson@13323 ` 596` ```declare vimage_closed [intro,simp] ``` paulson@13323 ` 597` ```declare domain_abs [simp] ``` paulson@13323 ` 598` ```declare domain_closed [intro,simp] ``` paulson@13323 ` 599` ```declare range_abs [simp] ``` paulson@13323 ` 600` ```declare range_closed [intro,simp] ``` paulson@13323 ` 601` ```declare field_abs [simp] ``` paulson@13323 ` 602` ```declare field_closed [intro,simp] ``` paulson@13323 ` 603` ```declare relation_abs [simp] ``` paulson@13323 ` 604` ```declare function_abs [simp] ``` paulson@13323 ` 605` ```declare apply_closed [intro,simp] ``` paulson@13323 ` 606` ```declare typed_function_abs [simp] ``` paulson@13323 ` 607` ```declare injection_abs [simp] ``` paulson@13323 ` 608` ```declare surjection_abs [simp] ``` paulson@13323 ` 609` ```declare bijection_abs [simp] ``` paulson@13323 ` 610` ```declare comp_closed [intro,simp] ``` paulson@13323 ` 611` ```declare composition_abs [simp] ``` paulson@13323 ` 612` ```declare restriction_abs [simp] ``` paulson@13323 ` 613` ```declare restrict_closed [intro,simp] ``` paulson@13323 ` 614` ```declare Inter_abs [simp] ``` paulson@13323 ` 615` ```declare Inter_closed [intro,simp] ``` paulson@13323 ` 616` ```declare Int_closed [intro,simp] ``` paulson@13323 ` 617` ```declare finite_fun_closed [rule_format] ``` paulson@13323 ` 618` ```declare is_funspace_abs [simp] ``` paulson@13323 ` 619` ```declare finite_funspace_closed [intro,simp] ``` paulson@13323 ` 620` paulson@13306 ` 621` ```end ```