imports Hilbert_Choice BNF_Wellorder_Relation

(* Title: HOL/BNF_Wellorder_Embedding.thy Author: Andrei Popescu, TU Muenchen Copyright 2012 Well-order embeddings as needed by bounded natural functors. *) section ‹Well-Order Embeddings as Needed by Bounded Natural Functors› theory BNF_Wellorder_Embedding imports Hilbert_Choice BNF_Wellorder_Relation begin text‹In this section, we introduce well-order {\em embeddings} and {\em isomorphisms} and prove their basic properties. The notion of embedding is considered from the point of view of the theory of ordinals, and therefore requires the source to be injected as an {\em initial segment} (i.e., {\em order filter}) of the target. A main result of this section is the existence of embeddings (in one direction or another) between any two well-orders, having as a consequence the fact that, given any two sets on any two types, one is smaller than (i.e., can be injected into) the other.› subsection ‹Auxiliaries› lemma UNION_inj_on_ofilter: assumes WELL: "Well_order r" and OF: "⋀ i. i ∈ I ⟹ wo_rel.ofilter r (A i)" and INJ: "⋀ i. i ∈ I ⟹ inj_on f (A i)" shows "inj_on f (⋃i ∈ I. A i)" proof- have "wo_rel r" using WELL by (simp add: wo_rel_def) hence "⋀ i j. ⟦i ∈ I; j ∈ I⟧ ⟹ A i <= A j ∨ A j <= A i" using wo_rel.ofilter_linord[of r] OF by blast with WELL INJ show ?thesis by (auto simp add: inj_on_UNION_chain) qed lemma under_underS_bij_betw: assumes WELL: "Well_order r" and WELL': "Well_order r'" and IN: "a ∈ Field r" and IN': "f a ∈ Field r'" and BIJ: "bij_betw f (underS r a) (underS r' (f a))" shows "bij_betw f (under r a) (under r' (f a))" proof- have "a ∉ underS r a ∧ f a ∉ underS r' (f a)" unfolding underS_def by auto moreover {have "Refl r ∧ Refl r'" using WELL WELL' by (auto simp add: order_on_defs) hence "under r a = underS r a ∪ {a} ∧ under r' (f a) = underS r' (f a) ∪ {f a}" using IN IN' by(auto simp add: Refl_under_underS) } ultimately show ?thesis using BIJ notIn_Un_bij_betw[of a "underS r a" f "underS r' (f a)"] by auto qed subsection ‹(Well-order) embeddings, strict embeddings, isomorphisms and order-compatible functions› text‹Standardly, a function is an embedding of a well-order in another if it injectively and order-compatibly maps the former into an order filter of the latter. Here we opt for a more succinct definition (operator ‹embed›), asking that, for any element in the source, the function should be a bijection between the set of strict lower bounds of that element and the set of strict lower bounds of its image. (Later we prove equivalence with the standard definition -- lemma ‹embed_iff_compat_inj_on_ofilter›.) A {\em strict embedding} (operator ‹embedS›) is a non-bijective embedding and an isomorphism (operator ‹iso›) is a bijective embedding.› definition embed :: "'a rel ⇒ 'a' rel ⇒ ('a ⇒ 'a') ⇒ bool" where "embed r r' f ≡ ∀a ∈ Field r. bij_betw f (under r a) (under r' (f a))" lemmas embed_defs = embed_def embed_def[abs_def] text ‹Strict embeddings:› definition embedS :: "'a rel ⇒ 'a' rel ⇒ ('a ⇒ 'a') ⇒ bool" where "embedS r r' f ≡ embed r r' f ∧ ¬ bij_betw f (Field r) (Field r')" lemmas embedS_defs = embedS_def embedS_def[abs_def] definition iso :: "'a rel ⇒ 'a' rel ⇒ ('a ⇒ 'a') ⇒ bool" where "iso r r' f ≡ embed r r' f ∧ bij_betw f (Field r) (Field r')" lemmas iso_defs = iso_def iso_def[abs_def] definition compat :: "'a rel ⇒ 'a' rel ⇒ ('a ⇒ 'a') ⇒ bool" where "compat r r' f ≡ ∀a b. (a,b) ∈ r ⟶ (f a, f b) ∈ r'" lemma compat_wf: assumes CMP: "compat r r' f" and WF: "wf r'" shows "wf r" proof- have "r ≤ inv_image r' f" unfolding inv_image_def using CMP by (auto simp add: compat_def) with WF show ?thesis using wf_inv_image[of r' f] wf_subset[of "inv_image r' f"] by auto qed lemma id_embed: "embed r r id" by(auto simp add: id_def embed_def bij_betw_def) lemma id_iso: "iso r r id" by(auto simp add: id_def embed_def iso_def bij_betw_def) lemma embed_in_Field: assumes WELL: "Well_order r" and EMB: "embed r r' f" and IN: "a ∈ Field r" shows "f a ∈ Field r'" proof- have Well: "wo_rel r" using WELL by (auto simp add: wo_rel_def) hence 1: "Refl r" by (auto simp add: wo_rel.REFL) hence "a ∈ under r a" using IN Refl_under_in by fastforce hence "f a ∈ under r' (f a)" using EMB IN by (auto simp add: embed_def bij_betw_def) thus ?thesis unfolding Field_def by (auto simp: under_def) qed lemma comp_embed: assumes WELL: "Well_order r" and EMB: "embed r r' f" and EMB': "embed r' r'' f'" shows "embed r r'' (f' ∘ f)" proof(unfold embed_def, auto) fix a assume *: "a ∈ Field r" hence "bij_betw f (under r a) (under r' (f a))" using embed_def[of r] EMB by auto moreover {have "f a ∈ Field r'" using EMB WELL * by (auto simp add: embed_in_Field) hence "bij_betw f' (under r' (f a)) (under r'' (f' (f a)))" using embed_def[of r'] EMB' by auto } ultimately show "bij_betw (f' ∘ f) (under r a) (under r'' (f'(f a)))" by(auto simp add: bij_betw_trans) qed lemma comp_iso: assumes WELL: "Well_order r" and EMB: "iso r r' f" and EMB': "iso r' r'' f'" shows "iso r r'' (f' ∘ f)" using assms unfolding iso_def by (auto simp add: comp_embed bij_betw_trans) text‹That ‹embedS› is also preserved by function composition shall be proved only later.› lemma embed_Field: "⟦Well_order r; embed r r' f⟧ ⟹ f`(Field r) ≤ Field r'" by (auto simp add: embed_in_Field) lemma embed_preserves_ofilter: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and OF: "wo_rel.ofilter r A" shows "wo_rel.ofilter r' (f`A)" proof- (* Preliminary facts *) from WELL have Well: "wo_rel r" unfolding wo_rel_def . from WELL' have Well': "wo_rel r'" unfolding wo_rel_def . from OF have 0: "A ≤ Field r" by(auto simp add: Well wo_rel.ofilter_def) (* Main proof *) show ?thesis using Well' WELL EMB 0 embed_Field[of r r' f] proof(unfold wo_rel.ofilter_def, auto simp add: image_def) fix a b' assume *: "a ∈ A" and **: "b' ∈ under r' (f a)" hence "a ∈ Field r" using 0 by auto hence "bij_betw f (under r a) (under r' (f a))" using * EMB by (auto simp add: embed_def) hence "f`(under r a) = under r' (f a)" by (simp add: bij_betw_def) with ** image_def[of f "under r a"] obtain b where 1: "b ∈ under r a ∧ b' = f b" by blast hence "b ∈ A" using Well * OF by (auto simp add: wo_rel.ofilter_def) with 1 show "∃b ∈ A. b' = f b" by blast qed qed lemma embed_Field_ofilter: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" shows "wo_rel.ofilter r' (f`(Field r))" proof- have "wo_rel.ofilter r (Field r)" using WELL by (auto simp add: wo_rel_def wo_rel.Field_ofilter) with WELL WELL' EMB show ?thesis by (auto simp add: embed_preserves_ofilter) qed lemma embed_compat: assumes EMB: "embed r r' f" shows "compat r r' f" proof(unfold compat_def, clarify) fix a b assume *: "(a,b) ∈ r" hence 1: "b ∈ Field r" using Field_def[of r] by blast have "a ∈ under r b" using * under_def[of r] by simp hence "f a ∈ under r' (f b)" using EMB embed_def[of r r' f] bij_betw_def[of f "under r b" "under r' (f b)"] image_def[of f "under r b"] 1 by auto thus "(f a, f b) ∈ r'" by (auto simp add: under_def) qed lemma embed_inj_on: assumes WELL: "Well_order r" and EMB: "embed r r' f" shows "inj_on f (Field r)" proof(unfold inj_on_def, clarify) (* Preliminary facts *) from WELL have Well: "wo_rel r" unfolding wo_rel_def . with wo_rel.TOTAL[of r] have Total: "Total r" by simp from Well wo_rel.REFL[of r] have Refl: "Refl r" by simp (* Main proof *) fix a b assume *: "a ∈ Field r" and **: "b ∈ Field r" and ***: "f a = f b" hence 1: "a ∈ Field r ∧ b ∈ Field r" unfolding Field_def by auto {assume "(a,b) ∈ r" hence "a ∈ under r b ∧ b ∈ under r b" using Refl by(auto simp add: under_def refl_on_def) hence "a = b" using EMB 1 *** by (auto simp add: embed_def bij_betw_def inj_on_def) } moreover {assume "(b,a) ∈ r" hence "a ∈ under r a ∧ b ∈ under r a" using Refl by(auto simp add: under_def refl_on_def) hence "a = b" using EMB 1 *** by (auto simp add: embed_def bij_betw_def inj_on_def) } ultimately show "a = b" using Total 1 by (auto simp add: total_on_def) qed lemma embed_underS: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and IN: "a ∈ Field r" shows "bij_betw f (underS r a) (underS r' (f a))" proof- have "bij_betw f (under r a) (under r' (f a))" using assms by (auto simp add: embed_def) moreover {have "f a ∈ Field r'" using assms embed_Field[of r r' f] by auto hence "under r a = underS r a ∪ {a} ∧ under r' (f a) = underS r' (f a) ∪ {f a}" using assms by (auto simp add: order_on_defs Refl_under_underS) } moreover {have "a ∉ underS r a ∧ f a ∉ underS r' (f a)" unfolding underS_def by blast } ultimately show ?thesis by (auto simp add: notIn_Un_bij_betw3) qed lemma embed_iff_compat_inj_on_ofilter: assumes WELL: "Well_order r" and WELL': "Well_order r'" shows "embed r r' f = (compat r r' f ∧ inj_on f (Field r) ∧ wo_rel.ofilter r' (f`(Field r)))" using assms proof(auto simp add: embed_compat embed_inj_on embed_Field_ofilter, unfold embed_def, auto) (* get rid of one implication *) fix a assume *: "inj_on f (Field r)" and **: "compat r r' f" and ***: "wo_rel.ofilter r' (f`(Field r))" and ****: "a ∈ Field r" (* Preliminary facts *) have Well: "wo_rel r" using WELL wo_rel_def[of r] by simp hence Refl: "Refl r" using wo_rel.REFL[of r] by simp have Total: "Total r" using Well wo_rel.TOTAL[of r] by simp have Well': "wo_rel r'" using WELL' wo_rel_def[of r'] by simp hence Antisym': "antisym r'" using wo_rel.ANTISYM[of r'] by simp have "(a,a) ∈ r" using **** Well wo_rel.REFL[of r] refl_on_def[of _ r] by auto hence "(f a, f a) ∈ r'" using ** by(auto simp add: compat_def) hence 0: "f a ∈ Field r'" unfolding Field_def by auto have "f a ∈ f`(Field r)" using **** by auto hence 2: "under r' (f a) ≤ f`(Field r)" using Well' *** wo_rel.ofilter_def[of r' "f`(Field r)"] by fastforce (* Main proof *) show "bij_betw f (under r a) (under r' (f a))" proof(unfold bij_betw_def, auto) show "inj_on f (under r a)" by (rule subset_inj_on[OF * under_Field]) next fix b assume "b ∈ under r a" thus "f b ∈ under r' (f a)" unfolding under_def using ** by (auto simp add: compat_def) next fix b' assume *****: "b' ∈ under r' (f a)" hence "b' ∈ f`(Field r)" using 2 by auto with Field_def[of r] obtain b where 3: "b ∈ Field r" and 4: "b' = f b" by auto have "(b,a) ∈ r" proof- {assume "(a,b) ∈ r" with ** 4 have "(f a, b') ∈ r'" by (auto simp add: compat_def) with ***** Antisym' have "f a = b'" by(auto simp add: under_def antisym_def) with 3 **** 4 * have "a = b" by(auto simp add: inj_on_def) } moreover {assume "a = b" hence "(b,a) ∈ r" using Refl **** 3 by (auto simp add: refl_on_def) } ultimately show ?thesis using Total **** 3 by (fastforce simp add: total_on_def) qed with 4 show "b' ∈ f`(under r a)" unfolding under_def by auto qed qed lemma inv_into_ofilter_embed: assumes WELL: "Well_order r" and OF: "wo_rel.ofilter r A" and BIJ: "∀b ∈ A. bij_betw f (under r b) (under r' (f b))" and IMAGE: "f ` A = Field r'" shows "embed r' r (inv_into A f)" proof- (* Preliminary facts *) have Well: "wo_rel r" using WELL wo_rel_def[of r] by simp have Refl: "Refl r" using Well wo_rel.REFL[of r] by simp have Total: "Total r" using Well wo_rel.TOTAL[of r] by simp (* Main proof *) have 1: "bij_betw f A (Field r')" proof(unfold bij_betw_def inj_on_def, auto simp add: IMAGE) fix b1 b2 assume *: "b1 ∈ A" and **: "b2 ∈ A" and ***: "f b1 = f b2" have 11: "b1 ∈ Field r ∧ b2 ∈ Field r" using * ** Well OF by (auto simp add: wo_rel.ofilter_def) moreover {assume "(b1,b2) ∈ r" hence "b1 ∈ under r b2 ∧ b2 ∈ under r b2" unfolding under_def using 11 Refl by (auto simp add: refl_on_def) hence "b1 = b2" using BIJ * ** *** by (simp add: bij_betw_def inj_on_def) } moreover {assume "(b2,b1) ∈ r" hence "b1 ∈ under r b1 ∧ b2 ∈ under r b1" unfolding under_def using 11 Refl by (auto simp add: refl_on_def) hence "b1 = b2" using BIJ * ** *** by (simp add: bij_betw_def inj_on_def) } ultimately show "b1 = b2" using Total by (auto simp add: total_on_def) qed (* *) let ?f' = "(inv_into A f)" (* *) have 2: "∀b ∈ A. bij_betw ?f' (under r' (f b)) (under r b)" proof(clarify) fix b assume *: "b ∈ A" hence "under r b ≤ A" using Well OF by(auto simp add: wo_rel.ofilter_def) moreover have "f ` (under r b) = under r' (f b)" using * BIJ by (auto simp add: bij_betw_def) ultimately show "bij_betw ?f' (under r' (f b)) (under r b)" using 1 by (auto simp add: bij_betw_inv_into_subset) qed (* *) have 3: "∀b' ∈ Field r'. bij_betw ?f' (under r' b') (under r (?f' b'))" proof(clarify) fix b' assume *: "b' ∈ Field r'" have "b' = f (?f' b')" using * 1 by (auto simp add: bij_betw_inv_into_right) moreover {obtain b where 31: "b ∈ A" and "f b = b'" using IMAGE * by force hence "?f' b' = b" using 1 by (auto simp add: bij_betw_inv_into_left) with 31 have "?f' b' ∈ A" by auto } ultimately show "bij_betw ?f' (under r' b') (under r (?f' b'))" using 2 by auto qed (* *) thus ?thesis unfolding embed_def . qed lemma inv_into_underS_embed: assumes WELL: "Well_order r" and BIJ: "∀b ∈ underS r a. bij_betw f (under r b) (under r' (f b))" and IN: "a ∈ Field r" and IMAGE: "f ` (underS r a) = Field r'" shows "embed r' r (inv_into (underS r a) f)" using assms by(auto simp add: wo_rel_def wo_rel.underS_ofilter inv_into_ofilter_embed) lemma inv_into_Field_embed: assumes WELL: "Well_order r" and EMB: "embed r r' f" and IMAGE: "Field r' ≤ f ` (Field r)" shows "embed r' r (inv_into (Field r) f)" proof- have "(∀b ∈ Field r. bij_betw f (under r b) (under r' (f b)))" using EMB by (auto simp add: embed_def) moreover have "f ` (Field r) ≤ Field r'" using EMB WELL by (auto simp add: embed_Field) ultimately show ?thesis using assms by(auto simp add: wo_rel_def wo_rel.Field_ofilter inv_into_ofilter_embed) qed lemma inv_into_Field_embed_bij_betw: assumes WELL: "Well_order r" and EMB: "embed r r' f" and BIJ: "bij_betw f (Field r) (Field r')" shows "embed r' r (inv_into (Field r) f)" proof- have "Field r' ≤ f ` (Field r)" using BIJ by (auto simp add: bij_betw_def) thus ?thesis using assms by(auto simp add: inv_into_Field_embed) qed subsection ‹Given any two well-orders, one can be embedded in the other› text‹Here is an overview of the proof of of this fact, stated in theorem ‹wellorders_totally_ordered›: Fix the well-orders ‹r::'a rel› and ‹r'::'a' rel›. Attempt to define an embedding ‹f::'a ⇒ 'a'› from ‹r› to ‹r'› in the natural way by well-order recursion ("hoping" that ‹Field r› turns out to be smaller than ‹Field r'›), but also record, at the recursive step, in a function ‹g::'a ⇒ bool›, the extra information of whether ‹Field r'› gets exhausted or not. If ‹Field r'› does not get exhausted, then ‹Field r› is indeed smaller and ‹f› is the desired embedding from ‹r› to ‹r'› (lemma ‹wellorders_totally_ordered_aux›). Otherwise, it means that ‹Field r'› is the smaller one, and the inverse of (the "good" segment of) ‹f› is the desired embedding from ‹r'› to ‹r› (lemma ‹wellorders_totally_ordered_aux2›). › lemma wellorders_totally_ordered_aux: fixes r ::"'a rel" and r'::"'a' rel" and f :: "'a ⇒ 'a'" and a::'a assumes WELL: "Well_order r" and WELL': "Well_order r'" and IN: "a ∈ Field r" and IH: "∀b ∈ underS r a. bij_betw f (under r b) (under r' (f b))" and NOT: "f ` (underS r a) ≠ Field r'" and SUC: "f a = wo_rel.suc r' (f`(underS r a))" shows "bij_betw f (under r a) (under r' (f a))" proof- (* Preliminary facts *) have Well: "wo_rel r" using WELL unfolding wo_rel_def . hence Refl: "Refl r" using wo_rel.REFL[of r] by auto have Trans: "trans r" using Well wo_rel.TRANS[of r] by auto have Well': "wo_rel r'" using WELL' unfolding wo_rel_def . have OF: "wo_rel.ofilter r (underS r a)" by (auto simp add: Well wo_rel.underS_ofilter) hence UN: "underS r a = (⋃b ∈ underS r a. under r b)" using Well wo_rel.ofilter_under_UNION[of r "underS r a"] by blast (* Gather facts about elements of underS r a *) {fix b assume *: "b ∈ underS r a" hence t0: "(b,a) ∈ r ∧ b ≠ a" unfolding underS_def by auto have t1: "b ∈ Field r" using * underS_Field[of r a] by auto have t2: "f`(under r b) = under r' (f b)" using IH * by (auto simp add: bij_betw_def) hence t3: "wo_rel.ofilter r' (f`(under r b))" using Well' by (auto simp add: wo_rel.under_ofilter) have "f`(under r b) ≤ Field r'" using t2 by (auto simp add: under_Field) moreover have "b ∈ under r b" using t1 by(auto simp add: Refl Refl_under_in) ultimately have t4: "f b ∈ Field r'" by auto have "f`(under r b) = under r' (f b) ∧ wo_rel.ofilter r' (f`(under r b)) ∧ f b ∈ Field r'" using t2 t3 t4 by auto } hence bFact: "∀b ∈ underS r a. f`(under r b) = under r' (f b) ∧ wo_rel.ofilter r' (f`(under r b)) ∧ f b ∈ Field r'" by blast (* *) have subField: "f`(underS r a) ≤ Field r'" using bFact by blast (* *) have OF': "wo_rel.ofilter r' (f`(underS r a))" proof- have "f`(underS r a) = f`(⋃b ∈ underS r a. under r b)" using UN by auto also have "… = (⋃b ∈ underS r a. f`(under r b))" by blast also have "… = (⋃b ∈ underS r a. (under r' (f b)))" using bFact by auto finally have "f`(underS r a) = (⋃b ∈ underS r a. (under r' (f b)))" . thus ?thesis using Well' bFact wo_rel.ofilter_UNION[of r' "underS r a" "λ b. under r' (f b)"] by fastforce qed (* *) have "f`(underS r a) ∪ AboveS r' (f`(underS r a)) = Field r'" using Well' OF' by (auto simp add: wo_rel.ofilter_AboveS_Field) hence NE: "AboveS r' (f`(underS r a)) ≠ {}" using subField NOT by blast (* Main proof *) have INCL1: "f`(underS r a) ≤ underS r' (f a) " proof(auto) fix b assume *: "b ∈ underS r a" have "f b ≠ f a ∧ (f b, f a) ∈ r'" using subField Well' SUC NE * wo_rel.suc_greater[of r' "f`(underS r a)" "f b"] by force thus "f b ∈ underS r' (f a)" unfolding underS_def by simp qed (* *) have INCL2: "underS r' (f a) ≤ f`(underS r a)" proof fix b' assume "b' ∈ underS r' (f a)" hence "b' ≠ f a ∧ (b', f a) ∈ r'" unfolding underS_def by simp thus "b' ∈ f`(underS r a)" using Well' SUC NE OF' wo_rel.suc_ofilter_in[of r' "f ` underS r a" b'] by auto qed (* *) have INJ: "inj_on f (underS r a)" proof- have "∀b ∈ underS r a. inj_on f (under r b)" using IH by (auto simp add: bij_betw_def) moreover have "∀b. wo_rel.ofilter r (under r b)" using Well by (auto simp add: wo_rel.under_ofilter) ultimately show ?thesis using WELL bFact UN UNION_inj_on_ofilter[of r "underS r a" "λb. under r b" f] by auto qed (* *) have BIJ: "bij_betw f (underS r a) (underS r' (f a))" unfolding bij_betw_def using INJ INCL1 INCL2 by auto (* *) have "f a ∈ Field r'" using Well' subField NE SUC by (auto simp add: wo_rel.suc_inField) thus ?thesis using WELL WELL' IN BIJ under_underS_bij_betw[of r r' a f] by auto qed lemma wellorders_totally_ordered_aux2: fixes r ::"'a rel" and r'::"'a' rel" and f :: "'a ⇒ 'a'" and g :: "'a ⇒ bool" and a::'a assumes WELL: "Well_order r" and WELL': "Well_order r'" and MAIN1: "⋀ a. (False ∉ g`(underS r a) ∧ f`(underS r a) ≠ Field r' ⟶ f a = wo_rel.suc r' (f`(underS r a)) ∧ g a = True) ∧ (¬(False ∉ (g`(underS r a)) ∧ f`(underS r a) ≠ Field r') ⟶ g a = False)" and MAIN2: "⋀ a. a ∈ Field r ∧ False ∉ g`(under r a) ⟶ bij_betw f (under r a) (under r' (f a))" and Case: "a ∈ Field r ∧ False ∈ g`(under r a)" shows "∃f'. embed r' r f'" proof- have Well: "wo_rel r" using WELL unfolding wo_rel_def . hence Refl: "Refl r" using wo_rel.REFL[of r] by auto have Trans: "trans r" using Well wo_rel.TRANS[of r] by auto have Antisym: "antisym r" using Well wo_rel.ANTISYM[of r] by auto have Well': "wo_rel r'" using WELL' unfolding wo_rel_def . (* *) have 0: "under r a = underS r a ∪ {a}" using Refl Case by(auto simp add: Refl_under_underS) (* *) have 1: "g a = False" proof- {assume "g a ≠ False" with 0 Case have "False ∈ g`(underS r a)" by blast with MAIN1 have "g a = False" by blast} thus ?thesis by blast qed let ?A = "{a ∈ Field r. g a = False}" let ?a = "(wo_rel.minim r ?A)" (* *) have 2: "?A ≠ {} ∧ ?A ≤ Field r" using Case 1 by blast (* *) have 3: "False ∉ g`(underS r ?a)" proof assume "False ∈ g`(underS r ?a)" then obtain b where "b ∈ underS r ?a" and 31: "g b = False" by auto hence 32: "(b,?a) ∈ r ∧ b ≠ ?a" by (auto simp add: underS_def) hence "b ∈ Field r" unfolding Field_def by auto with 31 have "b ∈ ?A" by auto hence "(?a,b) ∈ r" using wo_rel.minim_least 2 Well by fastforce (* again: why worked without type annotations? *) with 32 Antisym show False by (auto simp add: antisym_def) qed have temp: "?a ∈ ?A" using Well 2 wo_rel.minim_in[of r ?A] by auto hence 4: "?a ∈ Field r" by auto (* *) have 5: "g ?a = False" using temp by blast (* *) have 6: "f`(underS r ?a) = Field r'" using MAIN1[of ?a] 3 5 by blast (* *) have 7: "∀b ∈ underS r ?a. bij_betw f (under r b) (under r' (f b))" proof fix b assume as: "b ∈ underS r ?a" moreover have "wo_rel.ofilter r (underS r ?a)" using Well by (auto simp add: wo_rel.underS_ofilter) ultimately have "False ∉ g`(under r b)" using 3 Well by (subst (asm) wo_rel.ofilter_def) fast+ moreover have "b ∈ Field r" unfolding Field_def using as by (auto simp add: underS_def) ultimately show "bij_betw f (under r b) (under r' (f b))" using MAIN2 by auto qed (* *) have "embed r' r (inv_into (underS r ?a) f)" using WELL WELL' 7 4 6 inv_into_underS_embed[of r ?a f r'] by auto thus ?thesis unfolding embed_def by blast qed theorem wellorders_totally_ordered: fixes r ::"'a rel" and r'::"'a' rel" assumes WELL: "Well_order r" and WELL': "Well_order r'" shows "(∃f. embed r r' f) ∨ (∃f'. embed r' r f')" proof- (* Preliminary facts *) have Well: "wo_rel r" using WELL unfolding wo_rel_def . hence Refl: "Refl r" using wo_rel.REFL[of r] by auto have Trans: "trans r" using Well wo_rel.TRANS[of r] by auto have Well': "wo_rel r'" using WELL' unfolding wo_rel_def . (* Main proof *) obtain H where H_def: "H = (λh a. if False ∉ (snd ∘ h)`(underS r a) ∧ (fst ∘ h)`(underS r a) ≠ Field r' then (wo_rel.suc r' ((fst ∘ h)`(underS r a)), True) else (undefined, False))" by blast have Adm: "wo_rel.adm_wo r H" using Well proof(unfold wo_rel.adm_wo_def, clarify) fix h1::"'a ⇒ 'a' * bool" and h2::"'a ⇒ 'a' * bool" and x assume "∀y∈underS r x. h1 y = h2 y" hence "∀y∈underS r x. (fst ∘ h1) y = (fst ∘ h2) y ∧ (snd ∘ h1) y = (snd ∘ h2) y" by auto hence "(fst ∘ h1)`(underS r x) = (fst ∘ h2)`(underS r x) ∧ (snd ∘ h1)`(underS r x) = (snd ∘ h2)`(underS r x)" by (auto simp add: image_def) thus "H h1 x = H h2 x" by (simp add: H_def del: not_False_in_image_Ball) qed (* More constant definitions: *) obtain h::"'a ⇒ 'a' * bool" and f::"'a ⇒ 'a'" and g::"'a ⇒ bool" where h_def: "h = wo_rel.worec r H" and f_def: "f = fst ∘ h" and g_def: "g = snd ∘ h" by blast obtain test where test_def: "test = (λ a. False ∉ (g`(underS r a)) ∧ f`(underS r a) ≠ Field r')" by blast (* *) have *: "⋀ a. h a = H h a" using Adm Well wo_rel.worec_fixpoint[of r H] by (simp add: h_def) have Main1: "⋀ a. (test a ⟶ f a = wo_rel.suc r' (f`(underS r a)) ∧ g a = True) ∧ (¬(test a) ⟶ g a = False)" proof- (* How can I prove this withou fixing a? *) fix a show "(test a ⟶ f a = wo_rel.suc r' (f`(underS r a)) ∧ g a = True) ∧ (¬(test a) ⟶ g a = False)" using *[of a] test_def f_def g_def H_def by auto qed (* *) let ?phi = "λ a. a ∈ Field r ∧ False ∉ g`(under r a) ⟶ bij_betw f (under r a) (under r' (f a))" have Main2: "⋀ a. ?phi a" proof- fix a show "?phi a" proof(rule wo_rel.well_order_induct[of r ?phi], simp only: Well, clarify) fix a assume IH: "∀b. b ≠ a ∧ (b,a) ∈ r ⟶ ?phi b" and *: "a ∈ Field r" and **: "False ∉ g`(under r a)" have 1: "∀b ∈ underS r a. bij_betw f (under r b) (under r' (f b))" proof(clarify) fix b assume ***: "b ∈ underS r a" hence 0: "(b,a) ∈ r ∧ b ≠ a" unfolding underS_def by auto moreover have "b ∈ Field r" using *** underS_Field[of r a] by auto moreover have "False ∉ g`(under r b)" using 0 ** Trans under_incr[of r b a] by auto ultimately show "bij_betw f (under r b) (under r' (f b))" using IH by auto qed (* *) have 21: "False ∉ g`(underS r a)" using ** underS_subset_under[of r a] by auto have 22: "g`(under r a) ≤ {True}" using ** by auto moreover have 23: "a ∈ under r a" using Refl * by (auto simp add: Refl_under_in) ultimately have 24: "g a = True" by blast have 2: "f`(underS r a) ≠ Field r'" proof assume "f`(underS r a) = Field r'" hence "g a = False" using Main1 test_def by blast with 24 show False using ** by blast qed (* *) have 3: "f a = wo_rel.suc r' (f`(underS r a))" using 21 2 Main1 test_def by blast (* *) show "bij_betw f (under r a) (under r' (f a))" using WELL WELL' 1 2 3 * wellorders_totally_ordered_aux[of r r' a f] by auto qed qed (* *) let ?chi = "(λ a. a ∈ Field r ∧ False ∈ g`(under r a))" show ?thesis proof(cases "∃a. ?chi a") assume "¬ (∃a. ?chi a)" hence "∀a ∈ Field r. bij_betw f (under r a) (under r' (f a))" using Main2 by blast thus ?thesis unfolding embed_def by blast next assume "∃a. ?chi a" then obtain a where "?chi a" by blast hence "∃f'. embed r' r f'" using wellorders_totally_ordered_aux2[of r r' g f a] WELL WELL' Main1 Main2 test_def by fast thus ?thesis by blast qed qed subsection ‹Uniqueness of embeddings› text‹Here we show a fact complementary to the one from the previous subsection -- namely, that between any two well-orders there is {\em at most} one embedding, and is the one definable by the expected well-order recursive equation. As a consequence, any two embeddings of opposite directions are mutually inverse.› lemma embed_determined: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and IN: "a ∈ Field r" shows "f a = wo_rel.suc r' (f`(underS r a))" proof- have "bij_betw f (underS r a) (underS r' (f a))" using assms by (auto simp add: embed_underS) hence "f`(underS r a) = underS r' (f a)" by (auto simp add: bij_betw_def) moreover {have "f a ∈ Field r'" using IN using EMB WELL embed_Field[of r r' f] by auto hence "f a = wo_rel.suc r' (underS r' (f a))" using WELL' by (auto simp add: wo_rel_def wo_rel.suc_underS) } ultimately show ?thesis by simp qed lemma embed_unique: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMBf: "embed r r' f" and EMBg: "embed r r' g" shows "a ∈ Field r ⟶ f a = g a" proof(rule wo_rel.well_order_induct[of r], auto simp add: WELL wo_rel_def) fix a assume IH: "∀b. b ≠ a ∧ (b,a) ∈ r ⟶ b ∈ Field r ⟶ f b = g b" and *: "a ∈ Field r" hence "∀b ∈ underS r a. f b = g b" unfolding underS_def by (auto simp add: Field_def) hence "f`(underS r a) = g`(underS r a)" by force thus "f a = g a" using assms * embed_determined[of r r' f a] embed_determined[of r r' g a] by auto qed lemma embed_bothWays_inverse: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and EMB': "embed r' r f'" shows "(∀a ∈ Field r. f'(f a) = a) ∧ (∀a' ∈ Field r'. f(f' a') = a')" proof- have "embed r r (f' ∘ f)" using assms by(auto simp add: comp_embed) moreover have "embed r r id" using assms by (auto simp add: id_embed) ultimately have "∀a ∈ Field r. f'(f a) = a" using assms embed_unique[of r r "f' ∘ f" id] id_def by auto moreover {have "embed r' r' (f ∘ f')" using assms by(auto simp add: comp_embed) moreover have "embed r' r' id" using assms by (auto simp add: id_embed) ultimately have "∀a' ∈ Field r'. f(f' a') = a'" using assms embed_unique[of r' r' "f ∘ f'" id] id_def by auto } ultimately show ?thesis by blast qed lemma embed_bothWays_bij_betw: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and EMB': "embed r' r g" shows "bij_betw f (Field r) (Field r')" proof- let ?A = "Field r" let ?A' = "Field r'" have "embed r r (g ∘ f) ∧ embed r' r' (f ∘ g)" using assms by (auto simp add: comp_embed) hence 1: "(∀a ∈ ?A. g(f a) = a) ∧ (∀a' ∈ ?A'. f(g a') = a')" using WELL id_embed[of r] embed_unique[of r r "g ∘ f" id] WELL' id_embed[of r'] embed_unique[of r' r' "f ∘ g" id] id_def by auto have 2: "(∀a ∈ ?A. f a ∈ ?A') ∧ (∀a' ∈ ?A'. g a' ∈ ?A)" using assms embed_Field[of r r' f] embed_Field[of r' r g] by blast (* *) show ?thesis proof(unfold bij_betw_def inj_on_def, auto simp add: 2) fix a b assume *: "a ∈ ?A" "b ∈ ?A" and **: "f a = f b" have "a = g(f a) ∧ b = g(f b)" using * 1 by auto with ** show "a = b" by auto next fix a' assume *: "a' ∈ ?A'" hence "g a' ∈ ?A ∧ f(g a') = a'" using 1 2 by auto thus "a' ∈ f ` ?A" by force qed qed lemma embed_bothWays_iso: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and EMB': "embed r' r g" shows "iso r r' f" unfolding iso_def using assms by (auto simp add: embed_bothWays_bij_betw) subsection ‹More properties of embeddings, strict embeddings and isomorphisms› lemma embed_bothWays_Field_bij_betw: assumes WELL: "Well_order r" and WELL': "Well_order r'" and EMB: "embed r r' f" and EMB': "embed r' r f'" shows "bij_betw f (Field r) (Field r')" proof- have "(∀a ∈ Field r. f'(f a) = a) ∧ (∀a' ∈ Field r'. f(f' a') = a')" using assms by (auto simp add: embed_bothWays_inverse) moreover have "f`(Field r) ≤ Field r' ∧ f' ` (Field r') ≤ Field r" using assms by (auto simp add: embed_Field) ultimately show ?thesis using bij_betw_byWitness[of "Field r" f' f "Field r'"] by auto qed lemma embedS_comp_embed: assumes WELL: "Well_order r" and WELL': "Well_order r'" and WELL'': "Well_order r''" and EMB: "embedS r r' f" and EMB': "embed r' r'' f'" shows "embedS r r'' (f' ∘ f)" proof- let ?g = "(f' ∘ f)" let ?h = "inv_into (Field r) ?g" have 1: "embed r r' f ∧ ¬ (bij_betw f (Field r) (Field r'))" using EMB by (auto simp add: embedS_def) hence 2: "embed r r'' ?g" using WELL EMB' comp_embed[of r r' f r'' f'] by auto moreover {assume "bij_betw ?g (Field r) (Field r'')" hence "embed r'' r ?h" using 2 WELL by (auto simp add: inv_into_Field_embed_bij_betw) hence "embed r' r (?h ∘ f')" using WELL' EMB' by (auto simp add: comp_embed) hence "bij_betw f (Field r) (Field r')" using WELL WELL' 1 by (auto simp add: embed_bothWays_Field_bij_betw) with 1 have False by blast } ultimately show ?thesis unfolding embedS_def by auto qed lemma embed_comp_embedS: assumes WELL: "Well_order r" and WELL': "Well_order r'" and WELL'': "Well_order r''" and EMB: "embed r r' f" and EMB': "embedS r' r'' f'" shows "embedS r r'' (f' ∘ f)" proof- let ?g = "(f' ∘ f)" let ?h = "inv_into (Field r) ?g" have 1: "embed r' r'' f' ∧ ¬ (bij_betw f' (Field r') (Field r''))" using EMB' by (auto simp add: embedS_def) hence 2: "embed r r'' ?g" using WELL EMB comp_embed[of r r' f r'' f'] by auto moreover {assume "bij_betw ?g (Field r) (Field r'')" hence "embed r'' r ?h" using 2 WELL by (auto simp add: inv_into_Field_embed_bij_betw) hence "embed r'' r' (f ∘ ?h)" using WELL'' EMB by (auto simp add: comp_embed) hence "bij_betw f' (Field r') (Field r'')" using WELL' WELL'' 1 by (auto simp add: embed_bothWays_Field_bij_betw) with 1 have False by blast } ultimately show ?thesis unfolding embedS_def by auto qed lemma embed_comp_iso: assumes WELL: "Well_order r" and WELL': "Well_order r'" and WELL'': "Well_order r''" and EMB: "embed r r' f" and EMB': "iso r' r'' f'" shows "embed r r'' (f' ∘ f)" using assms unfolding iso_def by (auto simp add: comp_embed) lemma iso_comp_embed: assumes WELL: "Well_order r" and WELL': "Well_order r'" and WELL'': "Well_order r''" and EMB: "iso r r' f" and EMB': "embed r' r'' f'" shows "embed r r'' (f' ∘ f)" using assms unfolding iso_def by (auto simp add: comp_embed) lemma embedS_comp_iso: assumes WELL: "Well_order r" and WELL': "Well_order r'" and WELL'': "Well_order r''" and EMB: "embedS r r' f" and EMB': "iso r' r'' f'" shows "embedS r r'' (f' ∘ f)" using assms unfolding iso_def by (auto simp add: embedS_comp_embed) lemma iso_comp_embedS: assumes WELL: "Well_order r" and WELL': "Well_order r'" and WELL'': "Well_order r''" and EMB: "iso r r' f" and EMB': "embedS r' r'' f'" shows "embedS r r'' (f' ∘ f)" using assms unfolding iso_def using embed_comp_embedS by (auto simp add: embed_comp_embedS) lemma embedS_Field: assumes WELL: "Well_order r" and EMB: "embedS r r' f" shows "f ` (Field r) < Field r'" proof- have "f`(Field r) ≤ Field r'" using assms by (auto simp add: embed_Field embedS_def) moreover {have "inj_on f (Field r)" using assms by (auto simp add: embedS_def embed_inj_on) hence "f`(Field r) ≠ Field r'" using EMB by (auto simp add: embedS_def bij_betw_def) } ultimately show ?thesis by blast qed lemma embedS_iff: assumes WELL: "Well_order r" and ISO: "embed r r' f" shows "embedS r r' f = (f ` (Field r) < Field r')" proof assume "embedS r r' f" thus "f ` Field r ⊂ Field r'" using WELL by (auto simp add: embedS_Field) next assume "f ` Field r ⊂ Field r'" hence "¬ bij_betw f (Field r) (Field r')" unfolding bij_betw_def by blast thus "embedS r r' f" unfolding embedS_def using ISO by auto qed lemma iso_Field: "iso r r' f ⟹ f ` (Field r) = Field r'" by (auto simp add: iso_def bij_betw_def) lemma iso_iff: assumes "Well_order r" shows "iso r r' f = (embed r r' f ∧ f ` (Field r) = Field r')" proof assume "iso r r' f" thus "embed r r' f ∧ f ` (Field r) = Field r'" by (auto simp add: iso_Field iso_def) next assume *: "embed r r' f ∧ f ` Field r = Field r'" hence "inj_on f (Field r)" using assms by (auto simp add: embed_inj_on) with * have "bij_betw f (Field r) (Field r')" unfolding bij_betw_def by simp with * show "iso r r' f" unfolding iso_def by auto qed lemma iso_iff2: assumes "Well_order r" shows "iso r r' f = (bij_betw f (Field r) (Field r') ∧ (∀a ∈ Field r. ∀b ∈ Field r. (((a,b) ∈ r) = ((f a, f b) ∈ r'))))" using assms proof(auto simp add: iso_def) fix a b assume "embed r r' f" hence "compat r r' f" using embed_compat[of r] by auto moreover assume "(a,b) ∈ r" ultimately show "(f a, f b) ∈ r'" using compat_def[of r] by auto next let ?f' = "inv_into (Field r) f" assume "embed r r' f" and 1: "bij_betw f (Field r) (Field r')" hence "embed r' r ?f'" using assms by (auto simp add: inv_into_Field_embed_bij_betw) hence 2: "compat r' r ?f'" using embed_compat[of r'] by auto fix a b assume *: "a ∈ Field r" "b ∈ Field r" and **: "(f a,f b) ∈ r'" hence "?f'(f a) = a ∧ ?f'(f b) = b" using 1 by (auto simp add: bij_betw_inv_into_left) thus "(a,b) ∈ r" using ** 2 compat_def[of r' r ?f'] by fastforce next assume *: "bij_betw f (Field r) (Field r')" and **: "∀a∈Field r. ∀b∈Field r. ((a, b) ∈ r) = ((f a, f b) ∈ r')" have 1: "⋀ a. under r a ≤ Field r ∧ under r' (f a) ≤ Field r'" by (auto simp add: under_Field) have 2: "inj_on f (Field r)" using * by (auto simp add: bij_betw_def) {fix a assume ***: "a ∈ Field r" have "bij_betw f (under r a) (under r' (f a))" proof(unfold bij_betw_def, auto) show "inj_on f (under r a)" using 1 2 subset_inj_on by blast next fix b assume "b ∈ under r a" hence "a ∈ Field r ∧ b ∈ Field r ∧ (b,a) ∈ r" unfolding under_def by (auto simp add: Field_def Range_def Domain_def) with 1 ** show "f b ∈ under r' (f a)" unfolding under_def by auto next fix b' assume "b' ∈ under r' (f a)" hence 3: "(b',f a) ∈ r'" unfolding under_def by simp hence "b' ∈ Field r'" unfolding Field_def by auto with * obtain b where "b ∈ Field r ∧ f b = b'" unfolding bij_betw_def by force with 3 ** *** show "b' ∈ f ` (under r a)" unfolding under_def by blast qed } thus "embed r r' f" unfolding embed_def using * by auto qed lemma iso_iff3: assumes WELL: "Well_order r" and WELL': "Well_order r'" shows "iso r r' f = (bij_betw f (Field r) (Field r') ∧ compat r r' f)" proof assume "iso r r' f" thus "bij_betw f (Field r) (Field r') ∧ compat r r' f" unfolding compat_def using WELL by (auto simp add: iso_iff2 Field_def) next have Well: "wo_rel r ∧ wo_rel r'" using WELL WELL' by (auto simp add: wo_rel_def) assume *: "bij_betw f (Field r) (Field r') ∧ compat r r' f" thus "iso r r' f" unfolding "compat_def" using assms proof(auto simp add: iso_iff2) fix a b assume **: "a ∈ Field r" "b ∈ Field r" and ***: "(f a, f b) ∈ r'" {assume "(b,a) ∈ r ∨ b = a" hence "(b,a) ∈ r"using Well ** wo_rel.REFL[of r] refl_on_def[of _ r] by blast hence "(f b, f a) ∈ r'" using * unfolding compat_def by auto hence "f a = f b" using Well *** wo_rel.ANTISYM[of r'] antisym_def[of r'] by blast hence "a = b" using * ** unfolding bij_betw_def inj_on_def by auto hence "(a,b) ∈ r" using Well ** wo_rel.REFL[of r] refl_on_def[of _ r] by blast } thus "(a,b) ∈ r" using Well ** wo_rel.TOTAL[of r] total_on_def[of _ r] by blast qed qed end