Theory MMI_Complex_ZF_2

(* 
    This file is a part of MMIsar - a translation of Metamath's set.mm to Isabelle 2005 (ZF logic).

    Copyright (C) 2007  Slawomir Kolodynski

    This program is free software; Redistribution and use in source and binary forms, 
    with or without modification, are permitted provided that the following conditions are met:

   1. Redistributions of source code must retain the above copyright notice, 
   this list of conditions and the following disclaimer.
   2. Redistributions in binary form must reproduce the above copyright notice, 
   this list of conditions and the following disclaimer in the documentation and/or 
   other materials provided with the distribution.
   3. The name of the author may not be used to endorse or promote products 
   derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

*)

section ‹Complex numbers in Metamatah 2›

theory MMI_Complex_ZF_2 
imports MMI_logic_and_sets_1 MMI_Complex_ZF_1 InductiveSeq_ZF

begin

text‹This theory contains theorems (with proofs) about complex numbers
  imported from the Metamath's set.mm database. 
  The original Metamath proofs were mostly written by Norman Megill, 
  see the Metamath Proof Explorer pages for more detailed atribution.
  This theory contains about 100 theorems from ‹1nn› to ‹infmrcl›
›

  (** proven by hand, really the definition of natural numbers *)

lemma (in MMIsar0) MMI_df_n: shows
  "ℕ = ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) }"
proof -
  let ?K⇩1 = "{N ∈ Pow(ℝ). 𝟭 ∈ N ∧ (∀n. n∈N ⟶ n\<ca>𝟭 ∈ N)}"
  let ?K⇩2 = "{N ∈ Pow(ℝ). 𝟭 ∈ N ∧ (∀n∈N. n\<ca>𝟭 ∈ N)}"
  { fix N assume "N ∈ ?K⇩1"
    hence "N ∈ Pow(ℝ)"   "𝟭 ∈ N"   "∀n. n∈N ⟶ n\<ca>𝟭 ∈ N"
      by auto
    then have "N ∈ ?K⇩2" by auto }
  moreover
  { fix N assume "N ∈ ?K⇩2"
    hence "N ∈ Pow(ℝ)"   "𝟭 ∈ N"   "∀n∈N. n\<ca>𝟭 ∈ N"
      by auto
    then have "N ∈ ?K⇩1" by auto }
  ultimately have "?K⇩1 = ?K⇩2" by blast
  then show ?thesis using cxn_def by simp
qed

    (** a helper lemma that is needed bc. in Isabelle the intersection
    of empty set is pretty much undefined. To use the definition
    of natural numbers we need to show that we are intersecting a nonempty
    collection of sets. *)

lemma (in MMIsar0) MMI_Ndef_nonempty:
  shows "{x ∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) } ≠ 0"
proof -
  have 
    "\<caddset> : ( ℂ × ℂ ) → ℂ"   "ℝ ⊆ ℂ"   and I: "𝟭 ∈ ℝ"   
    using MMI_axaddopr MMI_axresscn MMI_ax1re by auto
  moreover from I have "∀y∈ℝ. \<caddset>`⟨y,𝟭⟩ ∈ ℝ"
    using MMI_axaddrcl ca_def by simp
  ultimately have 
    "{x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. \<caddset>`⟨y,𝟭⟩ ∈ x) } ≠ 0"
    using binop_gen_set_ex1 by auto
  then show ?thesis using ca_def by simp
qed

(** this corresponds to Metamath's 1nn. Proven by Isabelle.**)

lemma (in MMIsar0) MMI_1nn: shows "𝟭 ∈ ℕ"
  using MMI_df_n MMI_Ndef_nonempty by auto

(** 501, 502 ******************************************)

(*lemma (in MMIsar0) MMI_nnex: shows "ℕ = ℕ" by simp;

lemma (in MMIsar0) MMI_peano2nn: 
   shows "A ∈ ℕ ⟶ A \<ca> 𝟭 ∈ ℕ"
  using MMI_df_n MMI_Ndef_nonempty by auto;

proof -
   have S1: "z = A ⟶ 
   z \<ca> 𝟭 = A \<ca> 𝟭" by (rule MMI_opreq1)
   from S1 have S2: "z = A ⟶ 
   z \<ca> 𝟭 ∈ ℕ ⟷ A \<ca> 𝟭 ∈ ℕ" by (rule MMI_eleq1d)
   have S3: "y = z ⟶ 
   y \<ca> 𝟭 = z \<ca> 𝟭" by (rule MMI_opreq1)
   from S3 have S4: "y = z ⟶ 
   y \<ca> 𝟭 ∈ x ⟷ z \<ca> 𝟭 ∈ x" by (rule MMI_eleq1d)
   from S4 have S5: "(∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ 
   z ∈ x ⟶ z \<ca> 𝟭 ∈ x" by (rule MMI_rcla4cv)
   from S5 have S6: "𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ 
   z ∈ x ⟶ z \<ca> 𝟭 ∈ x" by (rule MMI_adantl)
   from S6 have S7: "(𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ z ∈ x) ⟶ 
   𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ z \<ca> 𝟭 ∈ x" by (rule MMI_a2i)
   from S7 have S8: "(∀x. 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ z ∈ x) ⟶ 
   (∀x. 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ z \<ca> 𝟭 ∈ x)" by (rule MMI_19_20i)
   have S9: "z = z" by (rule MMI_visset)
   from S9 have S10: "z ∈ ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) } ⟷ 
   (∀x. 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ z ∈ x)" by (rule MMI_elintab)
   have S11: "z \<ca> 𝟭 = z \<ca> 𝟭" by (rule MMI_oprex)
   from S11 have S12: "z \<ca> 𝟭 ∈ ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) } ⟷ 
   (∀x. 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) ⟶ z \<ca> 𝟭 ∈ x)" by (rule MMI_elintab)
   from S8 S10 S12 have S13: "z ∈ ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) } ⟶ 
   z \<ca> 𝟭 ∈ ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) }" by (rule MMI_3imtr4)
   have S14: "ℕ = ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) }" by (rule MMI_df_n)
   from S14 have S15: "z ∈ ℕ ⟷ 
   z ∈ ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) }" by (rule MMI_eleq2i)
   from S14 have S16: "ℕ = ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) }" .
   from S16 have S17: "z \<ca> 𝟭 ∈ ℕ ⟷ 
   z \<ca> 𝟭 ∈ ⋂ {x∈ Pow(ℝ). 𝟭 ∈ x ∧ (∀y∈x. y \<ca> 𝟭 ∈ x) }" by (rule MMI_eleq2i)
   from S13 S15 S17 have S18: "z ∈ ℕ ⟶ z \<ca> 𝟭 ∈ ℕ" by (rule MMI_3imtr4)
   from S2 S18 show "A ∈ ℕ ⟶ A \<ca> 𝟭 ∈ ℕ" by (rule MMI_vtoclga)
qed the original proof **)

(** first attempt, true, but not what needed **)
lemma (in MMIsar0) MMI_nnind0: 
    assumes A1: "∀x. x = 𝟭 ⟶  φ(x) ⟷ ψ(x)" and
    A2: "∀y x. x = y ⟶  φ(x) ⟷ ch(x\<ca>𝟭)" and
    A3: "∀y x. x = y \<ca> 𝟭 ⟶  φ(x) ⟷ θ(x)" and
    A4: "∀x. x = A ⟶  φ(x) ⟷ τ(x)" and
    A5: "ψ(𝟭)" and
    A6: "∀y. y ∈ ℕ ⟶ ch(y\<ca>𝟭) ⟶ θ(y\<ca>𝟭)"   
   shows "A ∈ ℕ ⟶ τ(A)"
proof -
   from A1 have S1: "∀x. x = 𝟭 ⟶   φ(x) ⟷ ψ(x)".
   from S1 have S2: "𝟭 ∈ {x ∈ ℕ. φ(x) } ⟷ 𝟭 ∈ ℕ ∧ ψ(𝟭)" by (rule MMI_elrab)
   have S3: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   from A5 have S4: "ψ(𝟭)".
   from S2 S3 S4 have S5: "𝟭 ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_mpbir2an)
   have S6: "{x ∈ ℕ. φ(x) } ⊆ℕ" by (rule MMI_ssrab2)
   { fix y
     from S6 have S7: "y ∈ {x ∈ ℕ. φ(x) } ⟶ y ∈ ℕ" by (rule MMI_sseli)
     have S8: "y ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
     from S8 have S9: "y ∈ ℕ ⟶  y ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℕ" by (rule MMI_a1d)
     from A6 have S10: "y ∈ ℕ ⟶ ch(y\<ca>𝟭) ⟶ θ(y\<ca>𝟭)" by simp
     from S9 S10 have S11: "y ∈ ℕ ⟶  y ∈ ℕ ∧ ch(y\<ca>𝟭) ⟶  y \<ca> 𝟭 ∈ ℕ ∧ θ(y\<ca>𝟭)" 
       by (rule MMI_anim12d)
     from A2 have S12: "∀ x. x = y ⟶  φ(x) ⟷ ch(x\<ca>𝟭)" by simp
     from S12 have S13: "y ∈ {x ∈ ℕ. φ(x) } ⟷ y ∈ ℕ ∧ ch(y\<ca>𝟭)" by (rule MMI_elrab)
     from A3 have S14: "∀ x. x = y \<ca> 𝟭 ⟶  φ(x) ⟷ θ(x)" by simp
     from S14 have S15: "y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) } ⟷  y \<ca> 𝟭 ∈ ℕ ∧ θ(y\<ca>𝟭)" 
       by (rule MMI_elrab)
     from S11 S13 S15 have S16: 
       "y ∈ ℕ ⟶  y ∈ {x ∈ ℕ. φ(x) } ⟶  y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_3imtr4g)
   from S7 S16 have S17: "y ∈ {x ∈ ℕ. φ(x) } ⟶  y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }" 
     by (rule MMI_mpcom) }
   then have S17: "∀y. y ∈ {x ∈ ℕ. φ(x) } ⟶  y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }"
     by simp
   from S17 have S18: "∀y∈{x ∈ ℕ. φ(x) }. y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_rgen)
   have S19: "ℕ = ℕ" by (rule MMI_nnex)
   from S19 have S20: "{x ∈ ℕ. φ(x) } = {x ∈ ℕ. φ(x) }" by (rule MMI_rabex)
   from S20 have S21: "𝟭 ∈ {x ∈ ℕ. φ(x) } ∧ (∀y∈{x ∈ ℕ. φ(x) }. y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }) ⟶ 
   ℕ ⊆{x ∈ ℕ. φ(x) }" by (rule MMI_peano5nn)
   from S5 S18 S21 have S22: "ℕ ⊆{x ∈ ℕ. φ(x) }" by (rule MMI_mp2an)
   from S22 have S23: "A ∈ ℕ ⟶  A ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_sseli)
   from A4 have S24: "∀x. x = A ⟶  φ(x) ⟷ τ(x)" .
   from S24 have S25: "A ∈ {x ∈ ℕ. φ(x) } ⟷ A ∈ ℕ ∧ τ(A)" by (rule MMI_elrab)
   from S23 S25 have S26: "A ∈ ℕ ⟶ A ∈ ℕ ∧ τ(A)" by (rule MMI_sylib)
   from S26 show "A ∈ ℕ ⟶ τ(A)" by (rule MMI_pm3_27d)
qed

(** this version is needed, at least in nnaddclt **************)
lemma (in MMIsar0) MMI_nnind: 
    assumes A1: "∀x. x = 𝟭 ⟶  φ(x) ⟷ ψ(𝟭)" and
    A2: "∀x y. x = y ⟶  φ(x) ⟷ ch(y)" and
    A3: "∀x y. x = y \<ca> 𝟭 ⟶  φ(x) ⟷ θ(y\<ca>𝟭)" and
    A4: "∀x. x = B ⟶  φ(x) ⟷ τ(B)" and
    A5: "ψ(𝟭)" and
    A6: "∀y. y ∈ ℕ ⟶ ch(y) ⟶ θ(y\<ca>𝟭)"   
   shows "B ∈ ℕ ⟶ τ(B)"
proof -
   from A1 have S1: "∀x. x = 𝟭 ⟶   φ(x) ⟷ ψ(𝟭)".
   from S1 have S2: "𝟭 ∈ {x ∈ ℕ. φ(x) } ⟷ 𝟭 ∈ ℕ ∧ ψ(𝟭)" by (rule MMI_elrab)
   have S3: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   from A5 have S4: "ψ(𝟭)".
   from S2 S3 S4 have S5: "𝟭 ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_mpbir2an)
   have S6: "{x ∈ ℕ. φ(x) } ⊆ ℕ" by (rule MMI_ssrab2)
   { fix y
     from S6 have S7: "y ∈ {x ∈ ℕ. φ(x) } ⟶ y ∈ ℕ" by (rule MMI_sseli)
     have S8: "y ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
     from S8 have S9: "y ∈ ℕ ⟶  y ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℕ" by (rule MMI_a1d)
     from A6 have S10: "y ∈ ℕ ⟶ ch(y) ⟶ θ(y\<ca>𝟭)" by simp
     from S9 S10 have S11: "y ∈ ℕ ⟶  y ∈ ℕ ∧ ch(y) ⟶  y \<ca> 𝟭 ∈ ℕ ∧ θ(y\<ca>𝟭)" 
       by (rule MMI_anim12d)
     from A2 have S12: "∀ x. x = y ⟶  φ(x) ⟷ ch(y)" by simp
     from S12 have S13: "y ∈ {x ∈ ℕ. φ(x) } ⟷ y ∈ ℕ ∧ ch(y)" by (rule MMI_elrab)
     from A3 have S14: "∀ x. x = y \<ca> 𝟭 ⟶  φ(x) ⟷ θ(y\<ca>𝟭)" by simp
     from S14 have S15: "y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) } ⟷  y \<ca> 𝟭 ∈ ℕ ∧ θ(y\<ca>𝟭)" 
       by (rule MMI_elrab)
     from S11 S13 S15 have S16: 
       "y ∈ ℕ ⟶  y ∈ {x ∈ ℕ. φ(x) } ⟶  y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_3imtr4g)
   from S7 S16 have "y ∈ {x ∈ ℕ. φ(x) } ⟶  y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }" 
     by (rule MMI_mpcom) }
   then have S17: "∀y. y ∈ {x ∈ ℕ. φ(x) } ⟶  y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }"
     by simp
   from S17 have S18: "∀y∈{x ∈ ℕ. φ(x) }. y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_rgen)
   have S19: "ℕ = ℕ" by (rule MMI_nnex)
   from S19 have S20: "{x ∈ ℕ. φ(x) } = {x ∈ ℕ. φ(x) }" by (rule MMI_rabex)
   from S20 have S21: 
     "𝟭 ∈ {x ∈ ℕ. φ(x) } ∧ (∀y∈{x ∈ ℕ. φ(x) }. y \<ca> 𝟭 ∈ {x ∈ ℕ. φ(x) }) ⟶ 
     ℕ ⊆{x ∈ ℕ. φ(x) }" by (rule MMI_peano5nn)
   from S5 S18 S21 have S22: "ℕ ⊆{x ∈ ℕ. φ(x) }" by (rule MMI_mp2an)
   from S22 have S23: "B ∈ ℕ ⟶  B ∈ {x ∈ ℕ. φ(x) }" by (rule MMI_sseli)
   from A4 have S24: "∀x. x = B ⟶  φ(x) ⟷ τ(B)" .
   from S24 have S25: "B ∈ {x ∈ ℕ. φ(x) } ⟷ B ∈ ℕ ∧ τ(B)" by (rule MMI_elrab)
   from S23 S25 have S26: "B ∈ ℕ ⟶ B ∈ ℕ ∧ τ(B)" by (rule MMI_sylib)
   from S26 show "B ∈ ℕ ⟶ τ(B)" by (rule MMI_pm3_27d)
qed

text‹Induction - on (real) natural numbers -  version for humans.›

corollary (in MMIsar0) nnind1: 
  assumes A1: "ψ(𝟭)" and 
  A2: "∀k ∈ ℕ. ψ(k) ⟶ ψ(k\<ca>𝟭)" and
  A3: "n ∈ ℕ"
  shows "ψ(n)"
proof -
  have "∀x. x = 𝟭 ⟶  ψ(x) ⟷ ψ(𝟭)" by simp
  moreover have "∀x y. x = y ⟶  ψ(x) ⟷ ψ(y)" by simp
  moreover have "∀x y. x = y \<ca> 𝟭 ⟶  ψ(x) ⟷ ψ(y\<ca>𝟭)" by simp
  moreover have "∀x. x = n ⟶  ψ(x) ⟷ ψ(n)" by simp
  moreover note A1
  moreover from A2 have "∀k. k ∈ ℕ ⟶ ψ(k) ⟶ ψ(k\<ca>𝟭)" by blast
  ultimately have "n ∈ ℕ ⟶ ψ(n)" by (rule MMI_nnind)
  with A3 show "ψ(n)" by simp
qed
(* I have no idea what this theorem even means

lemma (in MMIsar0) MMI_nn1suc: assumes A1: "x = 𝟭 ⟶ 
   φ ⟷ ψ" and
    A3: "x = y \<ca> 𝟭 ⟶ 
   φ ⟷ ch" and
    A4: "x = A ⟶ 
   φ ⟷ θ" and
    A5: "ψ" and
    A6: "y ∈ ℕ ⟶ ch"   
   shows "A ∈ ℕ ⟶ θ"
proof -
   have S1: "z = 𝟭 ⟶ 
   [ z / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   [ 𝟭 / x ] (A ∈ ℕ ⟶ φ)" by (rule MMI_dfsbcq)
   have S2: "z = y ⟶ 
   [ z / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   [ y / x ] (A ∈ ℕ ⟶ φ)" by (rule MMI_sbequ)
   have S3: "z = y \<ca> 𝟭 ⟶ 
   [ z / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   [ y \<ca> 𝟭 / x ] (A ∈ ℕ ⟶ φ)" by (rule MMI_dfsbcq)
   have S4: "z = A ⟶ 
   [ z / x ] φ ⟷ [ A / x ] φ" by (rule MMI_dfsbcq)
   have S5: "A ∈ ℕ ⟶ ( ∃x. x = A)" by (rule MMI_elex)
   have S6: "z ∈ A ⟶ (∀x. z ∈ A)" by (rule MMI_ax_17)
   from S6 have S7: "(A ∈ ℕ ⟶ [ A / x ] φ) ⟶ 
   (∀x. A ∈ ℕ ⟶ [ A / x ] φ)" by (rule MMI_hbsbc1)
   have S8: "(A ∈ ℕ ⟶ θ) ⟶ 
   (∀x. A ∈ ℕ ⟶ θ)" by (rule MMI_ax_17)
   from S7 S8 have S9: "(A ∈ ℕ ⟶ [ A / x ] φ) ⟷ 
   (A ∈ ℕ ⟶ θ) ⟶ 
   (∀x. (A ∈ ℕ ⟶ [ A / x ] φ) ⟷ 
   (A ∈ ℕ ⟶ θ))" by (rule MMI_hbbi)
   have S10: "x = A ⟶ 
   φ ⟷ [ A / x ] φ" by (rule MMI_sbceq1a)
   from A4 have S11: "x = A ⟶ 
   φ ⟷ θ".
   from S10 S11 have S12: "x = A ⟶ 
   [ A / x ] φ ⟷ θ" by (rule MMI_bitr3d)
   from S12 have S13: "x = A ⟶ 
   (A ∈ ℕ ⟶ [ A / x ] φ) ⟷ 
   (A ∈ ℕ ⟶ θ)" by (rule MMI_imbi2d)
   from S9 S13 have S14: "( ∃x. x = A) ⟶ 
   (A ∈ ℕ ⟶ [ A / x ] φ) ⟷ 
   (A ∈ ℕ ⟶ θ)" by (rule MMI_19_23ai)
   from S5 S14 have S15: "A ∈ ℕ ⟶ 
   (A ∈ ℕ ⟶ [ A / x ] φ) ⟷ 
   (A ∈ ℕ ⟶ θ)" by (rule MMI_syl)
   from S15 have S16: "A ∈ ℕ ⟶ 
   A ∈ ℕ ⟶ 
   [ A / x ] φ ⟷ θ" by (rule MMI_pm5_74rd)
   from S16 have S17: "A ∈ ℕ ⟶ 
   [ A / x ] φ ⟷ θ" by (rule MMI_pm2_43i)
   from S4 S17 have S18: "A ∈ ℕ ∧ z = A ⟶ 
   [ z / x ] φ ⟷ θ" by (rule MMI_sylan9bbr)
   from S18 have S19: "z = A ⟶ 
   A ∈ ℕ ⟶ 
   [ z / x ] φ ⟷ θ" by (rule MMI_expcom)
   from S19 have S20: "z = A ⟶ 
   (A ∈ ℕ ⟶ [ z / x ] φ) ⟷ 
   (A ∈ ℕ ⟶ θ)" by (rule MMI_pm5_74d)
   have S21: "A ∈ ℕ ⟶ (∀x. A ∈ ℕ)" by (rule MMI_ax_17)
   from S21 have S22: "[ z / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   (A ∈ ℕ ⟶ [ z / x ] φ)" by (rule MMI_sb19_21)
   from S20 S22 have S23: "z = A ⟶ 
   [ z / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   (A ∈ ℕ ⟶ θ)" by (rule MMI_syl5bb)
   have S24: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   from S24 have S25: "𝟭 = 𝟭" by (rule MMI_elisseti)
   from S25 have S26: " ∃x. x = 𝟭" by (rule MMI_isseti)
   from S25 have S27: "𝟭 = 𝟭" .
   from S27 have S28: "[ 𝟭 / x ] φ ⟶ 
   (∀x. [ 𝟭 / x ] φ)" by (rule MMI_hbsbc1v)
   from A5 have S29: "ψ".
   from A1 have S30: "x = 𝟭 ⟶ 
   φ ⟷ ψ".
   from S29 S30 have S31: "x = 𝟭 ⟶ φ" by (rule MMI_mpbiri)
   have S32: "x = 𝟭 ⟶ 
   φ ⟷ [ 𝟭 / x ] φ" by (rule MMI_sbceq1a)
   from S31 S32 have S33: "x = 𝟭 ⟶ [ 𝟭 / x ] φ" by (rule MMI_mpbid)
   from S28 S33 have S34: "( ∃x. x = 𝟭) ⟶ [ 𝟭 / x ] φ" by (rule MMI_19_23ai)
   from S26 S34 have S35: "[ 𝟭 / x ] φ" by (rule MMI_ax_mp)
   from S35 have S36: "A ∈ ℕ ⟶ [ 𝟭 / x ] φ" by (rule MMI_a1i)
   from S25 have S37: "𝟭 = 𝟭" .
   from S21 have S38: "A ∈ ℕ ⟶ (∀x. A ∈ ℕ)" .
   from S38 have S39: "𝟭 = 𝟭 ⟶ 
   [ 𝟭 / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   (A ∈ ℕ ⟶ [ 𝟭 / x ] φ)" by (rule MMI_sbc19_21g)
   from S37 S39 have S40: "[ 𝟭 / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   (A ∈ ℕ ⟶ [ 𝟭 / x ] φ)" by (rule MMI_ax_mp)
   from S36 S40 have S41: "[ 𝟭 / x ] (A ∈ ℕ ⟶ φ)" by (rule MMI_mpbir)
   from A6 have S42: "y ∈ ℕ ⟶ ch".
   have S43: "y \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_oprex)
   from S43 have S44: " ∃x. x = y \<ca> 𝟭" by (rule MMI_isseti)
   have S45: "ch ⟶ (∀x. ch)" by (rule MMI_ax_17)
   from S43 have S46: "y \<ca> 𝟭 = y \<ca> 𝟭" .
   from S46 have S47: "[ y \<ca> 𝟭 / x ] φ ⟶ 
   (∀x. [ y \<ca> 𝟭 / x ] φ)" by (rule MMI_hbsbc1v)
   from S45 S47 have S48: "ch ⟷ [ y \<ca> 𝟭 / x ] φ ⟶ 
   (∀x. ch ⟷ [ y \<ca> 𝟭 / x ] φ)" by (rule MMI_hbbi)
   from A3 have S49: "x = y \<ca> 𝟭 ⟶ 
   φ ⟷ ch".
   have S50: "x = y \<ca> 𝟭 ⟶ 
   φ ⟷ [ y \<ca> 𝟭 / x ] φ" by (rule MMI_sbceq1a)
   from S49 S50 have S51: "x = y \<ca> 𝟭 ⟶ 
   ch ⟷ [ y \<ca> 𝟭 / x ] φ" by (rule MMI_bitr3d)
   from S48 S51 have S52: "( ∃x. x = y \<ca> 𝟭) ⟶ 
   ch ⟷ [ y \<ca> 𝟭 / x ] φ" by (rule MMI_19_23ai)
   from S44 S52 have S53: "ch ⟷ [ y \<ca> 𝟭 / x ] φ" by (rule MMI_ax_mp)
   from S42 S53 have S54: "y ∈ ℕ ⟶ [ y \<ca> 𝟭 / x ] φ" by (rule MMI_sylib)
   from S54 have S55: "y ∈ ℕ ⟶ 
   A ∈ ℕ ⟶ [ y \<ca> 𝟭 / x ] φ" by (rule MMI_a1d)
   from S43 have S56: "y \<ca> 𝟭 = y \<ca> 𝟭" .
   from S21 have S57: "A ∈ ℕ ⟶ (∀x. A ∈ ℕ)" .
   from S57 have S58: "y \<ca> 𝟭 = y \<ca> 𝟭 ⟶ 
   [ y \<ca> 𝟭 / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   (A ∈ ℕ ⟶ [ y \<ca> 𝟭 / x ] φ)" by (rule MMI_sbc19_21g)
   from S56 S58 have S59: "[ y \<ca> 𝟭 / x ] (A ∈ ℕ ⟶ φ) ⟷ 
   (A ∈ ℕ ⟶ [ y \<ca> 𝟭 / x ] φ)" by (rule MMI_ax_mp)
   from S55 S59 have S60: "y ∈ ℕ ⟶ 
   [ y \<ca> 𝟭 / x ] (A ∈ ℕ ⟶ φ)" by (rule MMI_sylibr)
   from S60 have S61: "y ∈ ℕ ⟶ 
   [ y / x ] (A ∈ ℕ ⟶ φ) ⟶ 
   [ y \<ca> 𝟭 / x ] (A ∈ ℕ ⟶ φ)" by (rule MMI_a1d)
   from S1 S2 S3 S23 S41 S61 have S62: "A ∈ ℕ ⟶ 
   A ∈ ℕ ⟶ θ" by (rule MMI_nnind)
   from S62 show "A ∈ ℕ ⟶ θ" by (rule MMI_pm2_43i)
qed*)
lemma (in MMIsar0) MMI_nn1suc: assumes 
  A1: "∀x. x = 𝟭 ⟶  φ(x) ⟷ ψ(𝟭)" and
  A3: "∀x y. x = y \<ca> 𝟭 ⟶  φ(x) ⟷ ch(y\<ca>𝟭)" and
  A4: "∀x. x = A ⟶  φ(x) ⟷ θ(A)" and
  A5: "ψ(𝟭)" and
  A6: "∀y. y ∈ ℕ ⟶ ch(y\<ca>𝟭)"   
   shows "A ∈ ℕ ⟶ θ(A)"
proof -
  have S1: "∀ z. z = 𝟭 ⟶ (A ∈ ℕ ⟶ φ(z)) ⟷ (A ∈ ℕ ⟶ φ(𝟭))" by auto(*(rule MMI_dfsbcq);*)
  have S2: "∀z y. z = y ⟶ (A ∈ ℕ ⟶ φ(z)) ⟷ (A ∈ ℕ ⟶ φ(y))" by auto (*(rule MMI_sbequ);*)
  have S3: "∀z y. z = y \<ca> 𝟭 ⟶  (A ∈ ℕ ⟶ φ(z)) ⟷ (A ∈ ℕ ⟶ φ(y\<ca>𝟭))" 
    by auto (*(rule MMI_dfsbcq)*)
  { fix z 
    have S4: "z = A ⟶  φ(z) ⟷ φ(A)" by auto (*(rule MMI_dfsbcq)*)
    have S5: "A ∈ ℕ ⟶ ( ∃x. x = A)" by (rule MMI_elex)
    have S6: "z ∈ A ⟶ (∀x. z ∈ A)" by (rule MMI_ax_17)
    from S6 have S7: "(A ∈ ℕ ⟶ φ(A)) ⟶ (∀x. A ∈ ℕ ⟶ φ(A))" by auto (*(rule MMI_hbsbc1)*)
    have S8: "(A ∈ ℕ ⟶ θ(A)) ⟶ (∀x. A ∈ ℕ ⟶ θ(A))" by (rule MMI_ax_17)
    have S9: 
      "((A ∈ ℕ ⟶ φ(A)) ⟷  (A ∈ ℕ ⟶ θ(A))) ⟶  (∀x. (A ∈ ℕ ⟶ φ(A)) ⟷ 
      (A ∈ ℕ ⟶ θ(A)))" by auto
    have S10: "∀x. x = A ⟶ φ(x) ⟷ φ(A)" by auto (*(rule MMI_sbceq1a)*)
    from A4 have S11: "∀x. x = A ⟶ φ(x) ⟷ θ(A)".
    from S10 S11 have S12: "∀ x. x = A ⟶ φ(x) ⟷ θ(A)" by auto (*(rule MMI_bitr3d);*)
    from S12 have S13: "∀x. x = A ⟶ (A ∈ ℕ ⟶ φ(x)) ⟷ (A ∈ ℕ ⟶ θ(A))" by auto (*(rule MMI_imbi2d);*)
    from S9 S13 have S14: "( ∃x. x = A) ⟶  (A ∈ ℕ ⟶ φ(A)) ⟷ (A ∈ ℕ ⟶ θ(A))" 
      by auto (*(rule MMI_19_23ai)*)
    from S5 S14 have S15: "A ∈ ℕ ⟶ (A ∈ ℕ ⟶ φ(A)) ⟷ (A ∈ ℕ ⟶ θ(A))" by (rule MMI_syl)
    from S15 have S16: "A ∈ ℕ ⟶  A ∈ ℕ ⟶ φ(A) ⟷ θ(A)" by (rule MMI_pm5_74rd)
    from S16 have S17: "A ∈ ℕ ⟶ φ(A) ⟷ θ(A)" by (rule MMI_pm2_43i)
    from S4 S17 have S18: "A ∈ ℕ ∧ z = A ⟶ φ(z) ⟷ θ(A)" by (rule MMI_sylan9bbr)
    from S18 have S19: "z = A ⟶  A ∈ ℕ ⟶ φ(z) ⟷ θ(A)" by (rule MMI_expcom)
    from S19 have S20: "z = A ⟶  (A ∈ ℕ ⟶ φ(z)) ⟷  (A ∈ ℕ ⟶ θ(A))" 
      by (rule MMI_pm5_74d)
    have S21: "A ∈ ℕ ⟶ (∀x. A ∈ ℕ)" by (rule MMI_ax_17)
    from S21 have S22: "(A ∈ ℕ ⟶ φ(z)) ⟷ (A ∈ ℕ ⟶ φ(z))" by auto (*(rule MMI_sb19_21)*)
    from S20 S22 have "z = A ⟶  (A ∈ ℕ ⟶ φ(z)) ⟷ (A ∈ ℕ ⟶ θ(A))" 
      by (rule MMI_syl5bb)
  } then have S23: "∀z. z = A ⟶  (A ∈ ℕ ⟶ φ(z)) ⟷ (A ∈ ℕ ⟶ θ(A))"
    by simp
   have S24: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   from S24 have S25: "𝟭 = 𝟭" by simp (*(rule MMI_elisseti);*)
   from S25 have S26: " ∃x. x = 𝟭" by (rule MMI_isseti)
   from S25 have S27: "𝟭 = 𝟭" .
   from S27 have S28: "φ(𝟭) ⟶  (∀x. φ(𝟭))" by simp (*(rule MMI_hbsbc1v);*)
   from A5 have S29: "ψ(𝟭)".
   from A1 have S30: "∀ x. x = 𝟭 ⟶ φ(x) ⟷ ψ(𝟭)".
   from S29 S30 have S31: "∀x. x = 𝟭 ⟶ φ(x)" by simp (*(rule MMI_mpbiri);*)
   have S32: "∀ x. x = 𝟭 ⟶ φ(x) ⟷ φ(𝟭)" by simp (*(rule MMI_sbceq1a);*)
   from S31 S32 have S33: "∀x. x = 𝟭 ⟶ φ(𝟭)" by blast (*(rule MMI_mpbid);*)
   from S28 S33 have S34: "( ∃x. x = 𝟭) ⟶ φ(𝟭)" by auto (*(rule MMI_19_23ai);*)
   from S26 S34 have S35: "φ(𝟭)" by (rule MMI_ax_mp)
   from S35 have S36: "A ∈ ℕ ⟶ φ(𝟭)" by (rule MMI_a1i)
   from S25 have S37: "𝟭 = 𝟭" .
   have S38: "A ∈ ℕ ⟶ (∀x. A ∈ ℕ)" by (rule MMI_ax_17)
   from S38 have S39: "𝟭 = 𝟭 ⟶ (A ∈ ℕ ⟶ φ(𝟭)) ⟷ (A ∈ ℕ ⟶ φ(𝟭))" 
     by simp (*(rule MMI_sbc19_21g);*)
   from S37 S39 have S40: "(A ∈ ℕ ⟶ φ(𝟭)) ⟷ (A ∈ ℕ ⟶ φ(𝟭))" 
     by (rule MMI_ax_mp)
   from S36 S40 have S41: "(A ∈ ℕ ⟶ φ(𝟭))" by (rule MMI_mpbir)
   { fix y
     from A6 have S42: "y ∈ ℕ ⟶ ch(y\<ca>𝟭)" by simp
     have S43: "y \<ca> 𝟭 = y \<ca> 𝟭" by simp (*(rule MMI_oprex);*)
     from S43 have S44: " ∃x. x = y \<ca> 𝟭" by (rule MMI_isseti)
     have S45: "ch(y\<ca>𝟭) ⟶ (∀x. ch(y\<ca>𝟭))" by (rule MMI_ax_17)
     from S43 have S46: "y \<ca> 𝟭 = y \<ca> 𝟭" .
     from S46 have S47: "φ(y \<ca> 𝟭) ⟶  (∀x. φ(y \<ca> 𝟭))" by simp (*(rule MMI_hbsbc1v);*)
     from S45 S47 have S48: 
       "(ch(y \<ca> 𝟭) ⟷ φ(y \<ca> 𝟭)) ⟶  (∀x. ch(y \<ca> 𝟭) ⟷ φ(y \<ca> 𝟭))" by simp 
       (*(rule MMI_hbbi)*)
     from A3 have S49: "∀x y. x = y \<ca> 𝟭 ⟶ φ(x) ⟷ ch(y\<ca>𝟭)".
     have S50: "∀x. x = y \<ca> 𝟭 ⟶  φ(x) ⟷ φ(y \<ca> 𝟭)" by simp (*(rule MMI_sbceq1a);*)
     from S49 S50 have S51: "∀ x. x = y \<ca> 𝟭 ⟶  ch(y \<ca> 𝟭) ⟷ φ(y \<ca> 𝟭)" 
       by simp (*(rule MMI_bitr3d)*)
     from S48 S51 have S52: "( ∃x. x = y \<ca> 𝟭) ⟶ ch(y \<ca> 𝟭) ⟷ φ(y \<ca> 𝟭)" by auto
       (*(rule MMI_19_23ai);*)
     from S44 S52 have S53: "ch(y \<ca> 𝟭) ⟷ φ(y \<ca> 𝟭)" by (rule MMI_ax_mp)
     from S42 S53 have S54: "y ∈ ℕ ⟶ φ(y \<ca> 𝟭)" by (rule MMI_sylib)
     from S54 have S55: "y ∈ ℕ ⟶  A ∈ ℕ ⟶ φ(y \<ca> 𝟭)" by (rule MMI_a1d)
     from S43 have S56: "y \<ca> 𝟭 = y \<ca> 𝟭" .
     have S57: "A ∈ ℕ ⟶ (∀x. A ∈ ℕ)" by (rule MMI_ax_17)
     from S57 have S58: "y \<ca> 𝟭 = y \<ca> 𝟭 ⟶ (A ∈ ℕ ⟶ φ(y \<ca> 𝟭)) ⟷ 
       (A ∈ ℕ ⟶ φ(y \<ca> 𝟭))" by simp (*(rule MMI_sbc19_21g);*)
     from S56 S58 have S59: "(A ∈ ℕ ⟶ φ(y \<ca> 𝟭)) ⟷ (A ∈ ℕ ⟶ φ(y \<ca> 𝟭))" 
       by (rule MMI_ax_mp)
     from S55 S59 have S60: "y ∈ ℕ ⟶ (A ∈ ℕ ⟶ φ(y \<ca> 𝟭))" by (rule MMI_sylibr)
     from S60 have S61: "y ∈ ℕ ⟶  (A ∈ ℕ ⟶ φ(y)) ⟶ (A ∈ ℕ ⟶ φ(y \<ca> 𝟭))" by (rule MMI_a1d)
   } then have S61: "∀y. y ∈ ℕ ⟶  (A ∈ ℕ ⟶ φ(y)) ⟶ (A ∈ ℕ ⟶ φ(y \<ca> 𝟭))"
     by simp
   from S1 S2 S3 S23 S41 S61 have S62: "A ∈ ℕ ⟶  A ∈ ℕ ⟶ θ(A)" by (rule MMI_nnind)
   from S62 show "A ∈ ℕ ⟶ θ(A)" by (rule MMI_pm2_43i)
qed


lemma (in MMIsar0) MMI_nnaddclt: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<ca> B ∈ ℕ"
proof -
  { fix x
    have S1: "x = 𝟭 ⟶ A \<ca> x = A \<ca> 𝟭" by (rule MMI_opreq2)
    from S1 have S2: "x = 𝟭 ⟶ 
      A \<ca> x ∈ ℕ ⟷ A \<ca> 𝟭 ∈ ℕ" by (rule MMI_eleq1d)
    from S2 have "x = 𝟭 ⟶ 
      (A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ 
      (A ∈ ℕ ⟶ A \<ca> 𝟭 ∈ ℕ)" by (rule MMI_imbi2d) 
  } then have S3: "∀x. x = 𝟭 ⟶ 
      (A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A \<ca> 𝟭 ∈ ℕ)"
    by simp
  { fix x y
    have S4: "x = y ⟶ A \<ca> x = A \<ca> y" by (rule MMI_opreq2)
    from S4 have S5: "x = y ⟶ 
      A \<ca> x ∈ ℕ ⟷ A \<ca> y ∈ ℕ" by (rule MMI_eleq1d)
    from S5 have "x = y ⟶ 
      (A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ 
      (A ∈ ℕ ⟶ A \<ca> y ∈ ℕ)" by (rule MMI_imbi2d)
    } then have S6: "∀x y. x = y ⟶ 
	(A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A \<ca> y ∈ ℕ)"
      by simp
    { fix x y
      have S7: "x = y \<ca> 𝟭 ⟶ 
	A \<ca> x = A \<ca> (y \<ca> 𝟭)" by (rule MMI_opreq2)
      from S7 have S8: "x = y \<ca> 𝟭 ⟶ 
	A \<ca> x ∈ ℕ ⟷ 
	A \<ca> (y \<ca> 𝟭) ∈ ℕ" by (rule MMI_eleq1d)
      from S8 have "x = y \<ca> 𝟭 ⟶ 
	(A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A \<ca> (y \<ca> 𝟭) ∈ ℕ)" 
	by (rule MMI_imbi2d)
    } then have S9: "∀x y. x = y \<ca> 𝟭 ⟶ 
	(A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A \<ca> (y \<ca> 𝟭) ∈ ℕ)"
      by simp
    { fix x
      have S10: "x = B ⟶ A \<ca> x = A \<ca> B" by (rule MMI_opreq2)
      from S10 have S11: "x = B ⟶ 
	A \<ca> x ∈ ℕ ⟷ A \<ca> B ∈ ℕ" by (rule MMI_eleq1d)
      from S11 have "x = B ⟶ 
	(A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ 
	(A ∈ ℕ ⟶ A \<ca> B ∈ ℕ)" by (rule MMI_imbi2d)
    } then have S12: "∀x. x = B ⟶ 
	(A ∈ ℕ ⟶ A \<ca> x ∈ ℕ) ⟷ 	(A ∈ ℕ ⟶ A \<ca> B ∈ ℕ)"
      by simp
   have S13: "A ∈ ℕ ⟶ A \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
   have S14: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   { fix y
     have S15: "A ∈ ℂ ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ ⟶ 
       A \<ca> y \<ca> 𝟭 = A \<ca> (y \<ca> 𝟭)" by (rule MMI_axaddass)
     from S14 S15 have S16: "A ∈ ℂ ∧ y ∈ ℂ ⟶ 
       A \<ca> y \<ca> 𝟭 = A \<ca> (y \<ca> 𝟭)" by (rule MMI_mp3an3)
     have S17: "A ∈ ℕ ⟶ A ∈ ℂ" by (rule MMI_nncnt)
     have S18: "y ∈ ℕ ⟶ y ∈ ℂ" by (rule MMI_nncnt)
     from S16 S17 S18 have S19: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
       A \<ca> y \<ca> 𝟭 = A \<ca> (y \<ca> 𝟭)" by (rule MMI_syl2an)
     from S19 have S20: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
       A \<ca> y \<ca> 𝟭 ∈ ℕ ⟷ 
       A \<ca> (y \<ca> 𝟭) ∈ ℕ" by (rule MMI_eleq1d)
     have S21: "A \<ca> y ∈ ℕ ⟶ 
       A \<ca> y \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
     from S20 S21 have S22: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
       A \<ca> y ∈ ℕ ⟶ 
       A \<ca> (y \<ca> 𝟭) ∈ ℕ" by (rule MMI_syl5bi)
     from S22 have S23: "y ∈ ℕ ⟶ 
       A ∈ ℕ ⟶ 
       A \<ca> y ∈ ℕ ⟶ 
       A \<ca> (y \<ca> 𝟭) ∈ ℕ" by (rule MMI_expcom)
     from S23 have "y ∈ ℕ ⟶ 
       (A ∈ ℕ ⟶ A \<ca> y ∈ ℕ) ⟶   A ∈ ℕ ⟶  A \<ca> (y \<ca> 𝟭) ∈ ℕ" 
       by (rule MMI_a2d)
   } then have  S24: "∀y. y ∈ ℕ ⟶ 
       (A ∈ ℕ ⟶ A \<ca> y ∈ ℕ) ⟶   A ∈ ℕ ⟶  A \<ca> (y \<ca> 𝟭) ∈ ℕ" 
     by simp
   from S3 S6 S9 S12 S13 S24 have S25: "B ∈ ℕ ⟶ 
   A ∈ ℕ ⟶ A \<ca> B ∈ ℕ" by (rule MMI_nnind)
   from S25 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<ca> B ∈ ℕ" by (rule MMI_impcom)
qed


lemma (in MMIsar0) MMI_nnmulclt: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ A⋅B ∈ ℕ"
proof -
  { fix x
    have S1: "x = 𝟭 ⟶ A⋅x = A⋅𝟭" by (rule MMI_opreq2)
    from S1 have S2: "x = 𝟭 ⟶ 
      A⋅x ∈ ℕ ⟷ A⋅𝟭 ∈ ℕ" by (rule MMI_eleq1d)
    from S2 have "x = 𝟭 ⟶ 
      (A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ 
      (A ∈ ℕ ⟶ A⋅𝟭 ∈ ℕ)" by (rule MMI_imbi2d)
    } then have S3: "∀ x. x = 𝟭 ⟶ 
      (A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A⋅𝟭 ∈ ℕ)"
      by simp
    { fix x y 
      have S4: "x = y ⟶ A⋅x = A⋅y" by (rule MMI_opreq2)
      from S4 have S5: "x = y ⟶ 
	A⋅x ∈ ℕ ⟷ A⋅y ∈ ℕ" by (rule MMI_eleq1d)
      from S5 have "x = y ⟶ 
	(A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ 
	(A ∈ ℕ ⟶ A⋅y ∈ ℕ)" by (rule MMI_imbi2d)
    } then have S6: "∀x y. x = y ⟶ 
	(A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A⋅y ∈ ℕ)"
      by simp
    {fix x y
      have S7: "x = y \<ca> 𝟭 ⟶ 
	A⋅x = A⋅(y \<ca> 𝟭)" by (rule MMI_opreq2)
      from S7 have S8: "x = y \<ca> 𝟭 ⟶ 
	A⋅x ∈ ℕ ⟷ 
	A⋅(y \<ca> 𝟭) ∈ ℕ" by (rule MMI_eleq1d)
      from S8 have "x = y \<ca> 𝟭 ⟶ 
	(A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ 
	(A ∈ ℕ ⟶ 
	A⋅(y \<ca> 𝟭) ∈ ℕ)" by (rule MMI_imbi2d)
    } then have S9: "∀ x y. x = y \<ca> 𝟭 ⟶ 
	(A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A⋅(y \<ca> 𝟭) ∈ ℕ)"
      by simp
    { fix x 
      have S10: "x = B ⟶ A⋅x = A⋅B" by (rule MMI_opreq2)
      from S10 have S11: "x = B ⟶ 
	A⋅x ∈ ℕ ⟷ A⋅B ∈ ℕ" by (rule MMI_eleq1d)
      from S11 have "x = B ⟶ 
	(A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ 
	(A ∈ ℕ ⟶ A⋅B ∈ ℕ)" by (rule MMI_imbi2d)
    } then have S12: "∀ x. x = B ⟶ 
	(A ∈ ℕ ⟶ A⋅x ∈ ℕ) ⟷ (A ∈ ℕ ⟶ A⋅B ∈ ℕ)"
      by simp
    have S13: "A ∈ ℕ ⟶ A ∈ ℂ" by (rule MMI_nncnt)
    have S14: "A ∈ ℂ ⟶ A⋅𝟭 = A" by (rule MMI_ax1id)
    from S14 have S15: "A ∈ ℂ ⟶ 
      A⋅𝟭 ∈ ℕ ⟷ A ∈ ℕ" by (rule MMI_eleq1d)
    from S15 have S16: "A ∈ ℂ ⟶ 
      A ∈ ℕ ⟶ A⋅𝟭 ∈ ℕ" by (rule MMI_biimprd)
    from S13 S16 have S17: "A ∈ ℕ ⟶ A⋅𝟭 ∈ ℕ" by (rule MMI_mpcom)
    have S18: "𝟭 ∈ ℂ" by (rule MMI_1cn)
    { fix y
      have S19: "A ∈ ℂ ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ ⟶ 
	A⋅(y \<ca> 𝟭) = A⋅y \<ca> A⋅𝟭" by (rule MMI_axdistr)
      from S18 S19 have S20: "A ∈ ℂ ∧ y ∈ ℂ ⟶ 
	A⋅(y \<ca> 𝟭) = A⋅y \<ca> A⋅𝟭" by (rule MMI_mp3an3)
      from S14 have S21: "A ∈ ℂ ⟶ A⋅𝟭 = A" .
      from S21 have S22: "A ∈ ℂ ⟶ 
	A⋅y \<ca> A⋅𝟭 = A⋅y \<ca> A" by (rule MMI_opreq2d)
      from S22 have S23: "A ∈ ℂ ∧ y ∈ ℂ ⟶ 
	A⋅y \<ca> A⋅𝟭 = A⋅y \<ca> A" by (rule MMI_adantr)
      from S20 S23 have S24: "A ∈ ℂ ∧ y ∈ ℂ ⟶ 
	A⋅(y \<ca> 𝟭) = A⋅y \<ca> A" by (rule MMI_eqtrd)
      from S13 have S25: "A ∈ ℕ ⟶ A ∈ ℂ" .
      have S26: "y ∈ ℕ ⟶ y ∈ ℂ" by (rule MMI_nncnt)
      from S24 S25 S26 have S27: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
	A⋅(y \<ca> 𝟭) = A⋅y \<ca> A" by (rule MMI_syl2an)
      from S27 have S28: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
	A⋅(y \<ca> 𝟭) ∈ ℕ ⟷ A⋅y \<ca> A ∈ ℕ" by (rule MMI_eleq1d)
      have S29: "A⋅y ∈ ℕ ∧ A ∈ ℕ ⟶ A⋅y \<ca> A ∈ ℕ" by (rule MMI_nnaddclt)
      from S29 have S30: "A ∈ ℕ ∧ A⋅y ∈ ℕ ⟶ A⋅y \<ca> A ∈ ℕ" by (rule MMI_ancoms)
      from S28 S30 have S31: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
	A ∈ ℕ ∧ A⋅y ∈ ℕ ⟶ 
	A⋅(y \<ca> 𝟭) ∈ ℕ" by (rule MMI_syl5bir)
      from S31 have S32: "A ∈ ℕ ⟶ 
	y ∈ ℕ ⟶ 
	A ∈ ℕ ⟶ 
	A⋅y ∈ ℕ ⟶ 
	A⋅(y \<ca> 𝟭) ∈ ℕ" by (rule MMI_exp4b)
      from S32 have S33: "y ∈ ℕ ⟶ 
	A ∈ ℕ ⟶ 
	A⋅y ∈ ℕ ⟶ 
	A⋅(y \<ca> 𝟭) ∈ ℕ" by (rule MMI_pm2_43b)
      from S33 have "y ∈ ℕ ⟶ 
	(A ∈ ℕ ⟶ A⋅y ∈ ℕ) ⟶   A ∈ ℕ ⟶  A⋅(y \<ca> 𝟭) ∈ ℕ" by (rule MMI_a2d)
    } then have S34: "∀ y. y ∈ ℕ ⟶ 
	(A ∈ ℕ ⟶ A⋅y ∈ ℕ) ⟶   A ∈ ℕ ⟶  A⋅(y \<ca> 𝟭) ∈ ℕ"
      by simp
    from S3 S6 S9 S12 S17 S34 have S35: "B ∈ ℕ ⟶ 
      A ∈ ℕ ⟶ A⋅B ∈ ℕ" by (rule MMI_nnind)
   from S35 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ A⋅B ∈ ℕ" by (rule MMI_impcom)
qed

lemma (in MMIsar0) MMI_nn2get: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)"
proof -
   have S1: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<lsq> B ∨ B \<lsq> A" by (rule MMI_letrit)
   have S2: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S3: "B ∈ ℕ ⟶ B ∈ ℝ" by (rule MMI_nnret)
   from S1 S2 S3 have S4: "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<lsq> B ∨ B \<lsq> A" by (rule MMI_syl2an)
   from S3 have S5: "B ∈ ℕ ⟶ B ∈ ℝ" .
   have S6: "B ∈ ℝ ⟶ B \<lsq> B" by (rule MMI_leidt)
   from S6 have S7: "B ∈ ℝ ⟶ 
   A \<lsq> B ⟷ A \<lsq> B ∧ B \<lsq> B" by (rule MMI_biantrud)
   from S7 have S8: "B ∈ ℝ ⟶ 
   A \<lsq> B ⟶ A \<lsq> B ∧ B \<lsq> B" by (rule MMI_biimpd)
   from S5 S8 have S9: "B ∈ ℕ ⟶ 
   A \<lsq> B ⟶ A \<lsq> B ∧ B \<lsq> B" by (rule MMI_syl)
   from S9 have S10: "B ∈ ℕ ⟶ 
   A \<lsq> B ⟶ 
   B ∈ ℕ ∧ A \<lsq> B ∧ B \<lsq> B" by (rule MMI_anc2li)
   have S11: "x = B ⟶ 
   A \<lsq> x ⟷ A \<lsq> B" by (rule MMI_breq2)
   have S12: "x = B ⟶ 
   B \<lsq> x ⟷ B \<lsq> B" by (rule MMI_breq2)
   from S11 S12 have S13: "x = B ⟶ 
   A \<lsq> x ∧ B \<lsq> x ⟷ A \<lsq> B ∧ B \<lsq> B" by (rule MMI_anbi12d)
   from S13 have S14: "B ∈ ℕ ∧ A \<lsq> B ∧ B \<lsq> B ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by auto (*by (rule MMI_rcla4ev)*)
   from S10 S14 have S15: "B ∈ ℕ ⟶ 
   A \<lsq> B ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by (rule MMI_syl6)
   from S15 have S16: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<lsq> B ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by (rule MMI_adantl)
   from S2 have S17: "A ∈ ℕ ⟶ A ∈ ℝ" .
   have S18: "A ∈ ℝ ⟶ A \<lsq> A" by (rule MMI_leidt)
   from S18 have S19: "A ∈ ℝ ⟶ 
   B \<lsq> A ⟷ A \<lsq> A ∧ B \<lsq> A" by (rule MMI_biantrurd)
   from S19 have S20: "A ∈ ℝ ⟶ 
   B \<lsq> A ⟶ A \<lsq> A ∧ B \<lsq> A" by (rule MMI_biimpd)
   from S17 S20 have S21: "A ∈ ℕ ⟶ 
   B \<lsq> A ⟶ A \<lsq> A ∧ B \<lsq> A" by (rule MMI_syl)
   from S21 have S22: "A ∈ ℕ ⟶ 
   B \<lsq> A ⟶ 
   A ∈ ℕ ∧ A \<lsq> A ∧ B \<lsq> A" by (rule MMI_anc2li)
   have S23: "x = A ⟶ 
   A \<lsq> x ⟷ A \<lsq> A" by (rule MMI_breq2)
   have S24: "x = A ⟶ 
   B \<lsq> x ⟷ B \<lsq> A" by (rule MMI_breq2)
   from S23 S24 have S25: "x = A ⟶ 
   A \<lsq> x ∧ B \<lsq> x ⟷ A \<lsq> A ∧ B \<lsq> A" by (rule MMI_anbi12d)
   from S25 have S26: "A ∈ ℕ ∧ A \<lsq> A ∧ B \<lsq> A ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by auto (*(rule MMI_rcla4ev)*)
   from S22 S26 have S27: "A ∈ ℕ ⟶ 
   B \<lsq> A ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by (rule MMI_syl6)
   from S27 have S28: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   B \<lsq> A ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by (rule MMI_adantr)
   from S16 S28 have S29: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<lsq> B ∨ B \<lsq> A ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by (rule MMI_jaod)
   from S4 S29 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   ( ∃x∈ℕ. A \<lsq> x ∧ B \<lsq> x)" by (rule MMI_mpd)
qed

lemma (in MMIsar0) MMI_nnge1t: 
   shows "A ∈ ℕ ⟶ 𝟭 \<lsq> A"
proof -
  {fix x
    have "x = 𝟭 ⟶ 
      𝟭 \<lsq> x ⟷ 𝟭 \<lsq> 𝟭" by (rule MMI_breq2)
  } then have S1: "∀ x. x = 𝟭 ⟶  𝟭 \<lsq> x ⟷ 𝟭 \<lsq> 𝟭"
    by simp
  { fix x y
    have "x = y ⟶ 
      𝟭 \<lsq> x ⟷ 𝟭 \<lsq> y" by (rule MMI_breq2)
  } then have S2: "∀x y.  x = y ⟶ 𝟭 \<lsq> x ⟷ 𝟭 \<lsq> y"
    by simp
  { fix x y
    have "x = y \<ca> 𝟭 ⟶ 
      𝟭 \<lsq> x ⟷ 𝟭 \<lsq> y \<ca> 𝟭" by (rule MMI_breq2)
  } then have S3: 
      "∀x y. x = y \<ca> 𝟭 ⟶ 𝟭 \<lsq> x ⟷ 𝟭 \<lsq> y \<ca> 𝟭"
    by simp
  { fix x
    have "x = A ⟶ 
      𝟭 \<lsq> x ⟷ 𝟭 \<lsq> A" by (rule MMI_breq2)
  } then have S4: "∀ x. x = A ⟶ 𝟭 \<lsq> x ⟷ 𝟭 \<lsq> A"
    by simp
   have S5: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S5 have S6: "𝟭 \<lsq> 𝟭" by (rule MMI_leid)
   { fix y
     have S7: "y ∈ ℕ ⟶ y ∈ ℝ" by (rule MMI_nnret)
     have S8: "y ∈ ℝ ⟶ y ∈ ℂ" by (rule MMI_recnt)
     have S9: "y ∈ ℂ ⟶ y \<ca> 𝟬 = y" by (rule MMI_ax0id)
     from S8 S9 have S10: "y ∈ ℝ ⟶ y \<ca> 𝟬 = y" by (rule MMI_syl)
     from S10 have S11: "y ∈ ℝ ⟶ 
       𝟭 \<lsq> y \<ca> 𝟬 ⟷ 𝟭 \<lsq> y" by (rule MMI_breq2d)
     have S12: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
     have S13: "𝟬 ∈ ℝ" by (rule MMI_0re)
     have S14: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
     have S15: "𝟬 ∈ ℝ ∧ 𝟭 ∈ ℝ ∧ y ∈ ℝ ⟶ 
       𝟬 \<ls> 𝟭 ⟶ 
       y \<ca> 𝟬 \<ls> y \<ca> 𝟭" by (rule MMI_axltadd)
     from S13 S14 S15 have S16: "y ∈ ℝ ⟶ 
       𝟬 \<ls> 𝟭 ⟶ 
       y \<ca> 𝟬 \<ls> y \<ca> 𝟭" by (rule MMI_mp3an12)
     from S12 S16 have S17: "y ∈ ℝ ⟶ 
       y \<ca> 𝟬 \<ls> y \<ca> 𝟭" by (rule MMI_mpi)
     have S18: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
     have S19: "y \<ca> 𝟬 ∈ ℝ ∧ y \<ca> 𝟭 ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       y \<ca> 𝟬 \<ls> y \<ca> 𝟭 ∧ y \<ca> 𝟭 \<ls> 𝟭 ⟶ y \<ca> 𝟬 \<ls> 𝟭" by (rule MMI_axlttrn)
     from S18 S19 have S20: "y \<ca> 𝟬 ∈ ℝ ∧ y \<ca> 𝟭 ∈ ℝ ⟶ 
       y \<ca> 𝟬 \<ls> y \<ca> 𝟭 ∧ y \<ca> 𝟭 \<ls> 𝟭 ⟶ y \<ca> 𝟬 \<ls> 𝟭" by (rule MMI_mp3an3)
     have S21: "𝟬 ∈ ℝ" by (rule MMI_0re)
     have S22: "y ∈ ℝ ∧ 𝟬 ∈ ℝ ⟶ y \<ca> 𝟬 ∈ ℝ" by (rule MMI_axaddrcl)
     from S21 S22 have S23: "y ∈ ℝ ⟶ y \<ca> 𝟬 ∈ ℝ" by (rule MMI_mpan2)
     have S24: "y ∈ ℝ ⟶ y \<ca> 𝟭 ∈ ℝ" by (rule MMI_peano2re)
     from S20 S23 S24 have S25: "y ∈ ℝ ⟶ 
       y \<ca> 𝟬 \<ls> y \<ca> 𝟭 ∧ y \<ca> 𝟭 \<ls> 𝟭 ⟶ y \<ca> 𝟬 \<ls> 𝟭" by (rule MMI_sylanc)
     from S17 S25 have S26: "y ∈ ℝ ⟶ 
       y \<ca> 𝟭 \<ls> 𝟭 ⟶ y \<ca> 𝟬 \<ls> 𝟭" by (rule MMI_mpand)
     from S26 have S27: "y ∈ ℝ ⟶ 
       ¬(y \<ca> 𝟬 \<ls> 𝟭) ⟶ 
       ¬(y \<ca> 𝟭 \<ls> 𝟭)" by (rule MMI_con3d)
     from S23 have S28: "y ∈ ℝ ⟶ y \<ca> 𝟬 ∈ ℝ" .
     have S29: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
     from S28 S29 have S30: "y ∈ ℝ ⟶ 
       𝟭 ∈ ℝ ∧ y \<ca> 𝟬 ∈ ℝ" by (rule MMI_jctil)
     have S31: "𝟭 ∈ ℝ ∧ y \<ca> 𝟬 ∈ ℝ ⟶ 
       𝟭 \<lsq> y \<ca> 𝟬 ⟷ 
       ¬(y \<ca> 𝟬 \<ls> 𝟭)" by (rule MMI_lenltt)
     from S30 S31 have S32: "y ∈ ℝ ⟶ 
       𝟭 \<lsq> y \<ca> 𝟬 ⟷ 
       ¬(y \<ca> 𝟬 \<ls> 𝟭)" by (rule MMI_syl)
     from S24 have S33: "y ∈ ℝ ⟶ y \<ca> 𝟭 ∈ ℝ" .
     have S34: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
     from S33 S34 have S35: "y ∈ ℝ ⟶ 
       𝟭 ∈ ℝ ∧ y \<ca> 𝟭 ∈ ℝ" by (rule MMI_jctil)
     have S36: "𝟭 ∈ ℝ ∧ y \<ca> 𝟭 ∈ ℝ ⟶ 
       𝟭 \<lsq> y \<ca> 𝟭 ⟷ 
       ¬(y \<ca> 𝟭 \<ls> 𝟭)" by (rule MMI_lenltt)
     from S35 S36 have S37: "y ∈ ℝ ⟶ 
       𝟭 \<lsq> y \<ca> 𝟭 ⟷ 
       ¬(y \<ca> 𝟭 \<ls> 𝟭)" by (rule MMI_syl)
     from S27 S32 S37 have S38: "y ∈ ℝ ⟶ 
       𝟭 \<lsq> y \<ca> 𝟬 ⟶ 𝟭 \<lsq> y \<ca> 𝟭" by (rule MMI_3imtr4d)
     from S11 S38 have S39: "y ∈ ℝ ⟶ 
       𝟭 \<lsq> y ⟶ 𝟭 \<lsq> y \<ca> 𝟭" by (rule MMI_sylbird)
     from S7 S39 have S40: "y ∈ ℕ ⟶ 
       𝟭 \<lsq> y ⟶ 𝟭 \<lsq> y \<ca> 𝟭" by (rule MMI_syl)
   } then have S40: "∀y. y ∈ ℕ ⟶ 𝟭 \<lsq> y ⟶ 𝟭 \<lsq> y \<ca> 𝟭"
     by simp
   from S1 S2 S3 S4 S6 S40 show "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnind)
 qed

lemma (in MMIsar0) MMI_nngt1ne1t: 
   shows "A ∈ ℕ ⟶ 
   𝟭 \<ls> A ⟷ ¬(A = 𝟭)"
proof -
   have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S2: "𝟭 ∈ ℝ ∧ A ∈ ℝ ∧ 𝟭 \<lsq> A ⟶ 
   𝟭 \<ls> A ⟷ ¬(𝟭 = A)" by (rule MMI_leltnet)
   from S1 S2 have S3: "A ∈ ℝ ∧ 𝟭 \<lsq> A ⟶ 
   𝟭 \<ls> A ⟷ ¬(𝟭 = A)" by (rule MMI_mp3an1)
   have S4: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S5: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   from S3 S4 S5 have S6: "A ∈ ℕ ⟶ 
   𝟭 \<ls> A ⟷ ¬(𝟭 = A)" by (rule MMI_sylanc)
   have S7: "𝟭 = A ⟷ A = 𝟭" by (rule MMI_eqcom)
   from S7 have S8: "¬(𝟭 = A) ⟷ ¬(A = 𝟭)" by (rule MMI_negbii)
   from S6 S8 show "A ∈ ℕ ⟶ 
   𝟭 \<ls> A ⟷ ¬(A = 𝟭)" by (rule MMI_syl6bb)
qed

lemma (in MMIsar0) MMI_nnle1eq1t: 
   shows "A ∈ ℕ ⟶ 
   A \<lsq> 𝟭 ⟷ A = 𝟭"
proof -
   have S1: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   from S1 have S2: "A ∈ ℕ ⟶ 
   A \<lsq> 𝟭 ⟷ 
   A \<lsq> 𝟭 ∧ 𝟭 \<lsq> A" by (rule MMI_biantrud)
   have S3: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S4: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S5: "A ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
   A = 𝟭 ⟷ 
   A \<lsq> 𝟭 ∧ 𝟭 \<lsq> A" by (rule MMI_letri3t)
   from S4 S5 have S6: "A ∈ ℝ ⟶ 
   A = 𝟭 ⟷ 
   A \<lsq> 𝟭 ∧ 𝟭 \<lsq> A" by (rule MMI_mpan2)
   from S3 S6 have S7: "A ∈ ℕ ⟶ 
   A = 𝟭 ⟷ 
   A \<lsq> 𝟭 ∧ 𝟭 \<lsq> A" by (rule MMI_syl)
   from S2 S7 show "A ∈ ℕ ⟶ 
   A \<lsq> 𝟭 ⟷ A = 𝟭" by (rule MMI_bitr4d)
qed

lemma (in MMIsar0) MMI_nngt0t: 
   shows "A ∈ ℕ ⟶ 𝟬 \<ls> A"
proof -
   have S1: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   have S2: "𝟬 ∈ ℝ" by (rule MMI_0re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S4: "𝟬 ∈ ℝ ∧ 𝟭 ∈ ℝ ∧ A ∈ ℝ ⟶ 
   𝟬 \<ls> 𝟭 ∧ 𝟭 \<lsq> A ⟶ 𝟬 \<ls> A" by (rule MMI_ltletrt)
   from S2 S3 S4 have S5: "A ∈ ℝ ⟶ 
   𝟬 \<ls> 𝟭 ∧ 𝟭 \<lsq> A ⟶ 𝟬 \<ls> A" by (rule MMI_mp3an12)
   from S1 S5 have S6: "A ∈ ℝ ⟶ 
   𝟭 \<lsq> A ⟶ 𝟬 \<ls> A" by (rule MMI_mpani)
   have S7: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S8: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   from S6 S7 S8 show "A ∈ ℕ ⟶ 𝟬 \<ls> A" by (rule MMI_sylc)
qed

lemma (in MMIsar0) MMI_lt1nnn: 
   shows "A ∈ ℝ ∧ A \<ls> 𝟭 ⟶ ¬(A ∈ ℕ)"
proof -
   have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S2: "A ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
   A \<ls> 𝟭 ⟷ ¬(𝟭 \<lsq> A)" by (rule MMI_ltnlet)
   from S1 S2 have S3: "A ∈ ℝ ⟶ 
   A \<ls> 𝟭 ⟷ ¬(𝟭 \<lsq> A)" by (rule MMI_mpan2)
   have S4: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   from S4 have S5: "¬(𝟭 \<lsq> A) ⟶ ¬(A ∈ ℕ)" by (rule MMI_con3i)
   from S3 S5 have S6: "A ∈ ℝ ⟶ 
   A \<ls> 𝟭 ⟶ ¬(A ∈ ℕ)" by (rule MMI_syl6bi)
   from S6 show "A ∈ ℝ ∧ A \<ls> 𝟭 ⟶ ¬(A ∈ ℕ)" by (rule MMI_imp)
qed

(*********** 511-515****************************)

lemma (in MMIsar0) MMI_0nnn: 
   shows "¬(𝟬 ∈ ℕ)"
proof -
   have S1: "𝟬 ∈ ℝ" by (rule MMI_0re)
   have S2: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   have S3: "𝟬 ∈ ℝ ∧ 𝟬 \<ls> 𝟭 ⟶ ¬(𝟬 ∈ ℕ)" by (rule MMI_lt1nnn)
   from S1 S2 S3 show "¬(𝟬 ∈ ℕ)" by (rule MMI_mp2an)
qed

lemma (in MMIsar0) MMI_nnne0t: 
   shows "A ∈ ℕ ⟶ A ≠ 𝟬"
proof -
   have S1: "¬(𝟬 ∈ ℕ)" by (rule MMI_0nnn)
   have S2: "A = 𝟬 ⟶ 
   A ∈ ℕ ⟷ 𝟬 ∈ ℕ" by (rule MMI_eleq1)
   from S1 S2 have S3: "A = 𝟬 ⟶ ¬(A ∈ ℕ)" by (rule MMI_mtbiri)
   from S3 have S4: "A ∈ ℕ ⟶ ¬(A = 𝟬)" by (rule MMI_con2i)
   have S5: "A ≠ 𝟬 ⟷ ¬(A = 𝟬)" by (rule MMI_df_ne)
   from S4 S5 show "A ∈ ℕ ⟶ A ≠ 𝟬" by (rule MMI_sylibr)
qed

lemma (in MMIsar0) MMI_nngt0: assumes A1: "A ∈ ℕ"   
   shows "𝟬 \<ls> A"
proof -
   from A1 have S1: "A ∈ ℕ".
   have S2: "A ∈ ℕ ⟶ 𝟬 \<ls> A" by (rule MMI_nngt0t)
   from S1 S2 show "𝟬 \<ls> A" by (rule MMI_ax_mp)
qed

lemma (in MMIsar0) MMI_nnne0: assumes A1: "A ∈ ℕ"   
   shows "A ≠ 𝟬"
proof -
   from A1 have S1: "A ∈ ℕ".
   from S1 have S2: "A ∈ ℝ" by (rule MMI_nnre)
   from A1 have S3: "A ∈ ℕ".
   from S3 have S4: "𝟬 \<ls> A" by (rule MMI_nngt0)
   from S2 S4 show "A ≠ 𝟬" by (rule MMI_gt0ne0i)
qed

lemma (in MMIsar0) MMI_nnrecgt0t: 
   shows "A ∈ ℕ ⟶ 𝟬 \<ls> 𝟭\<cdiv>A"
proof -
   have S1: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   have S2: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   have S3: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S4: "𝟬 ∈ ℝ" by (rule MMI_0re)
   have S5: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S6: "𝟬 ∈ ℝ ∧ 𝟭 ∈ ℝ ∧ A ∈ ℝ ⟶ 
   𝟬 \<ls> 𝟭 ∧ 𝟭 \<lsq> A ⟶ 𝟬 \<ls> A" by (rule MMI_ltletrt)
   from S4 S5 S6 have S7: "A ∈ ℝ ⟶ 
   𝟬 \<ls> 𝟭 ∧ 𝟭 \<lsq> A ⟶ 𝟬 \<ls> A" by (rule MMI_mp3an12)
   have S8: "A ∈ ℝ ∧ 𝟬 \<ls> A ⟶ 𝟬 \<ls> 𝟭\<cdiv>A" by (rule MMI_recgt0t)
   from S8 have S9: "A ∈ ℝ ⟶ 
   𝟬 \<ls> A ⟶ 𝟬 \<ls> 𝟭\<cdiv>A" by (rule MMI_ex)
   from S7 S9 have S10: "A ∈ ℝ ⟶ 
   𝟬 \<ls> 𝟭 ∧ 𝟭 \<lsq> A ⟶ 𝟬 \<ls> 𝟭\<cdiv>A" by (rule MMI_syld)
   from S3 S10 have S11: "A ∈ ℕ ⟶ 
   𝟬 \<ls> 𝟭 ∧ 𝟭 \<lsq> A ⟶ 𝟬 \<ls> 𝟭\<cdiv>A" by (rule MMI_syl)
   from S2 S11 have S12: "A ∈ ℕ ⟶ 
   𝟭 \<lsq> A ⟶ 𝟬 \<ls> 𝟭\<cdiv>A" by (rule MMI_mpani)
   from S1 S12 show "A ∈ ℕ ⟶ 𝟬 \<ls> 𝟭\<cdiv>A" by (rule MMI_mpd)
qed

text‹I am unable to translate the proof of Metamath's nnleltp1. Isabelle 
  chokes on a comlicated application of nn1suc. A couple of theorems below
  are proven by hand in Isabelle to wokaround this. 
  In the next theorem we show that $a < a+1$.›

lemma (in MMIsar0) num_le_numplus1: assumes "a∈ℝ"
  shows "a \<ls> a\<ca>𝟭"
  using assms MMI_ax1re MMI_lt01 MMI_ltaddpos
  by simp

text‹The next theorem
  shows that of $a\leq b$, then $a< b+1$.›

lemma (in MMIsar0) lsq_imp_ls_plus1: 
  assumes A1: "a∈ℝ"   "b∈ℝ" and A3: "a\<lsq>b"
  shows "a \<ls> b\<ca>𝟭"
proof -
  from A1 have "b \<ls> b\<ca>𝟭" using num_le_numplus1 by simp
  with A1 A3 show "a \<ls> b\<ca>𝟭" using MMI_ax1re MMI_axaddrcl MMI_lelttr
    by blast
qed

text‹There are no natural numbers between $1$ and $2$.›

lemma (in MMIsar0) no_nat_between12: 
  assumes A1: "n ∈ ℕ"
  shows "n \<ls> 𝟭\<ca>𝟭 ⟶ n \<lsq> 𝟭"
proof -
  have "𝟭 \<ls> 𝟭\<ca>𝟭 ⟶ 𝟭 \<lsq> 𝟭" 
    using MMI_1nn MMI_nnge1t by simp
  moreover
  { fix k assume A2: "k∈ℕ"
    { assume A3: "k\<ca>𝟭 \<ls> 𝟭\<ca>𝟭"
      from A2 MMI_ax1re have T: "k ∈ ℝ"  "𝟭 ∈ ℝ" 
	using MMI_nnre by auto
      with A3 have "k \<ls> 𝟭" using MMI_ltadd1 by blast
      with T A2 have False using MMI_lt1nnn by simp
    } then have "¬(k\<ca>𝟭 \<ls> 𝟭\<ca>𝟭)" by auto
    hence
      "(k \<ls> 𝟭\<ca>𝟭 ⟶ k \<lsq> 𝟭) ⟶ (k\<ca>𝟭 \<ls> 𝟭\<ca>𝟭 ⟶ k \<ca> 𝟭 \<lsq> 𝟭)"
      by simp
  } then have "∀k∈ℕ. 
      (k \<ls> 𝟭\<ca>𝟭 ⟶ k \<lsq> 𝟭) ⟶ (k\<ca>𝟭 \<ls> 𝟭\<ca>𝟭 ⟶ k \<ca> 𝟭 \<lsq> 𝟭)"
    by simp
  moreover note A1
  ultimately show "n \<ls> 𝟭\<ca>𝟭 ⟶ n \<lsq> 𝟭"
    by (rule nnind1)
qed

text‹Natural number greater than $1$ has a predecessor.›

lemma (in MMIsar0) nat_ge1_has_pred: assumes A1: "n ∈ ℕ"
  shows "𝟭 \<ls> n ⟶ (∃j∈ℕ. n = j\<ca>𝟭)"
proof -
  from MMI_ax1re have "¬(𝟭\<ls>𝟭)" using MMI_ltnr by simp
  then have "𝟭 \<ls> 𝟭 ⟶ (∃j∈ℕ. 𝟭 = j\<ca>𝟭)" by simp
  moreover
  { fix k assume A2: "k∈ℕ" and A3: "𝟭 \<ls> k ⟶ (∃j∈ℕ. k = j\<ca>𝟭)" and
    A4: "𝟭 \<ls> k\<ca>𝟭"
    from A2 have "k=𝟭 ∨ 𝟭\<ls>k" using MMI_nngt1ne1t by simp
    moreover
    { assume "k=𝟭"
      then have "𝟭∈ℕ" and "k\<ca>𝟭 = 𝟭\<ca>𝟭"
	using MMI_1nn by auto
      hence "∃i∈ℕ. k\<ca>𝟭 = i\<ca>𝟭" by auto }
    moreover
    { assume "𝟭 \<ls> k"
      with A3 obtain j where "j∈ℕ" and "k = j\<ca>𝟭"
	by auto
      then have "j\<ca>𝟭 ∈ ℕ" and "k\<ca>𝟭 = j\<ca>𝟭\<ca>𝟭"
	using MMI_peano2nn by auto
      then have "∃i∈ℕ. k\<ca>𝟭 = i\<ca>𝟭" by auto }
    ultimately have "∃i∈ℕ. k\<ca>𝟭 = i\<ca>𝟭" by auto
  } then have "∀k∈ℕ. 
      (𝟭 \<ls> k ⟶ (∃j∈ℕ. k = j\<ca>𝟭)) ⟶ (𝟭 \<ls> k\<ca>𝟭 ⟶ (∃i∈ℕ. k\<ca>𝟭 = i\<ca>𝟭))"
    by auto
  moreover note A1
  ultimately show "𝟭 \<ls> n ⟶ (∃j∈ℕ. n = j\<ca>𝟭)"
    by (rule nnind1)
qed

text‹If the successor is smaller, then the number is smaller.›

lemma (in MMIsar0) succ_le_imp_le: assumes A1: "a∈ℝ"   "b∈ℝ" and A2: "a\<ca>𝟭 \<ls> b"
  shows "a\<ls>b"
proof -
  from A1 have T: "a∈ℝ"  "a\<ca>𝟭 ∈ ℝ"  "b∈ℝ"
    using MMI_ax1re MMI_axaddrcl by auto
  moreover from A1 A2 have 
    "a \<ls> a\<ca>𝟭"   "a\<ca>𝟭 \<ls> b"
    using num_le_numplus1 by auto
  ultimately show "a\<ls>b" using MMI_axlttrn by blast
qed
    
text‹For natural numbers greater numbers can be obtained by adding a natural number.›

lemma (in MMIsar0) nat_ge_repr: assumes A1: "n ∈ ℕ"  "m ∈ ℕ"
  shows "m\<ls>n ⟶ (∃j∈ℕ. n = m \<ca> j)"
proof -
  { assume "𝟭 \<ls> n"
    with A1 obtain k where I: "k∈ℕ" and II: "n = k\<ca>𝟭"
      using nat_ge1_has_pred by auto
    with MMI_axaddcom MMI_ax1re MMI_axresscn have "k ∈ ℂ" and "𝟭 ∈ ℂ"
      using MMI_nncn by auto
    with MMI_axaddcom I II have "∃k∈ℕ. n = 𝟭 \<ca> k"
      by auto
  } then have "𝟭 \<ls> n ⟶ (∃j∈ℕ. n = 𝟭 \<ca> j)" by simp
  moreover
  { fix k assume A2: "k∈ℕ" and 
    A3: "k\<ls>n ⟶ (∃j∈ℕ. n = k \<ca> j)" and A4: "k\<ca>𝟭 \<ls> n"
    from A1 A2 have T: "n∈ℝ"  "k∈ℝ" using MMI_nnre by auto
    with A3 A4 obtain j where III: "j∈ℕ" and IV: "n = k \<ca> j"
      using succ_le_imp_le by auto
    with A4 T III MMI_ax1re have "𝟭 \<ls> j"
      using MMI_nnre MMI_ltadd2 by blast
    with III obtain i where V: "i∈ℕ" and VI: "j = i\<ca>𝟭"
      using nat_ge1_has_pred by auto
    with IV have "n = k \<ca> (i\<ca>𝟭)" by simp
    moreover from V MMI_ax1re MMI_axresscn MMI_axaddcom have  
      "k \<ca> (i\<ca>𝟭) = k \<ca> (𝟭\<ca>i)"
      using MMI_nncn by auto
    moreover from T V MMI_ax1re MMI_axresscn MMI_axaddass have
      "k \<ca> 𝟭\<ca>i = k \<ca> (𝟭\<ca>i)"
      using MMI_nncn by blast
    ultimately have "n = k \<ca> 𝟭\<ca>i" by simp
    with V have "∃i∈ℕ. n = k\<ca>𝟭 \<ca> i" by auto
  } then have "∀k∈ℕ. (k\<ls>n ⟶ (∃j∈ℕ. n = k \<ca> j)) ⟶ 
      (k\<ca>𝟭 \<ls> n ⟶ (∃i∈ℕ. n = k\<ca>𝟭 \<ca> i))" by simp
  moreover from A1 have "m ∈ ℕ" by simp
  ultimately show "m\<ls>n ⟶ (∃j∈ℕ. n = m \<ca> j)"
    by (rule nnind1)
qed
  
text‹In natural numbers less $a+1$ implies less or equal $a$.›

lemma (in MMIsar0) nat_ls_plus_one_imp_lsq:
  assumes A1: "n ∈ ℕ"  "m ∈ ℕ" and A2: "n \<ls> m\<ca>𝟭" 
  shows "n \<lsq> m"
proof -
  from MMI_1cn A1 have T: "m ∈ ℂ"  "n ∈ ℂ"  "𝟭 ∈ ℂ" 
    using MMI_nncn by auto
  from A1 have "m\<ca>𝟭 ∈ ℕ" using MMI_peano2nn by simp
  with A1 A2 obtain k where I: "k∈ℕ" and II: "m\<ca>𝟭 = n\<ca>k"
    using nat_ge_repr by auto
  then have "k = 𝟭 ∨ 𝟭\<ls>k" using MMI_nngt1ne1t by auto
  moreover
  { assume "k=𝟭"
    with II T have "m = n" using MMI_addcan2 by simp }
  moreover
  { assume "𝟭\<ls>k"
    with I obtain i where III: "i∈ℕ" and IV: "k = i\<ca>𝟭"
      using nat_ge1_has_pred by auto
    with A1 II III have "m\<ca>𝟭 = n\<ca>i \<ca> 𝟭"
      using MMI_nncn MMI_1cn MMI_axaddass by simp
    with MMI_axaddcl T III have "m = n\<ca>i" using MMI_nncn MMI_addcan2
      by auto
    moreover from A1 III have "n∈ℝ"  "i∈ℝ"   "𝟬 \<ls> i"
      using MMI_nnre MMI_nngt0t by auto
    ultimately have "n \<ls> m" using MMI_ltaddpost by auto }
  ultimately have "n=m ∨ n \<ls> m" by auto
  with A1 show "n \<lsq> m" using MMI_nnre MMI_leloet by auto
qed

(********* 516 - 520 *************************)
 
text‹The next theorem is the reason we proved the theorems above 
  (see the comment to ‹num_le_numplus1›.›

lemma (in MMIsar0) MMI_nnleltp1t: 
  shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<lsq> B ⟷ A \<ls> B \<ca> 𝟭"
proof
  assume A1: "A ∈ ℕ ∧ B ∈ ℕ"
  then have "A \<lsq> B ⟶ A \<ls> B \<ca> 𝟭" 
    using MMI_nnre lsq_imp_ls_plus1 by simp
  moreover from A1 have "A \<ls> B \<ca> 𝟭 ⟶ A \<lsq> B"
    using nat_ls_plus_one_imp_lsq by simp
  ultimately show  "A \<lsq> B ⟷ A \<ls> B \<ca> 𝟭"
    by blast
qed

(* here is the original almost translated proof of nnleltp1t:

proof -
   have S1: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<lsq> B ⟷ A \<ls> B ∨ A = B" by (rule MMI_leloet)
   have S2: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S3: "B ∈ ℕ ⟶ B ∈ ℝ" by (rule MMI_nnret)
   from S1 S2 S3 have S4: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<lsq> B ⟷ A \<ls> B ∨ A = B" by (rule MMI_syl2an)
   have S5: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   have S6: "𝟬 ∈ ℝ" by (rule MMI_0re)
   have S7: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S6 S7 have S8: "𝟬 ∈ ℝ ∧ 𝟭 ∈ ℝ" by (rule MMI_pm3_2i)
   have S9: "(A ∈ ℝ ∧ 𝟬 ∈ ℝ) ∧ B ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
   A \<ls> B ∧ 𝟬 \<ls> 𝟭 ⟶ 
   A \<ca> 𝟬 \<ls> B \<ca> 𝟭" by (rule MMI_lt2addt)
   from S9 have S10: "(A ∈ ℝ ∧ B ∈ ℝ) ∧ 𝟬 ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
   A \<ls> B ∧ 𝟬 \<ls> 𝟭 ⟶ 
   A \<ca> 𝟬 \<ls> B \<ca> 𝟭" by (rule MMI_an4s)
   from S8 S10 have S11: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ∧ 𝟬 \<ls> 𝟭 ⟶ 
   A \<ca> 𝟬 \<ls> B \<ca> 𝟭" by (rule MMI_mpan2)
   from S5 S11 have S12: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ⟶ 
   A \<ca> 𝟬 \<ls> B \<ca> 𝟭" by (rule MMI_mpan2i)
   have S13: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A ∈ ℝ" by (rule MMI_pm3_26)
   have S14: "A ∈ ℝ ⟶ A ∈ ℂ" by (rule MMI_recnt)
   have S15: "A ∈ ℂ ⟶ A \<ca> 𝟬 = A" by (rule MMI_ax0id)
   from S13 S14 S15 have S16: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<ca> 𝟬 = A" by (rule MMI_3syl)
   from S16 have S17: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ca> 𝟬 \<ls> B \<ca> 𝟭 ⟷ A \<ls> B \<ca> 𝟭" by (rule MMI_breq1d)
   from S12 S17 have S18: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ⟶ A \<ls> B \<ca> 𝟭" by (rule MMI_sylibd)
   have S19: "A = B ⟶ 
   A \<ls> B \<ca> 𝟭 ⟷ B \<ls> B \<ca> 𝟭" by (rule MMI_breq1)
   have S20: "B ∈ ℝ ⟶ B \<ls> B \<ca> 𝟭" by (rule MMI_ltp1t)
   from S19 S20 have S21: "A = B ⟶ 
   B ∈ ℝ ⟶ A \<ls> B \<ca> 𝟭" by (rule MMI_syl5bir)
   from S21 have S22: "B ∈ ℝ ⟶ 
   A = B ⟶ A \<ls> B \<ca> 𝟭" by (rule MMI_com12)
   from S22 have S23: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A = B ⟶ A \<ls> B \<ca> 𝟭" by (rule MMI_adantl)
   from S18 S23 have S24: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ∨ A = B ⟶ A \<ls> B \<ca> 𝟭" by (rule MMI_jaod)
   from S2 have S25: "A ∈ ℕ ⟶ A ∈ ℝ" .
   from S3 have S26: "B ∈ ℕ ⟶ B ∈ ℝ" .
   from S24 S25 S26 have S27: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ∨ A = B ⟶ A \<ls> B \<ca> 𝟭" by (rule MMI_syl2an)
   { fix z
     have S28: "z = A ⟶ 
       z \<ls> B \<ca> 𝟭 ⟷ A \<ls> B \<ca> 𝟭" by (rule MMI_breq1)
     have S29: "z = A ⟶ 
       z \<ls> B ⟷ A \<ls> B" by (rule MMI_breq1)
     have S30: "z = A ⟶ 
       z = B ⟷ A = B" by (rule MMI_eqeq1)
     from S29 S30 have S31: "z = A ⟶ 
       z \<ls> B ∨ z = B ⟷ A \<ls> B ∨ A = B" by (rule MMI_orbi12d)
     from S28 S31 have S32: "z = A ⟶ 
       (z \<ls> B \<ca> 𝟭 ⟶ z \<ls> B ∨ z = B) ⟷ 
       (A \<ls> B \<ca> 𝟭 ⟶ A \<ls> B ∨ A = B)" by (rule MMI_imbi12d)
     from S32 have S33: "A ∈ ℕ ⟶ 
       (∀z∈ℕ. z \<ls> B \<ca> 𝟭 ⟶ z \<ls> B ∨ z = B) ⟶ 
       A \<ls> B \<ca> 𝟭 ⟶ A \<ls> B ∨ A = B" by auto; (rule MMI_rcla4v)
     { fix x
       have S34: "x = 𝟭 ⟶ 
	 x \<ca> 𝟭 = 𝟭 \<ca> 𝟭" by (rule MMI_opreq1)
       from S34 have S35: "x = 𝟭 ⟶ 
	 z \<ls> x \<ca> 𝟭 ⟷ z \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_breq2d)
       have S36: "x = 𝟭 ⟶ 
	 z \<ls> x ⟷ z \<ls> 𝟭" by (rule MMI_breq2)
       have S37: "x = 𝟭 ⟶ 
	 z = x ⟷ z = 𝟭" by (rule MMI_eqeq2)
       from S36 S37 have S38: "x = 𝟭 ⟶ 
	 z \<ls> x ∨ z = x ⟷ 
	 z \<ls> 𝟭 ∨ z = 𝟭" by (rule MMI_orbi12d)
       from S35 S38 have S39: "x = 𝟭 ⟶ 
	 (z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (z \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 z \<ls> 𝟭 ∨ z = 𝟭)" by (rule MMI_imbi12d)
       from S39 have S40: "x = 𝟭 ⟶ 
	 (∀z∈ℕ. z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (∀z∈ℕ. z \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 z \<ls> 𝟭 ∨ z = 𝟭)" by auto; (rule MMI_ralbidv)
       have S41: "x = y ⟶ 
	 x \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_opreq1)
       from S41 have S42: "x = y ⟶ 
	 z \<ls> x \<ca> 𝟭 ⟷ z \<ls> y \<ca> 𝟭" by (rule MMI_breq2d)
       have S43: "x = y ⟶ 
	 z \<ls> x ⟷ z \<ls> y" by (rule MMI_breq2)
       have S44: "x = y ⟶ 
	 z = x ⟷ z = y" by (rule MMI_eqeq2)
       from S43 S44 have S45: "x = y ⟶ 
	 z \<ls> x ∨ z = x ⟷ z \<ls> y ∨ z = y" by (rule MMI_orbi12d)
       from S42 S45 have S46: "x = y ⟶ 
	 (z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (z \<ls> y \<ca> 𝟭 ⟶ z \<ls> y ∨ z = y)" by (rule MMI_imbi12d)
       from S46 have S47: "x = y ⟶ 
	 (∀z∈ℕ. z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (∀z∈ℕ. z \<ls> y \<ca> 𝟭 ⟶ z \<ls> y ∨ z = y)" by auto; (rule MMI_ralbidv)
       have S48: "x = y \<ca> 𝟭 ⟶ 
	 x \<ca> 𝟭 = y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1)
       from S48 have S49: "x = y \<ca> 𝟭 ⟶ 
	 z \<ls> x \<ca> 𝟭 ⟷ 
	 z \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_breq2d)
       have S50: "x = y \<ca> 𝟭 ⟶ 
	 z \<ls> x ⟷ z \<ls> y \<ca> 𝟭" by (rule MMI_breq2)
       have S51: "x = y \<ca> 𝟭 ⟶ 
	 z = x ⟷ z = y \<ca> 𝟭" by (rule MMI_eqeq2)
       from S50 S51 have S52: "x = y \<ca> 𝟭 ⟶ 
	 z \<ls> x ∨ z = x ⟷ 
	 z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭" by (rule MMI_orbi12d)
       from S49 S52 have S53: "x = y \<ca> 𝟭 ⟶ 
	 (z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
	 z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by (rule MMI_imbi12d)
       from S53 have S54: "x = y \<ca> 𝟭 ⟶ 
	 (∀z∈ℕ. z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (∀z∈ℕ. z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
	 z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by auto; (rule MMI_ralbidv)
       have S55: "x = B ⟶ 
	 x \<ca> 𝟭 = B \<ca> 𝟭" by (rule MMI_opreq1)
       from S55 have S56: "x = B ⟶ 
	 z \<ls> x \<ca> 𝟭 ⟷ z \<ls> B \<ca> 𝟭" by (rule MMI_breq2d)
       have S57: "x = B ⟶ 
	 z \<ls> x ⟷ z \<ls> B" by (rule MMI_breq2)
       have S58: "x = B ⟶ 
	 z = x ⟷ z = B" by (rule MMI_eqeq2)
       from S57 S58 have S59: "x = B ⟶ 
	 z \<ls> x ∨ z = x ⟷ z \<ls> B ∨ z = B" by (rule MMI_orbi12d)
       from S56 S59 have S60: "x = B ⟶ 
	 (z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (z \<ls> B \<ca> 𝟭 ⟶ z \<ls> B ∨ z = B)" by (rule MMI_imbi12d)
       from S60 have S61: "x = B ⟶ 
	 (∀z∈ℕ. z \<ls> x \<ca> 𝟭 ⟶ z \<ls> x ∨ z = x) ⟷ 
	 (∀z∈ℕ. z \<ls> B \<ca> 𝟭 ⟶ z \<ls> B ∨ z = B)" by auto; (rule MMI_ralbidv)
       have S62: "x = 𝟭 ⟶ 
	 x \<ls> 𝟭 \<ca> 𝟭 ⟷ 
	 𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_breq1)
       have S63: "x = 𝟭 ⟶ 
	 x \<ls> 𝟭 ⟷ 𝟭 \<ls> 𝟭" by (rule MMI_breq1)
       have S64: "x = 𝟭 ⟶ 
	 x = 𝟭 ⟷ 𝟭 = 𝟭" by (rule MMI_eqeq1)
       from S63 S64 have S65: "x = 𝟭 ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭 ⟷ 
	 𝟭 \<ls> 𝟭 ∨ 𝟭 = 𝟭" by (rule MMI_orbi12d)
       from S62 S65 have 
	 "x = 𝟭 ⟶  (x \<ls> 𝟭 \<ca> 𝟭 ⟶  x \<ls> 𝟭 ∨ x = 𝟭) ⟷  (𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 𝟭 \<ls> 𝟭 ∨ 𝟭 = 𝟭)" 
	 by (rule MMI_imbi12d)
     } then have S66: 
	 "∀ x. x = 𝟭 ⟶  (x \<ls> 𝟭 \<ca> 𝟭 ⟶  x \<ls> 𝟭 ∨ x = 𝟭) ⟷ 
	 (𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 𝟭 \<ls> 𝟭 ∨ 𝟭 = 𝟭)"
       by simp;
     { fix x y
       have S67: "x = y \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 \<ca> 𝟭 ⟷ 
	 y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_breq1);
       have S68: "x = y \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 ⟷ y \<ca> 𝟭 \<ls> 𝟭" by (rule MMI_breq1)
       have S69: "x = y \<ca> 𝟭 ⟶ 
	 x = 𝟭 ⟷ y \<ca> 𝟭 = 𝟭" by (rule MMI_eqeq1)
       from S68 S69 have S70: "x = y \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭 ⟷ 
	 y \<ca> 𝟭 \<ls> 𝟭 ∨ y \<ca> 𝟭 = 𝟭" by (rule MMI_orbi12d);
       from S67 S70 have S71: "x = y \<ca> 𝟭 ⟶ 
	 (x \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭) ⟷ 
	 (y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 ∨ y \<ca> 𝟭 = 𝟭)" by (rule MMI_imbi12d)
     } then have S71: "∀x y. x = y \<ca> 𝟭 ⟶ 
	 (x \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭) ⟷ 
	 (y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 ∨ y \<ca> 𝟭 = 𝟭)" by simp;
     { fix x
       have S72: "x = z ⟶ 
	 x \<ls> 𝟭 \<ca> 𝟭 ⟷ z \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_breq1)
       have S73: "x = z ⟶ 
	 x \<ls> 𝟭 ⟷ z \<ls> 𝟭" by (rule MMI_breq1)
       have S74: "x = z ⟶ 
	 x = 𝟭 ⟷ z = 𝟭" by (rule MMI_eqeq1)
       from S73 S74 have S75: "x = z ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭 ⟷ 
	 z \<ls> 𝟭 ∨ z = 𝟭" by (rule MMI_orbi12d)
       from S72 S75 have "x = z ⟶ 
	 (x \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭) ⟷ 
	 (z \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 z \<ls> 𝟭 ∨ z = 𝟭)" by (rule MMI_imbi12d)
     } then have S76: "∀ x. x = z ⟶ 
	 (x \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 x \<ls> 𝟭 ∨ x = 𝟭) ⟷ 
	 (z \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 z \<ls> 𝟭 ∨ z = 𝟭)" by simp;
     have S77: "𝟭 = 𝟭" by (rule MMI_eqid)
     from S77 have S78: "¬(𝟭 \<ls> 𝟭) ⟶ 𝟭 = 𝟭" by (rule MMI_a1i)
     from S78 have S79: "𝟭 \<ls> 𝟭 ∨ 𝟭 = 𝟭" by (rule MMI_orri)
     from S79 have S80: "𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 
       𝟭 \<ls> 𝟭 ∨ 𝟭 = 𝟭" by (rule MMI_a1i)
     { fix y
       have S81: "y ∈ ℕ ⟶ y ∈ ℝ" by (rule MMI_nnret)
       have S82: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
       have S83: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
       have S84: "y ∈ ℝ ∧ 𝟭 ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
	 y \<ls> 𝟭 ⟷ 
	 y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_ltadd1t)
       from S82 S83 S84 have S85: "y ∈ ℝ ⟶ 
	 y \<ls> 𝟭 ⟷ 
	 y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_mp3an23)
       from S81 S85 have S86: "y ∈ ℕ ⟶ 
	 y \<ls> 𝟭 ⟷ 
	 y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_syl)
       have S87: "y ∈ ℕ ⟶ 𝟭 \<lsq> y" by (rule MMI_nnge1t)
       from S81 have S88: "y ∈ ℕ ⟶ y ∈ ℝ" .
       have S89: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
       have S90: "𝟭 ∈ ℝ ∧ y ∈ ℝ ⟶ 
	 𝟭 \<lsq> y ⟷ ¬(y \<ls> 𝟭)" by (rule MMI_lenltt)
       from S89 S90 have S91: "y ∈ ℝ ⟶ 
	 𝟭 \<lsq> y ⟷ ¬(y \<ls> 𝟭)" by (rule MMI_mpan)
       from S88 S91 have S92: "y ∈ ℕ ⟶ 
	 𝟭 \<lsq> y ⟷ ¬(y \<ls> 𝟭)" by (rule MMI_syl)
       from S87 S92 have S93: "y ∈ ℕ ⟶ ¬(y \<ls> 𝟭)" by (rule MMI_mpbid)
       from S93 have S94: "y ∈ ℕ ⟶ 
	 y \<ls> 𝟭 ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 ∨ y \<ca> 𝟭 = 𝟭" by (rule MMI_pm2_21d)
       from S86 S94 have "y ∈ ℕ ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 ∨ y \<ca> 𝟭 = 𝟭" by (rule MMI_sylbird)
     } then have  S95: "∀ y. y ∈ ℕ ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 \<ca> 𝟭 ⟶ 
	 y \<ca> 𝟭 \<ls> 𝟭 ∨ y \<ca> 𝟭 = 𝟭" by simp;
     from S66 S71 S76 S80 S95 have "z ∈ ℕ ⟶ 
       z \<ls> 𝟭 \<ca> 𝟭 ⟶ 
       z \<ls> 𝟭 ∨ z = 𝟭" by (rule MMI_nn1suc);
   } then have  S96: "∀z. z ∈ ℕ ⟶  z \<ls> 𝟭 \<ca> 𝟭 ⟶ z \<ls> 𝟭 ∨ z = 𝟭"
     by simp;       
   from S96 have S97: "∀z∈ℕ. z \<ls> 𝟭 \<ca> 𝟭 ⟶ 
     z \<ls> 𝟭 ∨ z = 𝟭" by (rule MMI_rgen);
   { fix x
     have S98: "x = 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟷ 
       𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_breq1)
     have S99: "x = 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ⟷ 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_breq1)
     have S100: "x = 𝟭 ⟶ 
       x = y \<ca> 𝟭 ⟷ 𝟭 = y \<ca> 𝟭" by (rule MMI_eqeq1)
     from S99 S100 have S101: "x = 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭 ⟷ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭" by (rule MMI_orbi12d)
     from S98 S101 have S102: "x = 𝟭 ⟶ 
       (x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭)" by (rule MMI_imbi12d)
     from S102 have "x = 𝟭 ⟶ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭)" by (rule MMI_imbi2d)
   } then have S103: "∀ x. x = 𝟭 ⟶ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭)" by simp;
   { fix x v
     have S104: "x = v \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_breq1)
     have S105: "x = v \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_breq1)
     have S106: "x = v \<ca> 𝟭 ⟶ 
       x = y \<ca> 𝟭 ⟷ 
       v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_eqeq1)
     from S105 S106 have S107: "x = v \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭 ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_orbi12d)
     from S104 S107 have S108: "x = v \<ca> 𝟭 ⟶ 
       (x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭)" by (rule MMI_imbi12d)
     from S108 have "x = v \<ca> 𝟭 ⟶ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭)" by (rule MMI_imbi2d)
   } then have S109: "∀x v. x = v \<ca> 𝟭 ⟶ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭)"
     by simp;
   { fix x
     have S110: "x = z ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟷ 
       z \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_breq1)
     have S111: "x = z ⟶ 
       x \<ls> y \<ca> 𝟭 ⟷ z \<ls> y \<ca> 𝟭" by (rule MMI_breq1)
     have S112: "x = z ⟶ 
       x = y \<ca> 𝟭 ⟷ z = y \<ca> 𝟭" by (rule MMI_eqeq1)
     from S111 S112 have S113: "x = z ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭 ⟷ 
       z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭" by (rule MMI_orbi12d)
     from S110 S113 have S114: "x = z ⟶ 
       (x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
   (z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by (rule MMI_imbi12d)
     from S114 have "x = z ⟶ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by (rule MMI_imbi2d)
     } then have S115: "∀x. x = z ⟶ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       x \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       x \<ls> y \<ca> 𝟭 ∨ x = y \<ca> 𝟭) ⟷ 
       (y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by simp;
     have S116: "y ∈ ℕ ⟶ 𝟬 \<ls> y" by (rule MMI_nngt0t)
     have S117: "y ∈ ℕ ⟶ y ∈ ℝ" by (rule MMI_nnret);
     have S118: "𝟬 ∈ ℝ" by (rule MMI_0re)
     have S119: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
     have S120: "𝟬 ∈ ℝ ∧ y ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       𝟬 \<ls> y ⟷ 
       𝟬 \<ca> 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_ltadd1t)
     from S118 S119 S120 have S121: "y ∈ ℝ ⟶ 
       𝟬 \<ls> y ⟷ 
       𝟬 \<ca> 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_mp3an13)
     from S117 S121 have S122: "y ∈ ℕ ⟶ 
       𝟬 \<ls> y ⟷ 
       𝟬 \<ca> 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_syl)
     from S116 S122 have S123: "y ∈ ℕ ⟶ 
       𝟬 \<ca> 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_mpbid)
     have S124: "𝟭 ∈ ℂ" by (rule MMI_1cn)
     from S124 have S125: "𝟬 \<ca> 𝟭 = 𝟭" by (rule MMI_addid2)
     from S123 S125 have S126: "y ∈ ℕ ⟶ 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_syl5eqbrr)
     from S126 have S127: "y ∈ ℕ ⟶ 
       ¬(𝟭 \<ls> y \<ca> 𝟭) ⟶ 𝟭 = y \<ca> 𝟭" by (rule MMI_pm2_21nd)
     from S127 have S128: "y ∈ ℕ ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭" by (rule MMI_orrd)
     from S128 have S129: "y ∈ ℕ ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭" by (rule MMI_a1d)
     from S129 have S130: "y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
   𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       𝟭 \<ls> y \<ca> 𝟭 ∨ 𝟭 = y \<ca> 𝟭" by (rule MMI_adantr)
     { fix v
       have S131: "w = v ⟶ 
	 w \<ls> y \<ca> 𝟭 ⟷ v \<ls> y \<ca> 𝟭" by (rule MMI_breq1);
       have S132: "w = v ⟶ 
	 w \<ls> y ⟷ v \<ls> y" by (rule MMI_breq1)
       have S133: "w = v ⟶ 
	 w = y ⟷ v = y" by (rule MMI_eqeq1)
       from S132 S133 have S134: "w = v ⟶ 
	 w \<ls> y ∨ w = y ⟷ v \<ls> y ∨ v = y" by (rule MMI_orbi12d)
       from S131 S134 have S135: "w = v ⟶ 
	 (w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟷ 
	 (v \<ls> y \<ca> 𝟭 ⟶ v \<ls> y ∨ v = y)" by (rule MMI_imbi12d)
       from S135 have S136: "v ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
	 v \<ls> y \<ca> 𝟭 ⟶ v \<ls> y ∨ v = y" by auto; (rule MMI_rcla4va)
       from S136 have S137: "(v ∈ ℕ ∧ y ∈ ℕ) ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
	 v \<ls> y \<ca> 𝟭 ⟶ v \<ls> y ∨ v = y" by (rule MMI_adantlr)
       have S138: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
       have S139: "v ∈ ℝ ∧ y \<ca> 𝟭 ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
	 v \<ls> y \<ca> 𝟭 ⟷ 
	 v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_ltadd1t)
       from S138 S139 have S140: "v ∈ ℝ ∧ y \<ca> 𝟭 ∈ ℝ ⟶ 
	 v \<ls> y \<ca> 𝟭 ⟷ 
	 v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_mp3an3)
       have S141: "v ∈ ℕ ⟶ v ∈ ℝ" by (rule MMI_nnret)
       have S142: "y ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
     have S143: "y \<ca> 𝟭 ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℝ" by (rule MMI_nnret)
     from S142 S143 have S144: "y ∈ ℕ ⟶ y \<ca> 𝟭 ∈ ℝ" by (rule MMI_syl)
     from S140 S141 S144 have S145: "v ∈ ℕ ∧ y ∈ ℕ ⟶ 
       v \<ls> y \<ca> 𝟭 ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_syl2an)
     from S145 have S146: "(v ∈ ℕ ∧ y ∈ ℕ) ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ls> y \<ca> 𝟭 ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_adantr)
     have S147: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
     have S148: "v ∈ ℝ ∧ y ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       v \<ls> y ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭" by (rule MMI_ltadd1t)
     have S149: "v ∈ ℝ ⟶ v ∈ ℂ" by (rule MMI_recnt)
     have S150: "y ∈ ℝ ⟶ y ∈ ℂ" by (rule MMI_recnt)
     have S151: "𝟭 ∈ ℝ ⟶ 𝟭 ∈ ℂ" by (rule MMI_recnt)
     from S149 S150 S151 have S152: "v ∈ ℝ ∧ y ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       v ∈ ℂ ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ" by (rule MMI_3anim123i)
     have S153: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟷ 
       v ∈ ℂ ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ" by (rule MMI_3anrot)
     from S152 S153 have S154: "v ∈ ℝ ∧ y ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ" by (rule MMI_sylibr)
     have S155: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 
       v ∈ ℂ ∧ y ∈ ℂ" by (rule MMI_3simpc)
     have S156: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 𝟭 ∈ ℂ" by (rule MMI_3simp1)
     from S155 S156 have S157: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 
       (v ∈ ℂ ∧ y ∈ ℂ) ∧ 𝟭 ∈ ℂ" by (rule MMI_jca)
     have S158: "(v ∈ ℂ ∧ y ∈ ℂ) ∧ 𝟭 ∈ ℂ ⟷ 
       (v ∈ ℂ ∧ 𝟭 ∈ ℂ) ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ" by (rule MMI_anandir)
     from S157 S158 have S159: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 
       (v ∈ ℂ ∧ 𝟭 ∈ ℂ) ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ" by (rule MMI_sylib)
     have S160: "v ∈ ℂ ∧ 𝟭 ∈ ℂ ⟶ 
       v \<ca> 𝟭 = 𝟭 \<ca> v" by (rule MMI_axaddcom)
     have S161: "y ∈ ℂ ∧ 𝟭 ∈ ℂ ⟶ 
       y \<ca> 𝟭 = 𝟭 \<ca> y" by (rule MMI_axaddcom)
     from S160 S161 have S162: "(v ∈ ℂ ∧ 𝟭 ∈ ℂ) ∧ y ∈ ℂ ∧ 𝟭 ∈ ℂ ⟶ 
       v \<ca> 𝟭 = y \<ca> 𝟭 ⟷ 
       𝟭 \<ca> v = 𝟭 \<ca> y" by (rule MMI_eqeqan12d);
     from S159 S162 have S163: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 
       v \<ca> 𝟭 = y \<ca> 𝟭 ⟷ 
       𝟭 \<ca> v = 𝟭 \<ca> y" by (rule MMI_syl)
     have S164: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 
       𝟭 \<ca> v = 𝟭 \<ca> y ⟷ v = y" by (rule MMI_addcant)
     from S163 S164 have S165: "𝟭 ∈ ℂ ∧ v ∈ ℂ ∧ y ∈ ℂ ⟶ 
       v = y ⟷ 
       v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_bitr2d)
     from S154 S165 have S166: "v ∈ ℝ ∧ y ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       v = y ⟷ 
       v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_syl)
     from S148 S166 have S167: "v ∈ ℝ ∧ y ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
       v \<ls> y ∨ v = y ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_orbi12d)
     from S147 S167 have S168: "v ∈ ℝ ∧ y ∈ ℝ ⟶ 
       v \<ls> y ∨ v = y ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_mp3an3)
     from S141 have S169: "v ∈ ℕ ⟶ v ∈ ℝ" .
     have S170: "y ∈ ℕ ⟶ y ∈ ℝ" by (rule MMI_nnret);
     from S168 S169 S170 have S171: "v ∈ ℕ ∧ y ∈ ℕ ⟶ 
       v \<ls> y ∨ v = y ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_syl2an)
     from S171 have S172: "(v ∈ ℕ ∧ y ∈ ℕ) ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ls> y ∨ v = y ⟷ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_adantr)
     from S137 S146 S172 have S173: "(v ∈ ℕ ∧ y ∈ ℕ) ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_3imtr3d)
     from S173 have S174: "v ∈ ℕ ⟶ 
       y ∈ ℕ ⟶ 
       (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_exp31)
     from S174 have "v ∈ ℕ ⟶ 
       y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_imp3a)
   } then have S175: "∀ v. v ∈ ℕ ⟶ 
       ( y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
       v \<ca> 𝟭 \<ls> y \<ca> 𝟭 ∨ v \<ca> 𝟭 = y \<ca> 𝟭 )" by simp;
   from S103 S109 S115 S130 S175 have S176: "z ∈ ℕ ⟶ 
   ( y ∈ ℕ ∧ (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
   z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
   z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" 
 ************ this is where Isabelle stops ********************
 ********* if you know how to fix it, please let me know ******
 by (rule MMI_nn1suc)

   from S176 have S177: "z ∈ ℕ ⟶ 
   y ∈ ℕ ⟶ 
   (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
   z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
   z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭" by (rule MMI_exp3a);
   from S177 have S178: "y ∈ ℕ ⟶ 
   (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
   z ∈ ℕ ⟶ 
   z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
   z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭" by (rule MMI_com3l)
   from S178 have S179: "y ∈ ℕ ⟶ 
   (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y) ⟶ 
   (∀z∈ℕ. z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
   z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by (rule MMI_r19_21adv)
   have S180: "z = w ⟶ 
   z \<ls> y \<ca> 𝟭 ⟷ w \<ls> y \<ca> 𝟭" by (rule MMI_breq1)
   have S181: "z = w ⟶ 
   z \<ls> y ⟷ w \<ls> y" by (rule MMI_breq1)
   have S182: "z = w ⟶ 
   z = y ⟷ w = y" by (rule MMI_eqeq1)
   from S181 S182 have S183: "z = w ⟶ 
   z \<ls> y ∨ z = y ⟷ w \<ls> y ∨ w = y" by (rule MMI_orbi12d)
   from S180 S183 have S184: "z = w ⟶ 
   (z \<ls> y \<ca> 𝟭 ⟶ z \<ls> y ∨ z = y) ⟷ 
   (w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y)" by (rule MMI_imbi12d)
   from S184 have S185: "(∀z∈ℕ. z \<ls> y \<ca> 𝟭 ⟶ z \<ls> y ∨ z = y) ⟷ 
   (∀w∈ℕ. w \<ls> y \<ca> 𝟭 ⟶ w \<ls> y ∨ w = y)" by (rule MMI_cbvralv)
   from S179 S185 have S186: "y ∈ ℕ ⟶ 
   (∀z∈ℕ. z \<ls> y \<ca> 𝟭 ⟶ z \<ls> y ∨ z = y) ⟶ 
   (∀z∈ℕ. z \<ls> y \<ca> 𝟭 \<ca> 𝟭 ⟶ 
   z \<ls> y \<ca> 𝟭 ∨ z = y \<ca> 𝟭)" by (rule MMI_syl5ib)
   from S40 S47 S54 S61 S97 S186 have S187: "B ∈ ℕ ⟶ 
   (∀z∈ℕ. z \<ls> B \<ca> 𝟭 ⟶ z \<ls> B ∨ z = B)" by (rule MMI_nnind)
   from S33 S187 have S188: "A ∈ ℕ ⟶ 
   B ∈ ℕ ⟶ 
   A \<ls> B \<ca> 𝟭 ⟶ A \<ls> B ∨ A = B" by (rule MMI_syl5)
   from S188 have S189: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B \<ca> 𝟭 ⟶ A \<ls> B ∨ A = B" by (rule MMI_imp)
   from S27 S189 have S190: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ∨ A = B ⟷ A \<ls> B \<ca> 𝟭" by (rule MMI_impbid)
   from S4 S190 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<lsq> B ⟷ A \<ls> B \<ca> 𝟭" by (rule MMI_bitrd)
qed; *)


lemma (in MMIsar0) MMI_nnltp1let: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ⟷ A \<ca> 𝟭 \<lsq> B"
proof -
   have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S2: "A ∈ ℝ ∧ B ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
   A \<ls> B ⟷ 
   A \<ca> 𝟭 \<ls> B \<ca> 𝟭" by (rule MMI_ltadd1t)
   from S1 S2 have S3: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ⟷ 
   A \<ca> 𝟭 \<ls> B \<ca> 𝟭" by (rule MMI_mp3an3)
   have S4: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S5: "B ∈ ℕ ⟶ B ∈ ℝ" by (rule MMI_nnret)
   from S3 S4 S5 have S6: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ⟷ 
   A \<ca> 𝟭 \<ls> B \<ca> 𝟭" by (rule MMI_syl2an)
   have S7: "A \<ca> 𝟭 ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ca> 𝟭 \<lsq> B ⟷ 
   A \<ca> 𝟭 \<ls> B \<ca> 𝟭" by (rule MMI_nnleltp1t)
   have S8: "A ∈ ℕ ⟶ A \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
   from S7 S8 have S9: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ca> 𝟭 \<lsq> B ⟷ 
   A \<ca> 𝟭 \<ls> B \<ca> 𝟭" by (rule MMI_sylan)
   from S6 S9 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ⟷ A \<ca> 𝟭 \<lsq> B" by (rule MMI_bitr4d)
qed

lemma (in MMIsar0) MMI_nnsub: assumes A1: "A ∈ ℕ" and
    A2: "B ∈ ℕ"   
   shows "A \<ls> B ⟷ B \<cs> A ∈ ℕ"
proof -
   from A2 have S1: "B ∈ ℕ".
   { fix x
     have S2: "x = 𝟭 ⟶ 
       A \<ls> x ⟷ A \<ls> 𝟭" by (rule MMI_breq2)
     have S3: "x = 𝟭 ⟶ x \<cs> A = 𝟭 \<cs> A" by (rule MMI_opreq1)
     from S3 have S4: "x = 𝟭 ⟶ 
       x \<cs> A ∈ ℕ ⟷ 𝟭 \<cs> A ∈ ℕ" by (rule MMI_eleq1d)
     from S2 S4 have "x = 𝟭 ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ 
       (A \<ls> 𝟭 ⟶ 𝟭 \<cs> A ∈ ℕ)" by (rule MMI_imbi12d)
   } then have S5: "∀ x. x = 𝟭 ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ (A \<ls> 𝟭 ⟶ 𝟭 \<cs> A ∈ ℕ)" 
     by simp
   { fix x y
     have S6: "x = y ⟶ 
       A \<ls> x ⟷ A \<ls> y" by (rule MMI_breq2)
     have S7: "x = y ⟶ x \<cs> A = y \<cs> A" by (rule MMI_opreq1)
     from S7 have S8: "x = y ⟶ 
       x \<cs> A ∈ ℕ ⟷ y \<cs> A ∈ ℕ" by (rule MMI_eleq1d)
     from S6 S8 have "x = y ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ)" by (rule MMI_imbi12d)
   } then have S9: "∀x y. x = y ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ)" by simp
   { fix x y
     have S10: "x = y \<ca> 𝟭 ⟶ 
       A \<ls> x ⟷ A \<ls> y \<ca> 𝟭" by (rule MMI_breq2)
     have S11: "x = y \<ca> 𝟭 ⟶ 
       x \<cs> A = y \<ca> 𝟭 \<cs> A" by (rule MMI_opreq1)
     from S11 have S12: "x = y \<ca> 𝟭 ⟶ 
       x \<cs> A ∈ ℕ ⟷ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_eleq1d)
     from S10 S12 have "x = y \<ca> 𝟭 ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ 
       (A \<ls> y \<ca> 𝟭 ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ)" by (rule MMI_imbi12d)
   } then have S13: "∀x y.  x = y \<ca> 𝟭 ⟶ (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ 
       (A \<ls> y \<ca> 𝟭 ⟶ y \<ca> 𝟭 \<cs> A ∈ ℕ)" by simp
   { fix x
     have S14: "x = B ⟶ 
       A \<ls> x ⟷ A \<ls> B" by (rule MMI_breq2)
     have S15: "x = B ⟶ x \<cs> A = B \<cs> A" by (rule MMI_opreq1)
     from S15 have S16: "x = B ⟶ 
       x \<cs> A ∈ ℕ ⟷ B \<cs> A ∈ ℕ" by (rule MMI_eleq1d)
     from S14 S16 have S17: "x = B ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ 
       (A \<ls> B ⟶ B \<cs> A ∈ ℕ)" by (rule MMI_imbi12d)
   } then have S17: "∀x. x = B ⟶ 
       (A \<ls> x ⟶ x \<cs> A ∈ ℕ) ⟷ (A \<ls> B ⟶ B \<cs> A ∈ ℕ)" 
     by simp
   from A1 have S18: "A ∈ ℕ".
   have S19: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   from S18 S19 have S20: "𝟭 \<lsq> A" by (rule MMI_ax_mp)
   have S21: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from A1 have S22: "A ∈ ℕ".
   from S22 have S23: "A ∈ ℝ" by (rule MMI_nnre)
   from S21 S23 have S24: "𝟭 \<lsq> A ⟷ ¬(A \<ls> 𝟭)" by (rule MMI_lenlt)
   from S20 S24 have S25: "¬(A \<ls> 𝟭)" by (rule MMI_mpbi)
   from S25 have S26: "A \<ls> 𝟭 ⟶ 𝟭 \<cs> A ∈ ℕ" by (rule MMI_pm2_21i)
   { fix y
     have S27: "y ∈ ℕ ⟶ y ∈ ℝ" by (rule MMI_nnret)
     from S23 have S28: "A ∈ ℝ" .
     from S27 S28 have S29: "y ∈ ℕ ⟶ 
       A ∈ ℝ ∧ y ∈ ℝ" by (rule MMI_jctil)
     have S30: "A ∈ ℝ ∧ y ∈ ℝ ⟶ 
       A \<lsq> y ⟷ A \<ls> y ∨ A = y" by (rule MMI_leloet)
     from S29 S30 have S31: "y ∈ ℕ ⟶ 
       A \<lsq> y ⟷ A \<ls> y ∨ A = y" by (rule MMI_syl)
     from A1 have S32: "A ∈ ℕ".
     have S33: "A ∈ ℕ ∧ y ∈ ℕ ⟶ 
       A \<lsq> y ⟷ A \<ls> y \<ca> 𝟭" by (rule MMI_nnleltp1t)
     from S32 S33 have S34: "y ∈ ℕ ⟶ 
       A \<lsq> y ⟷ A \<ls> y \<ca> 𝟭" by (rule MMI_mpan)
     from S31 S34 have S35: "y ∈ ℕ ⟶ 
       A \<ls> y ∨ A = y ⟷ A \<ls> y \<ca> 𝟭" by (rule MMI_bitr3d)
     have S36: "y ∈ ℕ ⟶ y ∈ ℂ" by (rule MMI_nncnt)
     from A1 have S37: "A ∈ ℕ".
     from S37 have S38: "A ∈ ℂ" by (rule MMI_nncn)
     from S36 S38 have S39: "y ∈ ℕ ⟶ 
       y ∈ ℂ ∧ A ∈ ℂ" by (rule MMI_jctir)
     have S40: "𝟭 ∈ ℂ" by (rule MMI_1cn)
     have S41: "y ∈ ℂ ∧ 𝟭 ∈ ℂ ∧ A ∈ ℂ ⟶ 
       y \<ca> 𝟭 \<cs> A = y \<cs> A \<ca> 𝟭" by (rule MMI_addsubt)
     from S40 S41 have S42: "y ∈ ℂ ∧ A ∈ ℂ ⟶ 
       y \<ca> 𝟭 \<cs> A = y \<cs> A \<ca> 𝟭" by (rule MMI_mp3an2)
     from S39 S42 have S43: "y ∈ ℕ ⟶ 
       y \<ca> 𝟭 \<cs> A = y \<cs> A \<ca> 𝟭" by (rule MMI_syl)
     from S43 have S44: "y ∈ ℕ ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ ⟷ 
       y \<cs> A \<ca> 𝟭 ∈ ℕ" by (rule MMI_eleq1d)
     have S45: "y \<cs> A ∈ ℕ ⟶ 
       y \<cs> A \<ca> 𝟭 ∈ ℕ" by (rule MMI_peano2nn)
     from S44 S45 have S46: "y ∈ ℕ ⟶ 
       y \<cs> A ∈ ℕ ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_syl5bir)
     from S46 have S47: "y ∈ ℕ ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       A \<ls> y ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_imim2d)
     from S47 have S48: "y ∈ ℕ ⟶ 
       A \<ls> y ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_com23)
     have S49: "A = y ⟶ 
       A \<ca> 𝟭 = y \<ca> 𝟭" by (rule MMI_opreq1)
     from S49 have S50: "A = y ⟶ 
       A \<ca> 𝟭 \<cs> A = y \<ca> 𝟭 \<cs> A" by (rule MMI_opreq1d)
     from S38 have S51: "A ∈ ℂ" .
     have S52: "𝟭 ∈ ℂ" by (rule MMI_1cn)
     from S38 have S53: "A ∈ ℂ" .
     from S51 S52 S53 have S54: "A \<ca> 𝟭 \<cs> A = A \<cs> A \<ca> 𝟭" by (rule MMI_addsub)
     from S38 have S55: "A ∈ ℂ" .
     from S55 have S56: "A \<cs> A = 𝟬" by (rule MMI_subid)
     from S56 have S57: "A \<cs> A \<ca> 𝟭 = 𝟬 \<ca> 𝟭" by (rule MMI_opreq1i)
     have S58: "𝟭 ∈ ℂ" by (rule MMI_1cn)
     from S58 have S59: "𝟬 \<ca> 𝟭 = 𝟭" by (rule MMI_addid2)
     from S54 S57 S59 have S60: "A \<ca> 𝟭 \<cs> A = 𝟭" by (rule MMI_3eqtr)
     have S61: "𝟭 ∈ ℕ" by (rule MMI_1nn)
     from S60 S61 have S62: "A \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_eqeltr)
     from S50 S62 have S63: "A = y ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_syl6eqelr)
     from S63 have S64: "A = y ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_a1d)
     from S64 have S65: "y ∈ ℕ ⟶ 
       A = y ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_a1i)
     from S48 S65 have S66: "y ∈ ℕ ⟶ 
       A \<ls> y ∨ A = y ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_jaod)
     from S35 S66 have S67: "y ∈ ℕ ⟶ 
       A \<ls> y \<ca> 𝟭 ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_sylbird)
     from S67 have S68: "y ∈ ℕ ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       A \<ls> y \<ca> 𝟭 ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by (rule MMI_com23)
   } then have S68: "∀y. y ∈ ℕ ⟶ 
       (A \<ls> y ⟶ y \<cs> A ∈ ℕ) ⟶ 
       A \<ls> y \<ca> 𝟭 ⟶ 
       y \<ca> 𝟭 \<cs> A ∈ ℕ" by simp
   from S5 S9 S13 S17 S26 S68 have S69: "B ∈ ℕ ⟶ 
     A \<ls> B ⟶ B \<cs> A ∈ ℕ" by (rule MMI_nnind)
   from S1 S69 have S70: "A \<ls> B ⟶ B \<cs> A ∈ ℕ" by (rule MMI_ax_mp)
   have S71: "B \<cs> A ∈ ℕ ⟶ 𝟬 \<ls> B \<cs> A" by (rule MMI_nngt0t)
   from S23 have S72: "A ∈ ℝ" .
   from A2 have S73: "B ∈ ℕ".
   from S73 have S74: "B ∈ ℝ" by (rule MMI_nnre)
   from S72 S74 have S75: "A \<ls> B ⟷ 𝟬 \<ls> B \<cs> A" by (rule MMI_posdif)
   from S71 S75 have S76: "B \<cs> A ∈ ℕ ⟶ A \<ls> B" by (rule MMI_sylibr)
   from S70 S76 show "A \<ls> B ⟷ B \<cs> A ∈ ℕ" by (rule MMI_impbi)
qed

lemma (in MMIsar0) MMI_nnsubt: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ⟷ B \<cs> A ∈ ℕ"
proof -
   have S1: "A =  if(A ∈ ℕ, A, 𝟭) ⟶ 
   A \<ls> B ⟷ 
   ( if(A ∈ ℕ, A, 𝟭)) \<ls> B" by (rule MMI_breq1)
   have S2: "A =  if(A ∈ ℕ, A, 𝟭) ⟶ 
   B \<cs> A = B \<cs> ( if(A ∈ ℕ, A, 𝟭))" by (rule MMI_opreq2)
   from S2 have S3: "A =  if(A ∈ ℕ, A, 𝟭) ⟶ 
   B \<cs> A ∈ ℕ ⟷ 
   B \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ" by (rule MMI_eleq1d)
   from S1 S3 have S4: "A =  if(A ∈ ℕ, A, 𝟭) ⟶ 
   (A \<ls> B ⟷ B \<cs> A ∈ ℕ) ⟷ 
   ( if(A ∈ ℕ, A, 𝟭)) \<ls> B ⟷ 
   B \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ" by (rule MMI_bibi12d)
   have S5: "B =  if(B ∈ ℕ, B, 𝟭) ⟶ 
   ( if(A ∈ ℕ, A, 𝟭)) \<ls> B ⟷ 
   ( if(A ∈ ℕ, A, 𝟭)) \<ls> ( if(B ∈ ℕ, B, 𝟭))" by (rule MMI_breq2)
   have S6: "B =  if(B ∈ ℕ, B, 𝟭) ⟶ 
   B \<cs> ( if(A ∈ ℕ, A, 𝟭)) = ( if(B ∈ ℕ, B, 𝟭)) \<cs> ( if(A ∈ ℕ, A, 𝟭))" by (rule MMI_opreq1)
   from S6 have S7: "B =  if(B ∈ ℕ, B, 𝟭) ⟶ 
   B \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ ⟷ 
   ( if(B ∈ ℕ, B, 𝟭)) \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ" by (rule MMI_eleq1d)
   from S5 S7 have S8: "B =  if(B ∈ ℕ, B, 𝟭) ⟶ 
   (( if(A ∈ ℕ, A, 𝟭)) \<ls> B ⟷ 
   B \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ) ⟷ 
   ( if(A ∈ ℕ, A, 𝟭)) \<ls> ( if(B ∈ ℕ, B, 𝟭)) ⟷ 
   ( if(B ∈ ℕ, B, 𝟭)) \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ" by (rule MMI_bibi12d)
   have S9: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   from S9 have S10: " if(A ∈ ℕ, A, 𝟭) ∈ ℕ" by (rule MMI_elimel)
   have S11: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   from S11 have S12: " if(B ∈ ℕ, B, 𝟭) ∈ ℕ" by (rule MMI_elimel)
   from S10 S12 have S13: "( if(A ∈ ℕ, A, 𝟭)) \<ls> ( if(B ∈ ℕ, B, 𝟭)) ⟷ 
   ( if(B ∈ ℕ, B, 𝟭)) \<cs> ( if(A ∈ ℕ, A, 𝟭)) ∈ ℕ" by (rule MMI_nnsub)
   from S4 S8 S13 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ls> B ⟷ B \<cs> A ∈ ℕ" by (rule MMI_dedth2h)
qed

lemma (in MMIsar0) MMI_nnaddm1clt: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ca> B \<cs> 𝟭 ∈ ℕ"
proof -
   have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟭 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   have S5: "𝟭 ∈ ℝ ∧ 𝟭 \<ca> 𝟭 ∈ ℝ ∧ A \<ca> B ∈ ℝ ⟶ 
   𝟭 \<ls> 𝟭 \<ca> 𝟭 ∧ 𝟭 \<ca> 𝟭 \<lsq> A \<ca> B ⟶ 𝟭 \<ls> A \<ca> B" by (rule MMI_ltletrt)
   from S1 S4 S5 have S6: "A \<ca> B ∈ ℝ ⟶ 
   𝟭 \<ls> 𝟭 \<ca> 𝟭 ∧ 𝟭 \<ca> 𝟭 \<lsq> A \<ca> B ⟶ 𝟭 \<ls> A \<ca> B" by (rule MMI_mp3an12)
   have S7: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<ca> B ∈ ℝ" by (rule MMI_axaddrcl)
   have S8: "A ∈ ℕ ⟶ A ∈ ℝ" by (rule MMI_nnret)
   have S9: "B ∈ ℕ ⟶ B ∈ ℝ" by (rule MMI_nnret)
   from S7 S8 S9 have S10: "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<ca> B ∈ ℝ" by (rule MMI_syl2an)
   from S4 have S11: "𝟭 \<ca> 𝟭 ∈ ℝ" .
   from S11 have S12: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<ca> 𝟭 ∈ ℝ" by (rule MMI_a1i)
   from S9 have S13: "B ∈ ℕ ⟶ B ∈ ℝ" .
   have S14: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S15: "𝟭 ∈ ℝ ∧ B ∈ ℝ ⟶ 𝟭 \<ca> B ∈ ℝ" by (rule MMI_axaddrcl)
   from S14 S15 have S16: "B ∈ ℝ ⟶ 𝟭 \<ca> B ∈ ℝ" by (rule MMI_mpan)
   from S13 S16 have S17: "B ∈ ℕ ⟶ 𝟭 \<ca> B ∈ ℝ" by (rule MMI_syl)
   from S17 have S18: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 𝟭 \<ca> B ∈ ℝ" by (rule MMI_adantl)
   from S10 have S19: "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<ca> B ∈ ℝ" .
   have S20: "B ∈ ℕ ⟶ 𝟭 \<lsq> B" by (rule MMI_nnge1t)
   from S9 have S21: "B ∈ ℕ ⟶ B ∈ ℝ" .
   have S22: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S23: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S24: "𝟭 ∈ ℝ ∧ B ∈ ℝ ∧ 𝟭 ∈ ℝ ⟶ 
   𝟭 \<lsq> B ⟷ 
   𝟭 \<ca> 𝟭 \<lsq> 𝟭 \<ca> B" by (rule MMI_leadd2t)
   from S22 S23 S24 have S25: "B ∈ ℝ ⟶ 
   𝟭 \<lsq> B ⟷ 
   𝟭 \<ca> 𝟭 \<lsq> 𝟭 \<ca> B" by (rule MMI_mp3an13)
   from S21 S25 have S26: "B ∈ ℕ ⟶ 
   𝟭 \<lsq> B ⟷ 
   𝟭 \<ca> 𝟭 \<lsq> 𝟭 \<ca> B" by (rule MMI_syl)
   from S20 S26 have S27: "B ∈ ℕ ⟶ 
   𝟭 \<ca> 𝟭 \<lsq> 𝟭 \<ca> B" by (rule MMI_mpbid)
   from S27 have S28: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<ca> 𝟭 \<lsq> 𝟭 \<ca> B" by (rule MMI_adantl)
   have S29: "A ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_nnge1t)
   from S29 have S30: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 𝟭 \<lsq> A" by (rule MMI_adantr)
   have S31: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S32: "𝟭 ∈ ℝ ∧ A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   𝟭 \<lsq> A ⟷ 
   𝟭 \<ca> B \<lsq> A \<ca> B" by (rule MMI_leadd1t)
   from S31 S32 have S33: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   𝟭 \<lsq> A ⟷ 
   𝟭 \<ca> B \<lsq> A \<ca> B" by (rule MMI_mp3an1)
   from S8 have S34: "A ∈ ℕ ⟶ A ∈ ℝ" .
   from S9 have S35: "B ∈ ℕ ⟶ B ∈ ℝ" .
   from S33 S34 S35 have S36: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<lsq> A ⟷ 
   𝟭 \<ca> B \<lsq> A \<ca> B" by (rule MMI_syl2an)
   from S30 S36 have S37: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<ca> B \<lsq> A \<ca> B" by (rule MMI_mpbid)
   from S12 S18 S19 S28 S37 have S38: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<ca> 𝟭 \<lsq> A \<ca> B" by (rule MMI_letrd)
   have S39: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S39 have S40: "𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_ltp1)
   from S38 S40 have S41: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<ls> 𝟭 \<ca> 𝟭 ∧ 𝟭 \<ca> 𝟭 \<lsq> A \<ca> B" by (rule MMI_jctil)
   from S6 S10 S41 have S42: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 𝟭 \<ls> A \<ca> B" by (rule MMI_sylc)
   have S43: "A ∈ ℕ ∧ B ∈ ℕ ⟶ A \<ca> B ∈ ℕ" by (rule MMI_nnaddclt)
   have S44: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   have S45: "𝟭 ∈ ℕ ∧ A \<ca> B ∈ ℕ ⟶ 
   𝟭 \<ls> A \<ca> B ⟷ 
   A \<ca> B \<cs> 𝟭 ∈ ℕ" by (rule MMI_nnsubt)
   from S44 S45 have S46: "A \<ca> B ∈ ℕ ⟶ 
   𝟭 \<ls> A \<ca> B ⟷ 
   A \<ca> B \<cs> 𝟭 ∈ ℕ" by (rule MMI_mpan)
   from S43 S46 have S47: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   𝟭 \<ls> A \<ca> B ⟷ 
   A \<ca> B \<cs> 𝟭 ∈ ℕ" by (rule MMI_syl)
   from S42 S47 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A \<ca> B \<cs> 𝟭 ∈ ℕ" by (rule MMI_mpbid)
qed

(****** 521,522 *************************)

lemma (in MMIsar0) MMI_nndivt: 
   shows "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   ( ∃x∈ℕ. A⋅x = B) ⟷ B\<cdiv>A ∈ ℕ"
proof -
   have S1: "A ∈ ℕ ⟶ A ≠ 𝟬" by (rule MMI_nnne0t)
   from S1 have S2: "A ∈ ℕ ∧ B ∈ ℕ ⟶ A ≠ 𝟬" by (rule MMI_adantr)
   { fix x
     have S3: "A ∈ ℂ ∧ x ∈ ℂ ∧ A ≠ 𝟬 ⟶ A⋅x\<cdiv>A = x" by (rule MMI_divcan3t)
     from S3 have S4: "A ∈ ℂ ∧ A ≠ 𝟬 ∧ x ∈ ℂ ⟶ A⋅x\<cdiv>A = x" by (rule MMI_3com23)
     from S4 have S5: "(A ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℂ ⟶ A⋅x\<cdiv>A = x" by (rule MMI_3expa)
     have S6: "x ∈ ℕ ⟶ x ∈ ℂ" by (rule MMI_nncnt)
     from S5 S6 have S7: "(A ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ ⟶ A⋅x\<cdiv>A = x" by (rule MMI_sylan2)
     from S7 have S8: "(A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ ⟶ A⋅x\<cdiv>A = x" 
       by (rule MMI_3adantl2)
     from S8 have S9: "(A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ ⟶ x = A⋅x\<cdiv>A" 
       by (rule MMI_eqcomd)
     have S10: "A⋅x = B ⟶ A⋅x\<cdiv>A = B\<cdiv>A" by (rule MMI_opreq1)
     from S9 S10 have S11: 
       "((A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ) ∧ A⋅x = B ⟶ x = B\<cdiv>A" 
       by (rule MMI_sylan9eq)
     have S12: "((A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ) ∧ A⋅x = B ⟶ 
       (A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ" by (rule MMI_pm3_26)
     from S12 have S13: 
       "((A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ) ∧ A⋅x = B ⟶ x ∈ ℕ" by (rule MMI_pm3_27d)
     from S11 S13 have S14: 
       "((A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬) ∧ x ∈ ℕ) ∧ A⋅x = B ⟶ B\<cdiv>A ∈ ℕ" 
       by (rule MMI_eqeltrrd)
     from S14 have "A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬 ⟶ x ∈ ℕ ⟶ 
       A⋅x = B ⟶ B\<cdiv>A ∈ ℕ" by (rule MMI_exp31)
     } then have S15: "∀x. A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬 ⟶ x ∈ ℕ ⟶ 
	 A⋅x = B ⟶ B\<cdiv>A ∈ ℕ" by simp
   from S15 have S16: "A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬 ⟶ 
   ( ∃x∈ℕ. A⋅x = B) ⟶ B\<cdiv>A ∈ ℕ" by (rule MMI_r19_23adv)
   have S17: "A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬 ⟶ A⋅(B\<cdiv>A) = B" by (rule MMI_divcan2t)
   have S18: "x = B\<cdiv>A ⟶ 
     A⋅x = A⋅(B\<cdiv>A)" by (rule MMI_opreq2)
   from S18 have S19: "x = B\<cdiv>A ⟶ 
     A⋅x = B ⟷ A⋅(B\<cdiv>A) = B" by (rule MMI_eqeq1d)
   from S19 have S20: "B\<cdiv>A ∈ ℕ ∧ A⋅(B\<cdiv>A) = B ⟶ 
     ( ∃x∈ℕ. A⋅x = B)" by auto (*(rule MMI_rcla4ev)*)
   from S20 have S21: "A⋅(B\<cdiv>A) = B ⟶ 
     B\<cdiv>A ∈ ℕ ⟶ 
     ( ∃x∈ℕ. A⋅x = B)" by (rule MMI_expcom)
   from S17 S21 have S22: "A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬 ⟶ 
     B\<cdiv>A ∈ ℕ ⟶ 
     ( ∃x∈ℕ. A⋅x = B)" by (rule MMI_syl)
   from S16 S22 have S23: "A ∈ ℂ ∧ B ∈ ℂ ∧ A ≠ 𝟬 ⟶ 
     ( ∃x∈ℕ. A⋅x = B) ⟷ B\<cdiv>A ∈ ℕ" by (rule MMI_impbid)
   from S23 have S24: "A ∈ ℂ ⟶ 
     B ∈ ℂ ⟶ 
     A ≠ 𝟬 ⟶ 
     ( ∃x∈ℕ. A⋅x = B) ⟷ B\<cdiv>A ∈ ℕ" by (rule MMI_3exp)
   from S24 have S25: "A ∈ ℂ ∧ B ∈ ℂ ⟶ 
     A ≠ 𝟬 ⟶ 
     ( ∃x∈ℕ. A⋅x = B) ⟷ B\<cdiv>A ∈ ℕ" by (rule MMI_imp)
   have S26: "A ∈ ℕ ⟶ A ∈ ℂ" by (rule MMI_nncnt)
   have S27: "B ∈ ℕ ⟶ B ∈ ℂ" by (rule MMI_nncnt)
   from S25 S26 S27 have S28: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
     A ≠ 𝟬 ⟶ 
     ( ∃x∈ℕ. A⋅x = B) ⟷ B\<cdiv>A ∈ ℕ" by (rule MMI_syl2an)
   from S2 S28 show "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
     ( ∃x∈ℕ. A⋅x = B) ⟷ B\<cdiv>A ∈ ℕ" by (rule MMI_mpd)
 qed

lemma (in MMIsar0) MMI_nndivtrt: 
   shows "(A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ) ∧ B\<cdiv>A ∈ ℕ ∧ C\<cdiv>B ∈ ℕ ⟶ C\<cdiv>A ∈ ℕ"
proof -
   have S1: "((B ∈ ℂ ∧ A ∈ ℂ) ∧ C ∈ ℂ ∧ B ∈ ℂ) ∧ A ≠ 𝟬 ∧ B ≠ 𝟬 ⟶ 
   (B\<cdiv>A)⋅(C\<cdiv>B) = (B\<cdiv>B)⋅(C\<cdiv>A)" by (rule MMI_divmul24t)
   have S2: "B ∈ ℕ ⟶ B ∈ ℂ" by (rule MMI_nncnt)
   have S3: "A ∈ ℕ ⟶ A ∈ ℂ" by (rule MMI_nncnt)
   from S2 S3 have S4: "B ∈ ℕ ∧ A ∈ ℕ ⟶ 
   B ∈ ℂ ∧ A ∈ ℂ" by (rule MMI_anim12i)
   from S4 have S5: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   B ∈ ℂ ∧ A ∈ ℂ" by (rule MMI_ancoms)
   from S5 have S6: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   B ∈ ℂ ∧ A ∈ ℂ" by (rule MMI_3adant3)
   from S2 have S7: "B ∈ ℕ ⟶ B ∈ ℂ" .
   from S7 have S8: "C ∈ ℂ ∧ B ∈ ℕ ⟶ 
   C ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_anim2i)
   from S8 have S9: "B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   C ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_ancoms)
   from S9 have S10: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   C ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_3adant1)
   from S6 S10 have S11: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   (B ∈ ℂ ∧ A ∈ ℂ) ∧ C ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_jca)
   have S12: "A ∈ ℕ ⟶ A ≠ 𝟬" by (rule MMI_nnne0t)
   have S13: "B ∈ ℕ ⟶ B ≠ 𝟬" by (rule MMI_nnne0t)
   from S12 S13 have S14: "A ∈ ℕ ∧ B ∈ ℕ ⟶ 
   A ≠ 𝟬 ∧ B ≠ 𝟬" by (rule MMI_anim12i)
   from S14 have S15: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   A ≠ 𝟬 ∧ B ≠ 𝟬" by (rule MMI_3adant3)
   from S1 S11 S15 have S16: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   (B\<cdiv>A)⋅(C\<cdiv>B) = (B\<cdiv>B)⋅(C\<cdiv>A)" by (rule MMI_sylanc)
   have S17: "B ∈ ℂ ∧ B ≠ 𝟬 ⟶ B\<cdiv>B = 𝟭" by (rule MMI_dividt)
   from S2 have S18: "B ∈ ℕ ⟶ B ∈ ℂ" .
   from S13 have S19: "B ∈ ℕ ⟶ B ≠ 𝟬" .
   from S17 S18 S19 have S20: "B ∈ ℕ ⟶ B\<cdiv>B = 𝟭" by (rule MMI_sylanc)
   from S20 have S21: "B ∈ ℕ ⟶ 
   (B\<cdiv>B)⋅(C\<cdiv>A) = 𝟭⋅(C\<cdiv>A)" by (rule MMI_opreq1d)
   from S21 have S22: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   (B\<cdiv>B)⋅(C\<cdiv>A) = 𝟭⋅(C\<cdiv>A)" by (rule MMI_3ad2ant2)
   have S23: "C ∈ ℂ ∧ A ∈ ℂ ∧ A ≠ 𝟬 ⟶ C\<cdiv>A ∈ ℂ" by (rule MMI_divclt)
   from S23 have S24: "C ∈ ℂ ∧ A ∈ ℂ ∧ A ≠ 𝟬 ⟶ C\<cdiv>A ∈ ℂ" 
     by (rule MMI_3expb)
   from S3 have S25: "A ∈ ℕ ⟶ A ∈ ℂ" .
   from S12 have S26: "A ∈ ℕ ⟶ A ≠ 𝟬" .
   from S25 S26 have S27: "A ∈ ℕ ⟶ 
   A ∈ ℂ ∧ A ≠ 𝟬" by (rule MMI_jca)
   from S24 S27 have S28: "C ∈ ℂ ∧ A ∈ ℕ ⟶ C\<cdiv>A ∈ ℂ" 
     by (rule MMI_sylan2)
   from S28 have S29: "A ∈ ℕ ∧ C ∈ ℂ ⟶ C\<cdiv>A ∈ ℂ" by (rule MMI_ancoms)
   have S30: "C\<cdiv>A ∈ ℂ ⟶ 
   𝟭⋅(C\<cdiv>A) = C\<cdiv>A" by (rule MMI_mulid2t)
   from S29 S30 have S31: "A ∈ ℕ ∧ C ∈ ℂ ⟶ 
   𝟭⋅(C\<cdiv>A) = C\<cdiv>A" by (rule MMI_syl)
   from S31 have S32: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   𝟭⋅(C\<cdiv>A) = C\<cdiv>A" by (rule MMI_3adant2)
   from S16 S22 S32 have S33: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   (B\<cdiv>A)⋅(C\<cdiv>B) = C\<cdiv>A" by (rule MMI_3eqtrd)
   from S33 have S34: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   (B\<cdiv>A)⋅(C\<cdiv>B) ∈ ℕ ⟷ C\<cdiv>A ∈ ℕ" by (rule MMI_eleq1d)
   have S35: "B\<cdiv>A ∈ ℕ ∧ C\<cdiv>B ∈ ℕ ⟶ 
   (B\<cdiv>A)⋅(C\<cdiv>B) ∈ ℕ" by (rule MMI_nnmulclt)
   from S34 S35 have S36: "A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ ⟶ 
   B\<cdiv>A ∈ ℕ ∧ C\<cdiv>B ∈ ℕ ⟶ C\<cdiv>A ∈ ℕ" by (rule MMI_syl5bi)
   from S36 show 
     "(A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℂ) ∧ B\<cdiv>A ∈ ℕ ∧ C\<cdiv>B ∈ ℕ ⟶ 
     C\<cdiv>A ∈ ℕ" by (rule MMI_imp)
qed

text‹A bunch of definitions converted to lemmas.›

lemma (in MMIsar0) MMI_df_2: shows "𝟮 = 𝟭\<ca>𝟭"
  using two_def by simp

lemma (in MMIsar0) MMI_df_3: shows "𝟯 = 𝟮\<ca>𝟭"
  using three_def by simp

lemma (in MMIsar0) MMI_df_4: shows "𝟰 = 𝟯\<ca>𝟭"
  using four_def by simp

lemma (in MMIsar0) MMI_df_5: shows "𝟱 = 𝟰\<ca>𝟭"
  using five_def by simp

lemma (in MMIsar0) MMI_df_6: shows "𝟲 = 𝟱\<ca>𝟭"
  using six_def by simp

lemma (in MMIsar0) MMI_df_7: shows "𝟳 = 𝟲\<ca>𝟭"
  using seven_def by simp

lemma (in MMIsar0) MMI_df_8: shows "𝟴 = 𝟳\<ca>𝟭"
  using eight_def by simp

lemma (in MMIsar0) MMI_df_9: shows "𝟵 = 𝟴\<ca>𝟭"
  using nine_def by simp

(************ 523-530************************)

lemma (in MMIsar0) MMI_2re: 
   shows "𝟮 ∈ ℝ"
proof -
   have S1: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟭 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟮 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_2cn: 
   shows "𝟮 ∈ ℂ"
proof -
   have S1: "𝟮 ∈ ℝ" by (rule MMI_2re)
   from S1 show "𝟮 ∈ ℂ" by (rule MMI_recn)
qed

lemma (in MMIsar0) MMI_3re: 
   shows "𝟯 ∈ ℝ"
proof -
   have S1: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   have S2: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟮 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟯 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_4re: 
   shows "𝟰 ∈ ℝ"
proof -
   have S1: "𝟰 = 𝟯 \<ca> 𝟭" by (rule MMI_df_4)
   have S2: "𝟯 ∈ ℝ" by (rule MMI_3re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟯 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟰 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_5re: 
   shows "𝟱 ∈ ℝ"
proof -
   have S1: "𝟱 = 𝟰 \<ca> 𝟭" by (rule MMI_df_5)
   have S2: "𝟰 ∈ ℝ" by (rule MMI_4re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟰 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟱 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_6re: 
   shows "𝟲 ∈ ℝ"
proof -
   have S1: "𝟲 = 𝟱 \<ca> 𝟭" by (rule MMI_df_6)
   have S2: "𝟱 ∈ ℝ" by (rule MMI_5re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟱 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟲 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_7re: 
   shows "𝟳 ∈ ℝ"
proof -
   have S1: "𝟳 = 𝟲 \<ca> 𝟭" by (rule MMI_df_7)
   have S2: "𝟲 ∈ ℝ" by (rule MMI_6re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟲 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟳 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_8re: 
   shows "𝟴 ∈ ℝ"
proof -
   have S1: "𝟴 = 𝟳 \<ca> 𝟭" by (rule MMI_df_8)
   have S2: "𝟳 ∈ ℝ" by (rule MMI_7re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟳 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟴 ∈ ℝ" by (rule MMI_eqeltr)
qed

(************ 531-540*****************************)

lemma (in MMIsar0) MMI_9re: 
   shows "𝟵 ∈ ℝ"
proof -
   have S1: "𝟵 = 𝟴 \<ca> 𝟭" by (rule MMI_df_9)
   have S2: "𝟴 ∈ ℝ" by (rule MMI_8re)
   have S3: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S2 S3 have S4: "𝟴 \<ca> 𝟭 ∈ ℝ" by (rule MMI_readdcl)
   from S1 S4 show "𝟵 ∈ ℝ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_2pos: 
   shows "𝟬 \<ls> 𝟮"
proof -
   have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S5 S6 show "𝟬 \<ls> 𝟮" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_3pos: 
   shows "𝟬 \<ls> 𝟯"
proof -
   have S1: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟮 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S5 S6 show "𝟬 \<ls> 𝟯" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_4pos: 
   shows "𝟬 \<ls> 𝟰"
proof -
   have S1: "𝟯 ∈ ℝ" by (rule MMI_3re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟯" by (rule MMI_3pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟯 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟰 = 𝟯 \<ca> 𝟭" by (rule MMI_df_4)
   from S5 S6 show "𝟬 \<ls> 𝟰" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_5pos: 
   shows "𝟬 \<ls> 𝟱"
proof -
   have S1: "𝟰 ∈ ℝ" by (rule MMI_4re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟰" by (rule MMI_4pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟰 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟱 = 𝟰 \<ca> 𝟭" by (rule MMI_df_5)
   from S5 S6 show "𝟬 \<ls> 𝟱" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_6pos: 
   shows "𝟬 \<ls> 𝟲"
proof -
   have S1: "𝟱 ∈ ℝ" by (rule MMI_5re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟱" by (rule MMI_5pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟱 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟲 = 𝟱 \<ca> 𝟭" by (rule MMI_df_6)
   from S5 S6 show "𝟬 \<ls> 𝟲" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_7pos: 
   shows "𝟬 \<ls> 𝟳"
proof -
   have S1: "𝟲 ∈ ℝ" by (rule MMI_6re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟲" by (rule MMI_6pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟲 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟳 = 𝟲 \<ca> 𝟭" by (rule MMI_df_7)
   from S5 S6 show "𝟬 \<ls> 𝟳" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_8pos: 
   shows "𝟬 \<ls> 𝟴"
proof -
   have S1: "𝟳 ∈ ℝ" by (rule MMI_7re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟳" by (rule MMI_7pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟳 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟴 = 𝟳 \<ca> 𝟭" by (rule MMI_df_8)
   from S5 S6 show "𝟬 \<ls> 𝟴" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_9pos: 
   shows "𝟬 \<ls> 𝟵"
proof -
   have S1: "𝟴 ∈ ℝ" by (rule MMI_8re)
   have S2: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S3: "𝟬 \<ls> 𝟴" by (rule MMI_8pos)
   have S4: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   from S1 S2 S3 S4 have S5: "𝟬 \<ls> 𝟴 \<ca> 𝟭" by (rule MMI_addgt0i)
   have S6: "𝟵 = 𝟴 \<ca> 𝟭" by (rule MMI_df_9)
   from S5 S6 show "𝟬 \<ls> 𝟵" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_2nn: 
   shows "𝟮 ∈ ℕ"
proof -
   have S1: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   have S2: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   have S3: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   have S4: "𝟭 ∈ ℕ ∧ 𝟭 ∈ ℕ ⟶ 
   𝟭 \<ca> 𝟭 ∈ ℕ" by (rule MMI_nnaddclt)
   from S2 S3 S4 have S5: "𝟭 \<ca> 𝟭 ∈ ℕ" by (rule MMI_mp2an)
   from S1 S5 show "𝟮 ∈ ℕ" by (rule MMI_eqeltr)
qed

(********** 541-560*************************)

lemma (in MMIsar0) MMI_3nn: 
   shows "𝟯 ∈ ℕ"
proof -
   have S1: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   have S2: "𝟮 ∈ ℕ" by (rule MMI_2nn)
   have S3: "𝟭 ∈ ℕ" by (rule MMI_1nn)
   have S4: "𝟮 ∈ ℕ ∧ 𝟭 ∈ ℕ ⟶ 
   𝟮 \<ca> 𝟭 ∈ ℕ" by (rule MMI_nnaddclt)
   from S2 S3 S4 have S5: "𝟮 \<ca> 𝟭 ∈ ℕ" by (rule MMI_mp2an)
   from S1 S5 show "𝟯 ∈ ℕ" by (rule MMI_eqeltr)
qed

lemma (in MMIsar0) MMI_2p2e4: 
   shows "𝟮 \<ca> 𝟮 = 𝟰"
proof -
   have S1: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S1 have S2: "𝟮 \<ca> 𝟮 = 𝟮 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S3: "𝟰 = 𝟯 \<ca> 𝟭" by (rule MMI_df_4)
   have S4: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S4 have S5: "𝟯 \<ca> 𝟭 = 𝟮 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S6: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S7: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S7 S8 have S9: "𝟮 \<ca> 𝟭 \<ca> 𝟭 = 𝟮 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_addass)
   from S3 S5 S9 have S10: "𝟰 = 𝟮 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_3eqtr)
   from S2 S10 show "𝟮 \<ca> 𝟮 = 𝟰" by (rule MMI_eqtr4)
qed

lemma (in MMIsar0) MMI_4nn: 
   shows "𝟰 ∈ ℕ"
proof -
   have S1: "𝟮 \<ca> 𝟮 = 𝟰" by (rule MMI_2p2e4)
   have S2: "𝟮 ∈ ℕ" by (rule MMI_2nn)
   have S3: "𝟮 ∈ ℕ" by (rule MMI_2nn)
   have S4: "𝟮 ∈ ℕ ∧ 𝟮 ∈ ℕ ⟶ 
   𝟮 \<ca> 𝟮 ∈ ℕ" by (rule MMI_nnaddclt)
   from S2 S3 S4 have S5: "𝟮 \<ca> 𝟮 ∈ ℕ" by (rule MMI_mp2an)
   from S1 S5 show "𝟰 ∈ ℕ" by (rule MMI_eqeltrr)
qed

lemma (in MMIsar0) MMI_2times: assumes A1: "A ∈ ℂ"   
   shows "𝟮⋅A = A \<ca> A"
proof -
   have S1: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S1 have S2: "𝟮⋅A = (𝟭 \<ca> 𝟭)⋅A" by (rule MMI_opreq1i)
   from A1 have S3: "A ∈ ℂ".
   from S3 have S4: "(𝟭 \<ca> 𝟭)⋅A = A \<ca> A" by (rule MMI_1p1times)
   from S2 S4 show "𝟮⋅A = A \<ca> A" by (rule MMI_eqtr)
qed

lemma (in MMIsar0) MMI_2timest: 
   shows "A ∈ ℂ ⟶ 𝟮⋅A = A \<ca> A"
proof -
   have S1: "A =  if(A ∈ ℂ, A, 𝟬) ⟶ 
   𝟮⋅A = 𝟮⋅( if(A ∈ ℂ, A, 𝟬))" by (rule MMI_opreq2)
   have S2: "A =  if(A ∈ ℂ, A, 𝟬) ⟶ 
   A =  if(A ∈ ℂ, A, 𝟬)" by (rule MMI_id)
   from S2 have S3: "A =  if(A ∈ ℂ, A, 𝟬) ⟶ 
   A =  if(A ∈ ℂ, A, 𝟬)" .
   from S2 S3 have S4: "A =  if(A ∈ ℂ, A, 𝟬) ⟶ 
   A \<ca> A = ( if(A ∈ ℂ, A, 𝟬)) \<ca> ( if(A ∈ ℂ, A, 𝟬))" by (rule MMI_opreq12d)
   from S1 S4 have S5: "A =  if(A ∈ ℂ, A, 𝟬) ⟶ 
   𝟮⋅A = A \<ca> A ⟷ 
   𝟮⋅( if(A ∈ ℂ, A, 𝟬)) = ( if(A ∈ ℂ, A, 𝟬)) \<ca> ( if(A ∈ ℂ, A, 𝟬))" by (rule MMI_eqeq12d)
   have S6: "𝟬 ∈ ℂ" by (rule MMI_0cn)
   from S6 have S7: " if(A ∈ ℂ, A, 𝟬) ∈ ℂ" by (rule MMI_elimel)
   from S7 have S8: "𝟮⋅( if(A ∈ ℂ, A, 𝟬)) = ( if(A ∈ ℂ, A, 𝟬)) \<ca> ( if(A ∈ ℂ, A, 𝟬))" by (rule MMI_2times)
   from S5 S8 show "A ∈ ℂ ⟶ 𝟮⋅A = A \<ca> A" by (rule MMI_dedth)
qed

lemma (in MMIsar0) MMI_times2: assumes A1: "A ∈ ℂ"   
   shows "A⋅𝟮 = A \<ca> A"
proof -
   from A1 have S1: "A ∈ ℂ".
   have S2: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   from S1 S2 have S3: "A⋅𝟮 = 𝟮⋅A" by (rule MMI_mulcom)
   from A1 have S4: "A ∈ ℂ".
   from S4 have S5: "𝟮⋅A = A \<ca> A" by (rule MMI_2times)
   from S3 S5 show "A⋅𝟮 = A \<ca> A" by (rule MMI_eqtr)
qed

lemma (in MMIsar0) MMI_3p2e5: 
   shows "𝟯 \<ca> 𝟮 = 𝟱"
proof -
   have S1: "𝟰 = 𝟯 \<ca> 𝟭" by (rule MMI_df_4)
   from S1 have S2: "𝟰 \<ca> 𝟭 = 𝟯 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟱 = 𝟰 \<ca> 𝟭" by (rule MMI_df_5)
   have S4: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S4 have S5: "𝟯 \<ca> 𝟮 = 𝟯 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S6: "𝟯 ∈ ℝ" by (rule MMI_3re)
   from S6 have S7: "𝟯 ∈ ℂ" by (rule MMI_recn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S7 S8 S9 have S10: "𝟯 \<ca> 𝟭 \<ca> 𝟭 = 𝟯 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_addass)
   from S5 S10 have S11: "𝟯 \<ca> 𝟮 = 𝟯 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_eqtr4)
   from S2 S3 S11 show "𝟯 \<ca> 𝟮 = 𝟱" by (rule MMI_3eqtr4r)
qed

lemma (in MMIsar0) MMI_3p3e6: 
   shows "𝟯 \<ca> 𝟯 = 𝟲"
proof -
   have S1: "𝟯 \<ca> 𝟮 = 𝟱" by (rule MMI_3p2e5)
   from S1 have S2: "𝟯 \<ca> 𝟮 \<ca> 𝟭 = 𝟱 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S3 have S4: "𝟯 \<ca> 𝟯 = 𝟯 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S5: "𝟯 ∈ ℝ" by (rule MMI_3re)
   from S5 have S6: "𝟯 ∈ ℂ" by (rule MMI_recn)
   have S7: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S7 S8 have S9: "𝟯 \<ca> 𝟮 \<ca> 𝟭 = 𝟯 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_addass)
   from S4 S9 have S10: "𝟯 \<ca> 𝟯 = 𝟯 \<ca> 𝟮 \<ca> 𝟭" by (rule MMI_eqtr4)
   have S11: "𝟲 = 𝟱 \<ca> 𝟭" by (rule MMI_df_6)
   from S2 S10 S11 show "𝟯 \<ca> 𝟯 = 𝟲" by (rule MMI_3eqtr4)
qed

lemma (in MMIsar0) MMI_4p2e6: 
   shows "𝟰 \<ca> 𝟮 = 𝟲"
proof -
   have S1: "𝟱 = 𝟰 \<ca> 𝟭" by (rule MMI_df_5)
   from S1 have S2: "𝟱 \<ca> 𝟭 = 𝟰 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟲 = 𝟱 \<ca> 𝟭" by (rule MMI_df_6)
   have S4: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S4 have S5: "𝟰 \<ca> 𝟮 = 𝟰 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S6: "𝟰 ∈ ℝ" by (rule MMI_4re)
   from S6 have S7: "𝟰 ∈ ℂ" by (rule MMI_recn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S7 S8 S9 have S10: "𝟰 \<ca> 𝟭 \<ca> 𝟭 = 𝟰 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_addass)
   from S5 S10 have S11: "𝟰 \<ca> 𝟮 = 𝟰 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_eqtr4)
   from S2 S3 S11 show "𝟰 \<ca> 𝟮 = 𝟲" by (rule MMI_3eqtr4r)
qed

lemma (in MMIsar0) MMI_4p3e7: 
   shows "𝟰 \<ca> 𝟯 = 𝟳"
proof -
   have S1: "𝟰 \<ca> 𝟮 = 𝟲" by (rule MMI_4p2e6)
   from S1 have S2: "𝟰 \<ca> 𝟮 \<ca> 𝟭 = 𝟲 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S3 have S4: "𝟰 \<ca> 𝟯 = 𝟰 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S5: "𝟰 ∈ ℝ" by (rule MMI_4re)
   from S5 have S6: "𝟰 ∈ ℂ" by (rule MMI_recn)
   have S7: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S7 S8 have S9: "𝟰 \<ca> 𝟮 \<ca> 𝟭 = 𝟰 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_addass)
   from S4 S9 have S10: "𝟰 \<ca> 𝟯 = 𝟰 \<ca> 𝟮 \<ca> 𝟭" by (rule MMI_eqtr4)
   have S11: "𝟳 = 𝟲 \<ca> 𝟭" by (rule MMI_df_7)
   from S2 S10 S11 show "𝟰 \<ca> 𝟯 = 𝟳" by (rule MMI_3eqtr4)
qed

lemma (in MMIsar0) MMI_4p4e8: 
   shows "𝟰 \<ca> 𝟰 = 𝟴"
proof -
   have S1: "𝟰 \<ca> 𝟯 = 𝟳" by (rule MMI_4p3e7)
   from S1 have S2: "𝟰 \<ca> 𝟯 \<ca> 𝟭 = 𝟳 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟰 = 𝟯 \<ca> 𝟭" by (rule MMI_df_4)
   from S3 have S4: "𝟰 \<ca> 𝟰 = 𝟰 \<ca> (𝟯 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S5: "𝟰 ∈ ℝ" by (rule MMI_4re)
   from S5 have S6: "𝟰 ∈ ℂ" by (rule MMI_recn)
   have S7: "𝟯 ∈ ℝ" by (rule MMI_3re)
   from S7 have S8: "𝟯 ∈ ℂ" by (rule MMI_recn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S8 S9 have S10: "𝟰 \<ca> 𝟯 \<ca> 𝟭 = 𝟰 \<ca> (𝟯 \<ca> 𝟭)" by (rule MMI_addass)
   from S4 S10 have S11: "𝟰 \<ca> 𝟰 = 𝟰 \<ca> 𝟯 \<ca> 𝟭" by (rule MMI_eqtr4)
   have S12: "𝟴 = 𝟳 \<ca> 𝟭" by (rule MMI_df_8)
   from S2 S11 S12 show "𝟰 \<ca> 𝟰 = 𝟴" by (rule MMI_3eqtr4)
qed

lemma (in MMIsar0) MMI_5p2e7: 
   shows "𝟱 \<ca> 𝟮 = 𝟳"
proof -
   have S1: "𝟲 = 𝟱 \<ca> 𝟭" by (rule MMI_df_6)
   from S1 have S2: "𝟲 \<ca> 𝟭 = 𝟱 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟳 = 𝟲 \<ca> 𝟭" by (rule MMI_df_7)
   have S4: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S4 have S5: "𝟱 \<ca> 𝟮 = 𝟱 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S6: "𝟱 ∈ ℝ" by (rule MMI_5re)
   from S6 have S7: "𝟱 ∈ ℂ" by (rule MMI_recn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S7 S8 S9 have S10: "𝟱 \<ca> 𝟭 \<ca> 𝟭 = 𝟱 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_addass)
   from S5 S10 have S11: "𝟱 \<ca> 𝟮 = 𝟱 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_eqtr4)
   from S2 S3 S11 show "𝟱 \<ca> 𝟮 = 𝟳" by (rule MMI_3eqtr4r)
qed

lemma (in MMIsar0) MMI_5p3e8: 
   shows "𝟱 \<ca> 𝟯 = 𝟴"
proof -
   have S1: "𝟱 \<ca> 𝟮 = 𝟳" by (rule MMI_5p2e7)
   from S1 have S2: "𝟱 \<ca> 𝟮 \<ca> 𝟭 = 𝟳 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S3 have S4: "𝟱 \<ca> 𝟯 = 𝟱 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S5: "𝟱 ∈ ℝ" by (rule MMI_5re)
   from S5 have S6: "𝟱 ∈ ℂ" by (rule MMI_recn)
   have S7: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S7 S8 have S9: "𝟱 \<ca> 𝟮 \<ca> 𝟭 = 𝟱 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_addass)
   from S4 S9 have S10: "𝟱 \<ca> 𝟯 = 𝟱 \<ca> 𝟮 \<ca> 𝟭" by (rule MMI_eqtr4)
   have S11: "𝟴 = 𝟳 \<ca> 𝟭" by (rule MMI_df_8)
   from S2 S10 S11 show "𝟱 \<ca> 𝟯 = 𝟴" by (rule MMI_3eqtr4)
qed

lemma (in MMIsar0) MMI_5p4e9: 
   shows "𝟱 \<ca> 𝟰 = 𝟵"
proof -
   have S1: "𝟱 \<ca> 𝟯 = 𝟴" by (rule MMI_5p3e8)
   from S1 have S2: "𝟱 \<ca> 𝟯 \<ca> 𝟭 = 𝟴 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟰 = 𝟯 \<ca> 𝟭" by (rule MMI_df_4)
   from S3 have S4: "𝟱 \<ca> 𝟰 = 𝟱 \<ca> (𝟯 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S5: "𝟱 ∈ ℝ" by (rule MMI_5re)
   from S5 have S6: "𝟱 ∈ ℂ" by (rule MMI_recn)
   have S7: "𝟯 ∈ ℝ" by (rule MMI_3re)
   from S7 have S8: "𝟯 ∈ ℂ" by (rule MMI_recn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S8 S9 have S10: "𝟱 \<ca> 𝟯 \<ca> 𝟭 = 𝟱 \<ca> (𝟯 \<ca> 𝟭)" by (rule MMI_addass)
   from S4 S10 have S11: "𝟱 \<ca> 𝟰 = 𝟱 \<ca> 𝟯 \<ca> 𝟭" by (rule MMI_eqtr4)
   have S12: "𝟵 = 𝟴 \<ca> 𝟭" by (rule MMI_df_9)
   from S2 S11 S12 show "𝟱 \<ca> 𝟰 = 𝟵" by (rule MMI_3eqtr4)
qed

lemma (in MMIsar0) MMI_6p2e8: 
   shows "𝟲 \<ca> 𝟮 = 𝟴"
proof -
   have S1: "𝟳 = 𝟲 \<ca> 𝟭" by (rule MMI_df_7)
   from S1 have S2: "𝟳 \<ca> 𝟭 = 𝟲 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟴 = 𝟳 \<ca> 𝟭" by (rule MMI_df_8)
   have S4: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S4 have S5: "𝟲 \<ca> 𝟮 = 𝟲 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S6: "𝟲 ∈ ℝ" by (rule MMI_6re)
   from S6 have S7: "𝟲 ∈ ℂ" by (rule MMI_recn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S7 S8 S9 have S10: "𝟲 \<ca> 𝟭 \<ca> 𝟭 = 𝟲 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_addass)
   from S5 S10 have S11: "𝟲 \<ca> 𝟮 = 𝟲 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_eqtr4)
   from S2 S3 S11 show "𝟲 \<ca> 𝟮 = 𝟴" by (rule MMI_3eqtr4r)
qed

lemma (in MMIsar0) MMI_6p3e9: 
   shows "𝟲 \<ca> 𝟯 = 𝟵"
proof -
   have S1: "𝟲 \<ca> 𝟮 = 𝟴" by (rule MMI_6p2e8)
   from S1 have S2: "𝟲 \<ca> 𝟮 \<ca> 𝟭 = 𝟴 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S3 have S4: "𝟲 \<ca> 𝟯 = 𝟲 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S5: "𝟲 ∈ ℝ" by (rule MMI_6re)
   from S5 have S6: "𝟲 ∈ ℂ" by (rule MMI_recn)
   have S7: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S6 S7 S8 have S9: "𝟲 \<ca> 𝟮 \<ca> 𝟭 = 𝟲 \<ca> (𝟮 \<ca> 𝟭)" by (rule MMI_addass)
   from S4 S9 have S10: "𝟲 \<ca> 𝟯 = 𝟲 \<ca> 𝟮 \<ca> 𝟭" by (rule MMI_eqtr4)
   have S11: "𝟵 = 𝟴 \<ca> 𝟭" by (rule MMI_df_9)
   from S2 S10 S11 show "𝟲 \<ca> 𝟯 = 𝟵" by (rule MMI_3eqtr4)
qed

lemma (in MMIsar0) MMI_7p2e9: 
   shows "𝟳 \<ca> 𝟮 = 𝟵"
proof -
   have S1: "𝟴 = 𝟳 \<ca> 𝟭" by (rule MMI_df_8)
   from S1 have S2: "𝟴 \<ca> 𝟭 = 𝟳 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_opreq1i)
   have S3: "𝟵 = 𝟴 \<ca> 𝟭" by (rule MMI_df_9)
   have S4: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S4 have S5: "𝟳 \<ca> 𝟮 = 𝟳 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S6: "𝟳 ∈ ℝ" by (rule MMI_7re)
   from S6 have S7: "𝟳 ∈ ℂ" by (rule MMI_recn)
   have S8: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   have S9: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S7 S8 S9 have S10: "𝟳 \<ca> 𝟭 \<ca> 𝟭 = 𝟳 \<ca> (𝟭 \<ca> 𝟭)" by (rule MMI_addass)
   from S5 S10 have S11: "𝟳 \<ca> 𝟮 = 𝟳 \<ca> 𝟭 \<ca> 𝟭" by (rule MMI_eqtr4)
   from S2 S3 S11 show "𝟳 \<ca> 𝟮 = 𝟵" by (rule MMI_3eqtr4r)
qed

lemma (in MMIsar0) MMI_2t2e4: 
   shows "𝟮⋅𝟮 = 𝟰"
proof -
   have S1: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   from S1 have S2: "𝟮⋅𝟮 = 𝟮 \<ca> 𝟮" by (rule MMI_2times)
   have S3: "𝟮 \<ca> 𝟮 = 𝟰" by (rule MMI_2p2e4)
   from S2 S3 show "𝟮⋅𝟮 = 𝟰" by (rule MMI_eqtr)
qed

lemma (in MMIsar0) MMI_3t2e6: 
   shows "𝟯⋅𝟮 = 𝟲"
proof -
   have S1: "𝟯 ∈ ℝ" by (rule MMI_3re)
   from S1 have S2: "𝟯 ∈ ℂ" by (rule MMI_recn)
   from S2 have S3: "𝟯⋅𝟮 = 𝟯 \<ca> 𝟯" by (rule MMI_times2)
   have S4: "𝟯 \<ca> 𝟯 = 𝟲" by (rule MMI_3p3e6)
   from S3 S4 show "𝟯⋅𝟮 = 𝟲" by (rule MMI_eqtr)
qed

lemma (in MMIsar0) MMI_3t3e9: 
   shows "𝟯⋅𝟯 = 𝟵"
proof -
   have S1: "𝟯 = 𝟮 \<ca> 𝟭" by (rule MMI_df_3)
   from S1 have S2: "𝟯⋅𝟯 = 𝟯⋅(𝟮 \<ca> 𝟭)" by (rule MMI_opreq2i)
   have S3: "𝟯 ∈ ℝ" by (rule MMI_3re)
   from S3 have S4: "𝟯 ∈ ℂ" by (rule MMI_recn)
   have S5: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S6: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S4 S5 S6 have S7: "𝟯⋅(𝟮 \<ca> 𝟭) = 𝟯⋅𝟮 \<ca> 𝟯⋅𝟭" by (rule MMI_adddi)
   have S8: "𝟯⋅𝟮 = 𝟲" by (rule MMI_3t2e6)
   from S4 have S9: "𝟯 ∈ ℂ" .
   from S9 have S10: "𝟯⋅𝟭 = 𝟯" by (rule MMI_mulid1)
   from S8 S10 have S11: "𝟯⋅𝟮 \<ca> 𝟯⋅𝟭 = 𝟲 \<ca> 𝟯" by (rule MMI_opreq12i)
   from S7 S11 have S12: "𝟯⋅(𝟮 \<ca> 𝟭) = 𝟲 \<ca> 𝟯" by (rule MMI_eqtr)
   have S13: "𝟲 \<ca> 𝟯 = 𝟵" by (rule MMI_6p3e9)
   from S2 S12 S13 show "𝟯⋅𝟯 = 𝟵" by (rule MMI_3eqtr)
qed

(******** 561-578 ********************)

lemma (in MMIsar0) MMI_ltdiv23i: assumes A1: "A ∈ ℝ" and
    A2: "B ∈ ℝ" and
    A3: "C ∈ ℝ" and
    A4: "𝟬 \<ls> B" and
    A5: "𝟬 \<ls> C"   
   shows "A\<cdiv>B \<ls> C ⟷ A\<cdiv>C \<ls> B"
proof -
   from A4 have S1: "𝟬 \<ls> B".
   from A5 have S2: "𝟬 \<ls> C".
   from A1 have S3: "A ∈ ℝ".
   from A2 have S4: "B ∈ ℝ".
   from A3 have S5: "C ∈ ℝ".
   from S3 S4 S5 have S6: "𝟬 \<ls> B ∧ 𝟬 \<ls> C ⟶ 
   A\<cdiv>B \<ls> C ⟷ A\<cdiv>C \<ls> B" by (rule MMI_ltdiv23)
   from S1 S2 S6 show "A\<cdiv>B \<ls> C ⟷ A\<cdiv>C \<ls> B" by (rule MMI_mp2an)
qed

lemma (in MMIsar0) MMI_4t2e8: 
   shows "𝟰⋅𝟮 = 𝟴"
proof -
   have S1: "𝟰 ∈ ℝ" by (rule MMI_4re)
   from S1 have S2: "𝟰 ∈ ℂ" by (rule MMI_recn)
   from S2 have S3: "𝟰⋅𝟮 = 𝟰 \<ca> 𝟰" by (rule MMI_times2)
   have S4: "𝟰 \<ca> 𝟰 = 𝟴" by (rule MMI_4p4e8)
   from S3 S4 show "𝟰⋅𝟮 = 𝟴" by (rule MMI_eqtr)
qed

lemma (in MMIsar0) MMI_4d2e2: 
   shows "𝟰\<cdiv>𝟮 = 𝟮"
proof -
   have S1: "𝟮⋅𝟮 = 𝟰" by (rule MMI_2t2e4)
   have S2: "𝟰 ∈ ℝ" by (rule MMI_4re)
   from S2 have S3: "𝟰 ∈ ℂ" by (rule MMI_recn)
   have S4: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S5: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S6: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S7: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S6 S7 have S8: "𝟮 ≠ 𝟬" by (rule MMI_gt0ne0i)
   from S3 S4 S5 S8 have S9: "𝟰\<cdiv>𝟮 = 𝟮 ⟷ 𝟮⋅𝟮 = 𝟰" by (rule MMI_divmul)
   from S1 S9 show "𝟰\<cdiv>𝟮 = 𝟮" by (rule MMI_mpbir)
qed

lemma (in MMIsar0) MMI_1lt2: 
   shows "𝟭 \<ls> 𝟮"
proof -
   have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   from S1 have S2: "𝟭 \<ls> 𝟭 \<ca> 𝟭" by (rule MMI_ltp1)
   have S3: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S2 S3 show "𝟭 \<ls> 𝟮" by (rule MMI_breqtrr)
qed

lemma (in MMIsar0) MMI_halfgt0: 
   shows "𝟬 \<ls> 𝟭\<cdiv>𝟮"
proof -
   have S1: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S2: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S1 S2 show "𝟬 \<ls> 𝟭\<cdiv>𝟮" by (rule MMI_recgt0i)
qed

lemma (in MMIsar0) MMI_halflt1: 
   shows "𝟭\<cdiv>𝟮 \<ls> 𝟭"
proof -
   have S1: "𝟭 ∈ ℂ" by (rule MMI_1cn)
   from S1 have S2: "𝟭\<cdiv>𝟭 = 𝟭" by (rule MMI_div1)
   have S3: "𝟭 \<ls> 𝟮" by (rule MMI_1lt2)
   from S2 S3 have S4: "𝟭\<cdiv>𝟭 \<ls> 𝟮" by (rule MMI_eqbrtr)
   have S5: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S6: "𝟭 ∈ ℝ" by (rule MMI_ax1re)
   have S7: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S8: "𝟬 \<ls> 𝟭" by (rule MMI_lt01)
   have S9: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S5 S6 S7 S8 S9 have S10: "𝟭\<cdiv>𝟭 \<ls> 𝟮 ⟷ 
   𝟭\<cdiv>𝟮 \<ls> 𝟭" by (rule MMI_ltdiv23i)
   from S4 S10 show "𝟭\<cdiv>𝟮 \<ls> 𝟭" by (rule MMI_mpbi)
qed

lemma (in MMIsar0) MMI_halfclt: 
   shows "A ∈ ℂ ⟶ 
   A\<cdiv>𝟮 ∈ ℂ"
proof -
   have S1: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S2: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S3: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S2 S3 have S4: "𝟮 ≠ 𝟬" by (rule MMI_gt0ne0i)
   have S5: "A ∈ ℂ ∧ 𝟮 ∈ ℂ ∧ 𝟮 ≠ 𝟬 ⟶ 
   A\<cdiv>𝟮 ∈ ℂ" by (rule MMI_divclt)
   from S1 S4 S5 show "A ∈ ℂ ⟶ 
   A\<cdiv>𝟮 ∈ ℂ" by (rule MMI_mp3an23)
qed

lemma (in MMIsar0) MMI_rehalfclt: 
   shows "A ∈ ℝ ⟶ A\<cdiv>𝟮 ∈ ℝ"
proof -
   have S1: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S2: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S3: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S2 S3 have S4: "𝟮 ≠ 𝟬" by (rule MMI_gt0ne0i)
   have S5: "A ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ 𝟮 ≠ 𝟬 ⟶ A\<cdiv>𝟮 ∈ ℝ" by (rule MMI_redivclt)
   from S1 S4 S5 show "A ∈ ℝ ⟶ A\<cdiv>𝟮 ∈ ℝ" by (rule MMI_mp3an23)
qed

lemma (in MMIsar0) MMI_half0t: 
   shows "A ∈ ℂ ⟶ 
   A\<cdiv>𝟮 = 𝟬 ⟷ A = 𝟬"
proof -
   have S1: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S2: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S3: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S2 S3 have S4: "𝟮 ≠ 𝟬" by (rule MMI_gt0ne0i)
   have S5: "A ∈ ℂ ∧ 𝟮 ∈ ℂ ∧ 𝟮 ≠ 𝟬 ⟶ 
   A\<cdiv>𝟮 = 𝟬 ⟷ A = 𝟬" by (rule MMI_diveq0t)
   from S1 S4 S5 show "A ∈ ℂ ⟶ 
   A\<cdiv>𝟮 = 𝟬 ⟷ A = 𝟬" by (rule MMI_mp3an23)
qed

lemma (in MMIsar0) MMI_halfpost: 
   shows "A ∈ ℝ ⟶ 
   𝟬 \<ls> A ⟷ A\<cdiv>𝟮 \<ls> A"
proof -
   have S1: "A =  if(A ∈ ℝ, A, 𝟬) ⟶ 
   𝟬 \<ls> A ⟷ 
   𝟬 \<ls> ( if(A ∈ ℝ, A, 𝟬))" by (rule MMI_breq2)
   have S2: "A =  if(A ∈ ℝ, A, 𝟬) ⟶ 
   A\<cdiv>(𝟭 \<ca> 𝟭) = ( if(A ∈ ℝ, A, 𝟬))\<cdiv>(𝟭 \<ca> 𝟭)" by (rule MMI_opreq1)
   have S3: "A =  if(A ∈ ℝ, A, 𝟬) ⟶ 
   A =  if(A ∈ ℝ, A, 𝟬)" by (rule MMI_id)
   from S2 S3 have S4: "A =  if(A ∈ ℝ, A, 𝟬) ⟶ 
   A\<cdiv>(𝟭 \<ca> 𝟭) \<ls> A ⟷ 
   ( if(A ∈ ℝ, A, 𝟬))\<cdiv>(𝟭 \<ca> 𝟭) \<ls> ( if(A ∈ ℝ, A, 𝟬))" by (rule MMI_breq12d)
   from S1 S4 have S5: "A =  if(A ∈ ℝ, A, 𝟬) ⟶ 
   (𝟬 \<ls> A ⟷ 
   A\<cdiv>(𝟭 \<ca> 𝟭) \<ls> A) ⟷ 
   𝟬 \<ls> ( if(A ∈ ℝ, A, 𝟬)) ⟷ 
   ( if(A ∈ ℝ, A, 𝟬))\<cdiv>(𝟭 \<ca> 𝟭) \<ls> ( if(A ∈ ℝ, A, 𝟬))" by (rule MMI_bibi12d)
   have S6: "𝟬 ∈ ℝ" by (rule MMI_0re)
   from S6 have S7: " if(A ∈ ℝ, A, 𝟬) ∈ ℝ" by (rule MMI_elimel)
   from S7 have S8: "𝟬 \<ls> ( if(A ∈ ℝ, A, 𝟬)) ⟷ 
   ( if(A ∈ ℝ, A, 𝟬))\<cdiv>(𝟭 \<ca> 𝟭) \<ls> ( if(A ∈ ℝ, A, 𝟬))" by (rule MMI_halfpos)
   from S5 S8 have S9: "A ∈ ℝ ⟶ 
   𝟬 \<ls> A ⟷ 
   A\<cdiv>(𝟭 \<ca> 𝟭) \<ls> A" by (rule MMI_dedth)
   have S10: "𝟮 = 𝟭 \<ca> 𝟭" by (rule MMI_df_2)
   from S10 have S11: "A\<cdiv>𝟮 = A\<cdiv>(𝟭 \<ca> 𝟭)" by auto (*rule MMI_opreq2i*)
   from S11 have S12: "A\<cdiv>𝟮 \<ls> A ⟷ 
   A\<cdiv>(𝟭 \<ca> 𝟭) \<ls> A" by (rule MMI_breq1i)
   from S9 S12 show "A ∈ ℝ ⟶ 
   𝟬 \<ls> A ⟷ A\<cdiv>𝟮 \<ls> A" by (rule MMI_syl6bbr)
qed

lemma (in MMIsar0) MMI_halfpos2t: 
   shows "A ∈ ℝ ⟶ 
   𝟬 \<ls> A ⟷ 𝟬 \<ls> A\<cdiv>𝟮"
proof -
   have S1: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S2: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   have S3: "A ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ 𝟬 \<ls> 𝟮 ⟶ 
   𝟬 \<ls> A ⟷ 𝟬 \<ls> A\<cdiv>𝟮" by (rule MMI_gt0divt)
   from S1 S2 S3 show "A ∈ ℝ ⟶ 
   𝟬 \<ls> A ⟷ 𝟬 \<ls> A\<cdiv>𝟮" by (rule MMI_mp3an23)
qed

lemma (in MMIsar0) MMI_halfnneg2t: 
   shows "A ∈ ℝ ⟶ 
   𝟬 \<lsq> A ⟷ 𝟬 \<lsq> A\<cdiv>𝟮"
proof -
   have S1: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S2: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   have S3: "A ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ 𝟬 \<ls> 𝟮 ⟶ 
   𝟬 \<lsq> A ⟷ 𝟬 \<lsq> A\<cdiv>𝟮" by (rule MMI_ge0divt)
   from S1 S2 S3 show "A ∈ ℝ ⟶ 
   𝟬 \<lsq> A ⟷ 𝟬 \<lsq> A\<cdiv>𝟮" by (rule MMI_mp3an23)
qed

lemma (in MMIsar0) MMI_2halvest: 
   shows "A ∈ ℂ ⟶ 
   A\<cdiv>𝟮 \<ca> A\<cdiv>𝟮 = A"
proof -
   have S1: "A ∈ ℂ ⟶ 𝟮⋅A = A \<ca> A" by (rule MMI_2timest)
   from S1 have S2: "A ∈ ℂ ⟶ 
   𝟮⋅A\<cdiv>𝟮 = (A \<ca> A)\<cdiv>𝟮" by (rule MMI_opreq1d)
   have S3: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   have S4: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S5: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   from S4 S5 have S6: "𝟮 ≠ 𝟬" by (rule MMI_gt0ne0i)
   have S7: "𝟮 ∈ ℂ ∧ A ∈ ℂ ∧ 𝟮 ≠ 𝟬 ⟶ 
   𝟮⋅A\<cdiv>𝟮 = A" by (rule MMI_divcan3t)
   from S3 S6 S7 have S8: "A ∈ ℂ ⟶ 
   𝟮⋅A\<cdiv>𝟮 = A" by (rule MMI_mp3an13)
   have S9: "𝟮 ∈ ℂ" by (rule MMI_2cn)
   from S6 have S10: "𝟮 ≠ 𝟬" .
   have S11: "(A ∈ ℂ ∧ A ∈ ℂ ∧ 𝟮 ∈ ℂ) ∧ 𝟮 ≠ 𝟬 ⟶ 
   (A \<ca> A)\<cdiv>𝟮 = A\<cdiv>𝟮 \<ca> A\<cdiv>𝟮" by (rule MMI_divdirt)
   from S10 S11 have S12: "A ∈ ℂ ∧ A ∈ ℂ ∧ 𝟮 ∈ ℂ ⟶ 
   (A \<ca> A)\<cdiv>𝟮 = A\<cdiv>𝟮 \<ca> A\<cdiv>𝟮" by (rule MMI_mpan2)
   from S9 S12 have S13: "A ∈ ℂ ∧ A ∈ ℂ ⟶ 
   (A \<ca> A)\<cdiv>𝟮 = A\<cdiv>𝟮 \<ca> A\<cdiv>𝟮" by (rule MMI_mp3an3)
   from S13 have S14: "A ∈ ℂ ⟶ 
   (A \<ca> A)\<cdiv>𝟮 = A\<cdiv>𝟮 \<ca> A\<cdiv>𝟮" by (rule MMI_anidms)
   from S2 S8 S14 show "A ∈ ℂ ⟶ 
   A\<cdiv>𝟮 \<ca> A\<cdiv>𝟮 = A" by (rule MMI_3eqtr3rd)
qed

lemma (in MMIsar0) MMI_nominpos: 
   shows "¬( ∃x∈ℝ. 𝟬 \<ls> x ∧ ¬( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x))"
proof -
   have S1: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   have S2: "𝟮 ∈ ℝ" by (rule MMI_2re)
   { fix x
     have S3: "(x ∈ ℝ ∧ 𝟮 ∈ ℝ) ∧ 𝟬 \<ls> x ∧ 𝟬 \<ls> 𝟮 ⟶ 𝟬 \<ls> x\<cdiv>𝟮" 
       by (rule MMI_divgt0t)
     from S3 have S4: "x ∈ ℝ ∧ 𝟮 ∈ ℝ ⟶ 
       𝟬 \<ls> x ∧ 𝟬 \<ls> 𝟮 ⟶ 𝟬 \<ls> x\<cdiv>𝟮" by (rule MMI_ex)
     from S2 S4 have S5: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ∧ 𝟬 \<ls> 𝟮 ⟶ 𝟬 \<ls> x\<cdiv>𝟮" by (rule MMI_mpan2)
     from S1 S5 have S6: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ⟶ 𝟬 \<ls> x\<cdiv>𝟮" by (rule MMI_mpan2i)
     have S7: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ⟷ x\<cdiv>𝟮 \<ls> x" by (rule MMI_halfpost)
     from S7 have S8: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ⟶ x\<cdiv>𝟮 \<ls> x" by (rule MMI_biimpd)
     from S6 S8 have S9: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ⟶ 
       𝟬 \<ls> x\<cdiv>𝟮 ∧ x\<cdiv>𝟮 \<ls> x" by (rule MMI_jcad)
     have S10: "x ∈ ℝ ⟶ x\<cdiv>𝟮 ∈ ℝ" by (rule MMI_rehalfclt)
     from S9 S10 have S11: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ⟶ 
       x\<cdiv>𝟮 ∈ ℝ ∧ 𝟬 \<ls> x\<cdiv>𝟮 ∧ x\<cdiv>𝟮 \<ls> x" by (rule MMI_jctild)
     have S12: "y = x\<cdiv>𝟮 ⟶ 
       𝟬 \<ls> y ⟷ 𝟬 \<ls> x\<cdiv>𝟮" by (rule MMI_breq2)
     have S13: "y = x\<cdiv>𝟮 ⟶ 
       y \<ls> x ⟷ x\<cdiv>𝟮 \<ls> x" by (rule MMI_breq1)
     from S12 S13 have S14: "y = x\<cdiv>𝟮 ⟶ 
       𝟬 \<ls> y ∧ y \<ls> x ⟷ 
       𝟬 \<ls> x\<cdiv>𝟮 ∧ x\<cdiv>𝟮 \<ls> x" by (rule MMI_anbi12d)
     from S14 have S15: "x\<cdiv>𝟮 ∈ ℝ ∧ 𝟬 \<ls> x\<cdiv>𝟮 ∧ x\<cdiv>𝟮 \<ls> x ⟶ 
       ( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x)" by auto (*rule MMI_rcla4ev*)
     from S11 S15 have S16: "x ∈ ℝ ⟶ 
       𝟬 \<ls> x ⟶ 
       ( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x)" by (rule MMI_syl6)
     have S17: "(𝟬 \<ls> x ⟶ 
       ( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x)) ⟷ 
       ¬(𝟬 \<ls> x ∧ ¬( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x))" by (rule MMI_iman)
     from S16 S17 have "x ∈ ℝ ⟶ 
       ¬(𝟬 \<ls> x ∧ ¬( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x))" by (rule MMI_sylib)
     } then have  S18: "∀ x. x ∈ ℝ ⟶ 
       ¬(𝟬 \<ls> x ∧ ¬( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x))" by simp
   from S18 show "¬( ∃x∈ℝ. 𝟬 \<ls> x ∧ ¬( ∃y∈ℝ. 𝟬 \<ls> y ∧ y \<ls> x))" 
     by (rule MMI_nrex)
qed

lemma (in MMIsar0) MMI_avglet: 
   shows "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ∨ (A \<ca> B)\<cdiv>𝟮 \<lsq> B"
proof -
   have S1: "𝟮⋅A ∈ ℝ ∧ A \<ca> B ∈ ℝ ⟶ 
   𝟮⋅A \<ls> A \<ca> B ⟷ 
   ¬(A \<ca> B \<lsq> 𝟮⋅A)" by (rule MMI_ltnlet)
   have S2: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S3: "𝟮 ∈ ℝ ∧ A ∈ ℝ ⟶ 𝟮⋅A ∈ ℝ" by (rule MMI_axmulrcl)
   from S2 S3 have S4: "A ∈ ℝ ⟶ 𝟮⋅A ∈ ℝ" by (rule MMI_mpan)
   from S4 have S5: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 𝟮⋅A ∈ ℝ" by (rule MMI_adantr)
   have S6: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<ca> B ∈ ℝ" by (rule MMI_axaddrcl)
   from S1 S5 S6 have S7: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   𝟮⋅A \<ls> A \<ca> B ⟷ 
   ¬(A \<ca> B \<lsq> 𝟮⋅A)" by (rule MMI_sylanc)
   have S8: "A ∈ ℝ ∧ B ∈ ℝ ∧ A ∈ ℝ ⟶ 
   A \<ls> B ⟷ A \<ca> A \<ls> A \<ca> B" by (rule MMI_ltadd2t)
   have S9: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A ∈ ℝ" by (rule MMI_pm3_26)
   have S10: "A ∈ ℝ ∧ B ∈ ℝ ⟶ B ∈ ℝ" by (rule MMI_pm3_27)
   from S9 have S11: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A ∈ ℝ" .
   from S8 S9 S10 S11 have S12: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ⟷ A \<ca> A \<ls> A \<ca> B" by (rule MMI_syl3anc)
   have S13: "A ∈ ℝ ∧ B ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ⟷ A \<ca> B \<ls> B \<ca> B" by (rule MMI_ltadd1t)
   from S9 have S14: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A ∈ ℝ" .
   from S10 have S15: "A ∈ ℝ ∧ B ∈ ℝ ⟶ B ∈ ℝ" .
   from S10 have S16: "A ∈ ℝ ∧ B ∈ ℝ ⟶ B ∈ ℝ" .
   from S13 S14 S15 S16 have S17: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ls> B ⟷ A \<ca> B \<ls> B \<ca> B" by (rule MMI_syl3anc)
   from S12 S17 have S18: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ca> A \<ls> A \<ca> B ⟷ A \<ca> B \<ls> B \<ca> B" by (rule MMI_bitr3d)
   have S19: "A ∈ ℝ ⟶ A ∈ ℂ" by (rule MMI_recnt)
   have S20: "A ∈ ℂ ⟶ 𝟮⋅A = A \<ca> A" by (rule MMI_2timest)
   from S19 S20 have S21: "A ∈ ℝ ⟶ 𝟮⋅A = A \<ca> A" by (rule MMI_syl)
   from S21 have S22: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 𝟮⋅A = A \<ca> A" by (rule MMI_adantr)
   from S22 have S23: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   𝟮⋅A \<ls> A \<ca> B ⟷ A \<ca> A \<ls> A \<ca> B" by (rule MMI_breq1d)
   have S24: "B ∈ ℝ ⟶ B ∈ ℂ" by (rule MMI_recnt)
   have S25: "B ∈ ℂ ⟶ 𝟮⋅B = B \<ca> B" by (rule MMI_2timest)
   from S24 S25 have S26: "B ∈ ℝ ⟶ 𝟮⋅B = B \<ca> B" by (rule MMI_syl)
   from S26 have S27: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 𝟮⋅B = B \<ca> B" by (rule MMI_adantl)
   from S27 have S28: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ca> B \<ls> 𝟮⋅B ⟷ A \<ca> B \<ls> B \<ca> B" by (rule MMI_breq2d)
   from S18 S23 S28 have S29: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   𝟮⋅A \<ls> A \<ca> B ⟷ A \<ca> B \<ls> 𝟮⋅B" by (rule MMI_3bitr4d)
   have S30: "A \<ca> B ∈ ℝ ∧ 𝟮⋅B ∈ ℝ ⟶ 
   A \<ca> B \<ls> 𝟮⋅B ⟶ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_ltlet)
   from S6 have S31: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<ca> B ∈ ℝ" .
   have S32: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S33: "𝟮 ∈ ℝ ∧ B ∈ ℝ ⟶ 𝟮⋅B ∈ ℝ" by (rule MMI_axmulrcl)
   from S32 S33 have S34: "B ∈ ℝ ⟶ 𝟮⋅B ∈ ℝ" by (rule MMI_mpan)
   from S34 have S35: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 𝟮⋅B ∈ ℝ" by (rule MMI_adantl)
   from S30 S31 S35 have S36: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ca> B \<ls> 𝟮⋅B ⟶ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_sylanc)
   from S29 S36 have S37: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   𝟮⋅A \<ls> A \<ca> B ⟶ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_sylbid)
   from S7 S37 have S38: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   ¬(A \<ca> B \<lsq> 𝟮⋅A) ⟶ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_sylbird)
   from S38 have S39: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   A \<ca> B \<lsq> 𝟮⋅A ∨ A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_orrd)
   have S40: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S41: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   have S42: "(A \<ca> B ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ A ∈ ℝ) ∧ 𝟬 \<ls> 𝟮 ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ⟷ 
   A \<ca> B \<lsq> 𝟮⋅A" by (rule MMI_ledivmult)
   from S41 S42 have S43: "A \<ca> B ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ A ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ⟷ 
   A \<ca> B \<lsq> 𝟮⋅A" by (rule MMI_mpan2)
   from S40 S43 have S44: "A \<ca> B ∈ ℝ ∧ A ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ⟷ 
   A \<ca> B \<lsq> 𝟮⋅A" by (rule MMI_mp3an2)
   from S6 have S45: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<ca> B ∈ ℝ" .
   from S9 have S46: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A ∈ ℝ" .
   from S44 S45 S46 have S47: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ⟷ 
   A \<ca> B \<lsq> 𝟮⋅A" by (rule MMI_sylanc)
   have S48: "𝟮 ∈ ℝ" by (rule MMI_2re)
   have S49: "𝟬 \<ls> 𝟮" by (rule MMI_2pos)
   have S50: "(A \<ca> B ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ B ∈ ℝ) ∧ 𝟬 \<ls> 𝟮 ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> B ⟷ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_ledivmult)
   from S49 S50 have S51: "A \<ca> B ∈ ℝ ∧ 𝟮 ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> B ⟷ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_mpan2)
   from S48 S51 have S52: "A \<ca> B ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> B ⟷ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_mp3an2)
   from S6 have S53: "A ∈ ℝ ∧ B ∈ ℝ ⟶ A \<ca> B ∈ ℝ" .
   from S10 have S54: "A ∈ ℝ ∧ B ∈ ℝ ⟶ B ∈ ℝ" .
   from S52 S53 S54 have S55: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> B ⟷ 
   A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_sylanc)
   from S47 S55 have S56: "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ∨ (A \<ca> B)\<cdiv>𝟮 \<lsq> B ⟷ 
   A \<ca> B \<lsq> 𝟮⋅A ∨ A \<ca> B \<lsq> 𝟮⋅B" by (rule MMI_orbi12d)
   from S39 S56 show "A ∈ ℝ ∧ B ∈ ℝ ⟶ 
   (A \<ca> B)\<cdiv>𝟮 \<lsq> A ∨ (A \<ca> B)\<cdiv>𝟮 \<lsq> B" by (rule MMI_mpbird)
qed

lemma (in MMIsar0) MMI_lbreu: 
   shows "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (∃!x. x∈S∧(∀y∈S. x \<lsq> y))"
proof -
  { fix x w
    have S1: "y = w ⟶ 
      x \<lsq> y ⟷ x \<lsq> w" by (rule MMI_breq2)
    from S1 have S2: "w ∈ S ⟶ 
      (∀y∈S. x \<lsq> y) ⟶ x \<lsq> w" by auto (*rule MMI_rcla4v*)
    have S3: "y = x ⟶ 
      w \<lsq> y ⟷ w \<lsq> x" by (rule MMI_breq2)
    from S3 have S4: "x ∈ S ⟶ 
      (∀y∈S. w \<lsq> y) ⟶ w \<lsq> x" by auto (*rule MMI_rcla4v*)
    from S2 S4 have S5: "x ∈ S ∧ w ∈ S ⟶ 
      (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x \<lsq> w ∧ w \<lsq> x" 
      by (rule MMI_im2anan9r)
    have S6: "S ⊆ℝ ⟶ 
      x ∈ S ⟶ x ∈ ℝ" by (rule MMI_ssel)
    have S7: "S ⊆ℝ ⟶ 
      w ∈ S ⟶ w ∈ ℝ" by (rule MMI_ssel)
    from S6 S7 have S8: "S ⊆ℝ ⟶ 
      x ∈ S ∧ w ∈ S ⟶ 
      x ∈ ℝ ∧ w ∈ ℝ" by (rule MMI_anim12d)
    from S8 have S9: "(x ∈ S ∧ w ∈ S) ∧ S ⊆ℝ ⟶ 
      x ∈ ℝ ∧ w ∈ ℝ" by (rule MMI_impcom)
    have S10: "x ∈ ℝ ∧ w ∈ ℝ ⟶ 
      x = w ⟷ x \<lsq> w ∧ w \<lsq> x" by (rule MMI_letri3t)
    from S9 S10 have S11: "(x ∈ S ∧ w ∈ S) ∧ S ⊆ℝ ⟶ 
      x = w ⟷ x \<lsq> w ∧ w \<lsq> x" by (rule MMI_syl)
    from S11 have S12: "(x ∈ S ∧ w ∈ S) ∧ S ⊆ℝ ⟶ 
      x \<lsq> w ∧ w \<lsq> x ⟶ x = w" by (rule MMI_biimprd)
    from S12 have S13: "x ∈ S ∧ w ∈ S ⟶ 
      S ⊆ℝ ⟶ 
      x \<lsq> w ∧ w \<lsq> x ⟶ x = w" by (rule MMI_ex)
    from S13 have S14: "x ∈ S ∧ w ∈ S ⟶ 
      x \<lsq> w ∧ w \<lsq> x ⟶ 
      S ⊆ℝ ⟶ x = w" by (rule MMI_com23)
    from S5 S14 have S15: "x ∈ S ∧ w ∈ S ⟶ 
      (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ 
      S ⊆ℝ ⟶ x = w" by (rule MMI_syld)
    from S15 have "S ⊆ℝ ⟶ 
      x ∈ S ∧ w ∈ S ⟶ 
      (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x = w" by (rule MMI_com3r)
  } then have S16: "∀x w . S ⊆ℝ ⟶ x ∈ S ∧ w ∈ S ⟶ 
      (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x = w" by auto
  from S16 have S17: "S ⊆ℝ ⟶ 
    (∀x∈S. ∀w∈S. (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x = w)" 
    by auto (*rule MMI_r19_21aivv*)
  from S17 have S18: "( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ S ⊆ℝ ⟶ 
    ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ (∀x∈S. ∀w∈S. (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x = w)" 
    by (rule MMI_anim2i)
  from S18 have S19: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
    ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ (∀x∈S. ∀w∈S. (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x = w)" 
    by (rule MMI_ancoms)
  have S20: "∀x. x = w ⟶  x \<lsq> y ⟷ w \<lsq> y" by auto (*rule MMI_breq1*)
  from S20 have S21: "∀ x. x = w ⟶ 
    (∀y∈S. x \<lsq> y) ⟷ (∀y∈S. w \<lsq> y)" by auto (*rule MMI_ralbidv*)
  from S21 have S22: "(∃!x. x∈S∧(∀y∈S. x \<lsq> y)) ⟷ 
    ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ (∀x∈S. ∀w∈S. (∀y∈S. x \<lsq> y) ∧ (∀y∈S. w \<lsq> y) ⟶ x = w)" 
     by auto  (*rule MMI_reu4*)
   from S19 S22 show "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     (∃!x. x∈S∧(∀y∈S. x \<lsq> y))" by auto (*rule MMI_sylibr*)
 qed

lemma (in MMIsar0) MMI_lbcl: 
   shows "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S"
proof -
   have S1: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (∃!x. x∈S∧(∀y∈S. x \<lsq> y))" by (rule MMI_lbreu)
   have S2: "(∃!x. x∈S∧(∀y∈S. x \<lsq> y)) ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ {x ∈ S. ∀y∈S. x \<lsq> y }" by (rule MMI_reucl2)
   have S3: "{x ∈ S. ∀y∈S. x \<lsq> y } ⊆S" by (rule MMI_ssrab2)
   from S3 have S4: "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_sseli)
   from S1 S2 S4 show "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_3syl)
qed

lemma (in MMIsar0) MMI_lble: 
   shows "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ A ∈ S ⟶ 
   (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A"
proof -
   have S1: "(∀y∈S. x \<lsq> y) ⟶ 
   (∀y. ∀y∈S. x \<lsq> y)" by (rule MMI_hbra1)
   { fix w
     have S2: "w ∈ S ⟶ (∀y. w ∈ S)" by (rule MMI_ax_17)
     from S1 S2 have S3: "w ∈ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀y. w ∈ {x ∈ S. ∀y∈S. x \<lsq> y })" by auto (*rule MMI_hbrab*)
     from S3 have "w ∈ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀y. w ∈ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" by (rule MMI_hbuni)
   } then have S4: "∀w. w ∈ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀y. w ∈ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" by simp
       (*have S5: "w ∈ <_ ⟶ (∀y. w ∈ <_)" by (rule MMI_ax_17)
       have S6: "w ∈ A ⟶ (∀y. w ∈ A)" by (rule MMI_ax_17) *)
   have S7: "(⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A ⟶ 
     (∀y. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A)" by auto
   have S8: "y = A ⟶ 
     (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y ⟷ 
     (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by (rule MMI_breq2)
   from S7 S8 have S9: "A ∈ S ⟶ 
     (∀y∈S. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y) ⟶ 
     (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by auto (*rule MMI_rcla4*)
   from S9 have S10: "A ∈ S ∧ (∀y∈S. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y) ⟶ 
     (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by (rule MMI_imp)
   have S11: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     (∃!x. x∈S∧(∀y∈S. x \<lsq> y))" by (rule MMI_lbreu)
   have S12: "x = w ⟶ 
     x \<lsq> y ⟷ w \<lsq> y" by (rule MMI_breq1)
   from S12 have S13: "x = w ⟶ 
     (∀y∈S. x \<lsq> y) ⟷ (∀y∈S. w \<lsq> y)" by auto (*rule MMI_ralbidv*)
   from S13 have S14: "(∃!x. x∈S∧(∀y∈S. x \<lsq> y)) ⟷ 
     (∃!w. w∈S∧(∀y∈S. w \<lsq> y))" by auto (*rule MMI_cbvreuv*)
   from S11 S14 have S15: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     (∃!w. w∈S∧(∀y∈S. w \<lsq> y))" by (rule MMI_sylib)
   { fix w x
     have S16: "w = x ⟶ 
       w \<lsq> y ⟷ x \<lsq> y" by (rule MMI_breq1)
     from S16 have "w = x ⟶ 
       (∀y∈S. w \<lsq> y) ⟷ (∀y∈S. x \<lsq> y)" by auto (*rule MMI_ralbidv*)
   } then have S17: "∀w x. w = x ⟶ 
       (∀y∈S. w \<lsq> y) ⟷ (∀y∈S. x \<lsq> y)" by simp
   from S4 have S18: "∀ w. w ∈ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
   (∀y. w ∈ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" .
   from S18 have S19: "∀w. w = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
   (∀y. w = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" by auto (*rule MMI_hbeleq*)
   { fix w
     have S20: "w = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       w \<lsq> y ⟷ 
       (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y" by (rule MMI_breq1)
     from S19 S20 have "w = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀y∈S. w \<lsq> y) ⟷ 
       (∀y∈S. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y)" by auto (*rule MMI_ralbid*)
   } then have S21: "∀ w. w = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀y∈S. w \<lsq> y) ⟷ 
       (∀y∈S. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y)" by simp
   from S17 S21 have S22: "(∃!w. w∈S∧(∀y∈S. w \<lsq> y)) ⟶ 
   (∀y∈S. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y)" by (rule MMI_reuuni3)
   from S15 S22 have S23: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (∀y∈S. (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> y)" by (rule MMI_syl)
   from S10 S23 have S24: "A ∈ S ∧ S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by (rule MMI_sylan2)
   from S24 have S25: "A ∈ S ∧ S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by (rule MMI_3impb)
   from S25 show "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ A ∈ S ⟶ 
   (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by (rule MMI_3coml)
qed

(************* proven by hand **********************)

lemma (in MMIsar0) MMI_df_sup: shows
  "Sup(B,A,\<cltrrset>) = ⋃ {x ∈ A. (∀y∈B. ¬(x\<ls>y) ) ∧ 
  (∀y∈A. y\<ls>x  ⟶ (∃z∈B. y\<ls>z))}"
  using Sup_def cltrr_def by simp

(** not really in the Metamath, but needed **)

lemma (in MMIsar0) MMI_df_inf: shows
  "Sup(B,A,converse(\<cltrrset>)) = ⋃ {x ∈ A. (∀y∈B. ¬(x > y) ) ∧ 
  (∀y∈A. y > x  ⟶ (∃z∈B. y > z))}"
  using Sup_def convcltrr_def by simp

(********* 579 ******************************)

lemma (in MMIsar0) MMI_lbinfm: 
   shows "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
    Sup(S,ℝ,converse(\<cltrrset>))  = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }"
proof -
  { fix z
    have S1: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ z ∈ S ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> z" by (rule MMI_lble)
    from S1 have S2: "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> z" by (rule MMI_3expa)
    have S3: "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ ∧ z ∈ ℝ ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> z ⟷ 
      ¬(z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }))" by (rule MMI_lenltt)
    have S4: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
      ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_lbcl)
    have S5: "S ⊆ℝ ∧ ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S ⟶ 
      ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by (rule MMI_ssel2)
    from S4 S5 have S6: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
      ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by (rule MMI_syldan)
    from S6 have S7: "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
      ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by (rule MMI_adantr)
    have S8: "S ⊆ℝ ∧ z ∈ S ⟶ z ∈ ℝ" by (rule MMI_ssel2)
    from S8 have S9: "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ z ∈ ℝ" 
      by (rule MMI_adantlr)
    from S3 S7 S9 have S10: "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> z ⟷ 
      ¬(z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }))" by (rule MMI_sylanc)
    from S2 S10 have S11: "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
      ¬(z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }))" by (rule MMI_mpbid)
    have S12: "ℝ = ℝ" by (rule MMI_reex)
    from S12 have S13: "S ⊆ℝ ⟶ S = S" by (rule MMI_ssex)
    have S14: "S = S ⟶ 
      {x ∈ S. ∀y∈S. x \<lsq> y } = {x ∈ S. ∀y∈S. x \<lsq> y }" by auto (*rule MMI_rabexg*)
    from S13 S14 have S15: "S ⊆ℝ ⟶ 
      {x ∈ S. ∀y∈S. x \<lsq> y } = {x ∈ S. ∀y∈S. x \<lsq> y }" by (rule MMI_syl)
    have S16: "{x ∈ S. ∀y∈S. x \<lsq> y } = {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
      ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
      by auto(*rule MMI_uniexg*)
      (*have S17: "z = z" by simp;*) (*rule MMI_visset*)
    have S18: "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∧ z = z ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z ⟷ 
      z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" by (rule MMI_brcnvg)
    from S18 have S19: "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ V ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z ⟷ 
      z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" by auto (*rule MMI_mpan2*)
    from S15 S16 S19 have S20: "S ⊆ℝ ⟶ 
      (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z ⟷ 
      z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" 
      using cltrr_def convcltrr_def converse_iff by auto(*rule MMI_3syl*)
    from S20 have S21: "S ⊆ℝ ⟶ 
      ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z) ⟷ 
      ¬(z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }))" by (rule MMI_negbid)
    from S21 have S22: "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
      ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z) ⟷ 
      ¬(z \<ls> (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }))" by (rule MMI_ad2antrr)
    from S11 S22 have "(S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
      ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)" by (rule MMI_mpbird)
    } then have S23: "∀z. (S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y)) ∧ z ∈ S ⟶ 
	¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)" by simp
     from S23 have S24: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
       (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z))" by (rule MMI_r19_21aiva)
   have S25: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_lbcl)
   { fix z
     from S25 have S26: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
       z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ 
       ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_a1d)
     from S26 have S27: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
       z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ 
       ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S ∧ z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" 
       by (rule MMI_ancrd)
     have S28: "w = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶  z > w ⟷ 
       z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" by auto (*rule MMI_breq2*)
     from S28 have S29: 
       "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S ∧ z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w)" 
       by auto (*rule MMI_rcla4ev*)
     from S27 S29 have S30: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
       z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w)" by (rule MMI_syl6)
     from S30 have "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
       z ∈ ℝ ⟶  z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w)" 
       by (rule MMI_a1d)
   } then have S31: "∀ z. S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
       z ∈ ℝ ⟶  z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w)" by simp
       (*{ fix v
       { fix z*)
   from S31 have S32: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" 
     by (rule MMI_r19_21aiv)
   from S24 S32 have S33: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ 
     ( ∃w∈S. z > w))" by (rule MMI_jca)
   { fix v
     { fix z 
       have S34: "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶  v > z ⟷  
	 (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z" by auto (*rule MMI_breq1*)
       from S34 have "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
	 ¬(v > z) ⟷ 
	 ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)" by (rule MMI_negbid)
     } then have S35: "∀ z. v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
	 ¬(v > z) ⟷  ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)" by simp
     from S35 have S36: "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀z∈S. ¬(v > z)) ⟷ 
       (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z))" by (rule MMI_ralbidv)
     { fix z
       have S37: "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
	 z > v ⟷   z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y })" 
	 by auto (*rule MMI_breq2*)
       from S37 have S38: "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
	 (z > v ⟶ ( ∃w∈S. z > w)) ⟷ 
	 (z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" 
	 by (rule MMI_imbi1d)
     } then have S38: "∀z. v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
	 (z > v ⟶ ( ∃w∈S. z > w)) ⟷ 
	 (z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" by simp
     from S38 have S39: "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) ⟷ 
       (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" 
       by auto (*rule MMI_ralbidv*)
     from S36 S39 have "v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) ⟷ 
       (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
       (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" 
       by (rule MMI_anbi12d)
   } then have S40: "∀v. v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
       (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) ⟷ 
       (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
       (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" by simp
   from S40 have S41: "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ ∧ 
     (∃!v. v∈ℝ∧(∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w))) ⟶ 
     (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
     (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ 
     ( ∃w∈S. z > w)) ⟷ 
     ⋃ {v ∈ ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) } = 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
     by (rule MMI_reuuni2)
   have S42: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_lbcl)
   have S43: "S ⊆ℝ ⟶ 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S ⟶ 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by (rule MMI_ssel)
   from S43 have S44: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S ⟶ 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by (rule MMI_adantr)
   from S42 S44 have S45: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by (rule MMI_mpd)
   from S40 have S46: "∀v. v = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ⟶ 
   (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) ⟷ 
   (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
     (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" .
   from S46 have S47: 
     "⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ ∧ 
     (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
     (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w)) ⟶ 
   ( ∃v∈ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)))" 
     by (rule MMI_rcla4ev)
   from S45  have S48: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ ℝ" by auto
   from S33 have S49: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
     (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w))" by auto
   from S47 S48 S49 have S50: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   ( ∃v∈ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)))" 
     by (rule MMI_sylanc)
   have S51: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   have S52: "\<cltrrset> Orders ℝ ⟷ converse(\<cltrrset>) Orders ℝ" 
     by (rule MMI_cnvso)
   from S51 S52 have S53: "converse(\<cltrrset>) Orders ℝ" by (rule MMI_mpbi)
   from S53 have S54: "( ∃v∈ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ 
     ( ∃w∈S. z > w))) ⟶ (∃!v. v∈ℝ∧(∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ 
     ( ∃w∈S. z > w)))" 
     by (rule MMI_infeu)
   from S50 S54 have S55: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (∃!v. v∈ℝ∧(∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)))" 
     by (rule MMI_syl)
   from S41 S45 S55 have S56: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
   (∀z∈S. ¬((⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) > z)) ∧ 
     (∀z∈ℝ. z > (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) ⟶ ( ∃w∈S. z > w)) ⟷ 
   ⋃ {v ∈ ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) } = 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
     by (rule MMI_sylanc)
   from S33 S56 have S57: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
     ⋃ {v ∈ ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) } = 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
     by (rule MMI_mpbid)
   have S58: 
     "Sup(S,ℝ,converse(\<cltrrset>))  = 
     ⋃ {v ∈ ℝ. (∀z∈S. ¬(v > z)) ∧ (∀z∈ℝ. z > v ⟶ ( ∃w∈S. z > w)) }" 
     by (rule MMI_df_inf)
   from S57 S58 show "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
    Sup(S,ℝ,converse(\<cltrrset>))  = 
     ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" by (rule MMI_syl5eq)
qed

(******** 580-581*******************************)

lemma (in MMIsar0) MMI_lbinfmcl: 
  shows 
  "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶  
  Sup(S,ℝ,converse(\<cltrrset>)) ∈ S"
proof -
  have S1: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
    Sup(S,ℝ,converse(\<cltrrset>))  = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
    by (rule MMI_lbinfm)
  have S2: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
    ⋃ {x ∈ S. ∀y∈S. x \<lsq> y } ∈ S" by (rule MMI_lbcl)
  from S1 S2 show 
    "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶  Sup(S,ℝ,converse(\<cltrrset>))  ∈ S"
    by (rule MMI_eqeltrd)
qed

lemma (in MMIsar0) MMI_lbinfmle: 
   shows 
  "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ A ∈ S ⟶  
  Sup(S,ℝ,converse(\<cltrrset>))  \<lsq> A"
proof -
  have S1: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ⟶ 
    Sup(S,ℝ,converse(\<cltrrset>))  = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
    by (rule MMI_lbinfm)
  from S1 have S2: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ A ∈ S ⟶ 
    Sup(S,ℝ,converse(\<cltrrset>)) = ⋃ {x ∈ S. ∀y∈S. x \<lsq> y }" 
    by (rule MMI_3adant3)
  have S3: "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ A ∈ S ⟶ 
    (⋃ {x ∈ S. ∀y∈S. x \<lsq> y }) \<lsq> A" by (rule MMI_lble)
  from S2 S3 show 
    "S ⊆ℝ ∧ ( ∃x∈S. ∀y∈S. x \<lsq> y) ∧ A ∈ S ⟶  
    Sup(S,ℝ,converse(\<cltrrset>))  \<lsq> A" 
    by (rule MMI_eqbrtrd)
qed

(******** 582 ***********************************)

lemma (in MMIsar0) MMI_sup2: 
   shows "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))"
proof -
  { fix x
    have S1: "x ∈ ℝ ⟶ x \<ca> 𝟭 ∈ ℝ" by (rule MMI_peano2re)
    from S1 have S2: "x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x) ⟶ x \<ca> 𝟭 ∈ ℝ" by (rule MMI_adantr)
    from S2 have S3: "A ⊆ℝ ⟶ 
      x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x) ⟶ x \<ca> 𝟭 ∈ ℝ" by (rule MMI_a1i)
    { fix y
      have S4: "A ⊆ℝ ⟶ 
	y ∈ A ⟶ y ∈ ℝ" by (rule MMI_ssel)
      have S5: "y ∈ ℝ ∧ x ∈ ℝ ∧ x \<ca> 𝟭 ∈ ℝ ⟶ 
	y \<ls> x ∧ x \<ls> x \<ca> 𝟭 ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_axlttrn)
      from S5 have S6: "y ∈ ℝ ∧ x ∈ ℝ ∧ x \<ca> 𝟭 ∈ ℝ ⟶ 
	y \<ls> x ∧ x \<ls> x \<ca> 𝟭 ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_3expb)
      from S1 have S7: "x ∈ ℝ ⟶ x \<ca> 𝟭 ∈ ℝ" .
      from S7 have S8: "x ∈ ℝ ⟶ 
	x ∈ ℝ ∧ x \<ca> 𝟭 ∈ ℝ" by (rule MMI_ancli)
      from S6 S8 have S9: "y ∈ ℝ ∧ x ∈ ℝ ⟶ 
	y \<ls> x ∧ x \<ls> x \<ca> 𝟭 ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_sylan2)
      have S10: "x ∈ ℝ ⟶ x \<ls> x \<ca> 𝟭" by (rule MMI_ltp1t)
      from S9 S10 have S11: "y ∈ ℝ ∧ x ∈ ℝ ⟶ 
	y \<ls> x ∧ x ∈ ℝ ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_sylan2i)
      from S11 have S12: "y ∈ ℝ ⟶ 
	x ∈ ℝ ⟶ 
	y \<ls> x ⟶ 
	x ∈ ℝ ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_exp4b)
      from S12 have S13: "y ∈ ℝ ⟶ 
	x ∈ ℝ ⟶ 
	x ∈ ℝ ⟶ 
	y \<ls> x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_com34)
      from S13 have S14: "y ∈ ℝ ⟶ 
	x ∈ ℝ ⟶ 
	y \<ls> x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_pm2_43d)
      from S14 have S15: "y ∈ ℝ ∧ x ∈ ℝ ⟶ 
	y \<ls> x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_imp)
      from S10 have S16: "x ∈ ℝ ⟶ x \<ls> x \<ca> 𝟭" .
      have S17: "y = x ⟶ 
	y \<ls> x \<ca> 𝟭 ⟷ x \<ls> x \<ca> 𝟭" by (rule MMI_breq1)
      from S17 have S18: "x \<ls> x \<ca> 𝟭 ⟶ 
	y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_biimprcd)
      from S16 S18 have S19: "x ∈ ℝ ⟶ 
	y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_syl)
      from S19 have S20: "y ∈ ℝ ∧ x ∈ ℝ ⟶ 
	y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_adantl)
      from S15 S20 have S21: "y ∈ ℝ ∧ x ∈ ℝ ⟶ 
	y \<ls> x ∨ y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_jaod)
      from S21 have S22: "y ∈ ℝ ⟶ 
	x ∈ ℝ ⟶ 
	y \<ls> x ∨ y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_ex)
      from S4 S22 have S23: "A ⊆ℝ ⟶ 
	y ∈ A ⟶ 
	x ∈ ℝ ⟶ 
	y \<ls> x ∨ y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_syl6)
      from S23 have S24: "A ⊆ℝ ⟶ 
	x ∈ ℝ ⟶ 
	y ∈ A ⟶ 
	y \<ls> x ∨ y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_com23)
      from S24 have S25: "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
	y ∈ A ⟶ 
	y \<ls> x ∨ y = x ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_imp)
      from S25 have "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
	(y ∈ A ⟶ y \<ls> x ∨ y = x) ⟶ 
	y ∈ A ⟶ y \<ls> x \<ca> 𝟭" by (rule MMI_a2d)
    } then have S26: "∀ y. A ⊆ℝ ∧ x ∈ ℝ ⟶ 
	(y ∈ A ⟶ y \<ls> x ∨ y = x) ⟶ 
	y ∈ A ⟶ y \<ls> x \<ca> 𝟭" by simp
    from S26 have S27: "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
      (∀y. y ∈ A ⟶ y \<ls> x ∨ y = x) ⟶ 
      (∀y. y ∈ A ⟶ y \<ls> x \<ca> 𝟭)" by (rule MMI_19_20dv)
    have S28: "(∀y∈A. y \<ls> x ∨ y = x) ⟷ 
      (∀y. y ∈ A ⟶ y \<ls> x ∨ y = x)" by (rule MMI_df_ral)
    have S29: "(∀y∈A. y \<ls> x \<ca> 𝟭) ⟷ 
      (∀y. y ∈ A ⟶ y \<ls> x \<ca> 𝟭)" by (rule MMI_df_ral)
    from S27 S28 S29 have S30: "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
      (∀y∈A. y \<ls> x ∨ y = x) ⟶ 
      (∀y∈A. y \<ls> x \<ca> 𝟭)" by (rule MMI_3imtr4g)
    from S30 have S31: "A ⊆ℝ ⟶ 
      x ∈ ℝ ⟶ 
      (∀y∈A. y \<ls> x ∨ y = x) ⟶ 
      (∀y∈A. y \<ls> x \<ca> 𝟭)" by (rule MMI_ex)
    from S31 have S32: "A ⊆ℝ ⟶ 
      x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x) ⟶ 
      (∀y∈A. y \<ls> x \<ca> 𝟭)" by (rule MMI_imp3a)
    from S3 S32 have S33: "A ⊆ℝ ⟶ 
      x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x) ⟶ 
      x \<ca> 𝟭 ∈ ℝ ∧ (∀y∈A. y \<ls> x \<ca> 𝟭)" by (rule MMI_jcad)
    have S34: "x \<ca> 𝟭 = x \<ca> 𝟭" by auto (*rule MMI_oprex*)
    have S35: "z = x \<ca> 𝟭 ⟶ 
      z ∈ ℝ ⟷ x \<ca> 𝟭 ∈ ℝ" by (rule MMI_eleq1)
    have S36: "z = x \<ca> 𝟭 ⟶ 
      y \<ls> z ⟷ y \<ls> x \<ca> 𝟭" by (rule MMI_breq2)
    from S36 have S37: "z = x \<ca> 𝟭 ⟶ 
      (∀y∈A. y \<ls> z) ⟷ 
      (∀y∈A. y \<ls> x \<ca> 𝟭)" by auto (*rule MMI_ralbidv*)
    from S35 S37 have S38: "z = x \<ca> 𝟭 ⟶ 
      z ∈ ℝ ∧ (∀y∈A. y \<ls> z) ⟷ 
      x \<ca> 𝟭 ∈ ℝ ∧ (∀y∈A. y \<ls> x \<ca> 𝟭)" by (rule MMI_anbi12d)
    from S34 S38 have S39: "x \<ca> 𝟭 ∈ ℝ ∧ (∀y∈A. y \<ls> x \<ca> 𝟭) ⟶ 
      ( ∃z. z ∈ ℝ ∧ (∀y∈A. y \<ls> z))" by auto (*rule MMI_cla4ev*)
    from S33 S39 have "A ⊆ℝ ⟶ 
      x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x) ⟶ 
      ( ∃z. z ∈ ℝ ∧ (∀y∈A. y \<ls> z))" by (rule MMI_syl6)
  } then have S40: "∀ x. A ⊆ℝ ⟶ 
      x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x) ⟶ 
      ( ∃z. z ∈ ℝ ∧ (∀y∈A. y \<ls> z))" by auto
  from S40 have S41: "A ⊆ℝ ⟶ 
    ( ∃x. x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x)) ⟶ 
    ( ∃z. z ∈ ℝ ∧ (∀y∈A. y \<ls> z))" by (rule MMI_19_23adv)
  have S42: "z = x ⟶ 
    z ∈ ℝ ⟷ x ∈ ℝ" by (rule MMI_eleq1)
  have S43: "z = x ⟶ 
    y \<ls> z ⟷ y \<ls> x" by (rule MMI_breq2)
  from S43 have S44: "z = x ⟶ 
    (∀y∈A. y \<ls> z) ⟷ (∀y∈A. y \<ls> x)" by auto (*rule MMI_ralbidv*)
  from S42 S44 have S45: "z = x ⟶ 
    z ∈ ℝ ∧ (∀y∈A. y \<ls> z) ⟷ 
    x ∈ ℝ ∧ (∀y∈A. y \<ls> x)" by (rule MMI_anbi12d)
  from S45 have S46: "( ∃z. z ∈ ℝ ∧ (∀y∈A. y \<ls> z)) ⟷ 
    ( ∃x. x ∈ ℝ ∧ (∀y∈A. y \<ls> x))" by auto (*rule MMI_cbvexv*)
  from S41 S46 have S47: "A ⊆ℝ ⟶ 
    ( ∃x. x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x)) ⟶ 
   ( ∃x. x ∈ ℝ ∧ (∀y∈A. y \<ls> x))" by (rule MMI_syl6ib)
   have S48: "( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟷ 
   ( ∃x. x ∈ ℝ ∧ (∀y∈A. y \<ls> x ∨ y = x))" by (rule MMI_df_rex)
   have S49: "( ∃x∈ℝ. ∀y∈A. y \<ls> x) ⟷ 
   ( ∃x. x ∈ ℝ ∧ (∀y∈A. y \<ls> x))" by (rule MMI_df_rex)
   from S47 S48 S49 have S50: "A ⊆ℝ ⟶ 
   ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   ( ∃x∈ℝ. ∀y∈A. y \<ls> x)" by (rule MMI_3imtr4g)
   from S50 have S51: "A ⊆ℝ ∧ A ≠ 0 ⟶ 
   ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   ( ∃x∈ℝ. ∀y∈A. y \<ls> x)" by (rule MMI_adantr)
   from S51 have S52: "(A ⊆ℝ ∧ A ≠ 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   (A ⊆ℝ ∧ A ≠ 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x)" by (rule MMI_imdistani)
   have S53: "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟷ 
   (A ⊆ℝ ∧ A ≠ 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_df_3an)
   have S54: "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x) ⟷ 
   (A ⊆ℝ ∧ A ≠ 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x)" by (rule MMI_df_3an)
   from S52 S53 S54 have S55: "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x)" by (rule MMI_3imtr4)
   have S56: "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_axsup)
   from S55 S56 show "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_syl)
qed

(************* 583 *************************)

lemma (in MMIsar0) MMI_sup3: 
   shows "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))"
proof -
   have S1: "A ≠ 0 ⟷ ¬(A = 0)" by (rule MMI_df_ne)
   from S1 have S2: "¬(A = 0) ⟷ A ≠ 0" by (rule MMI_bicomi)
   from S2 have S3: "A ⊆ℝ ⟶ 
   ¬(A = 0) ⟷ A ≠ 0" by (rule MMI_a1i)
   { fix x
     { fix y
       have S4: "A ⊆ℝ ⟶ 
	 y ∈ A ⟶ y ∈ ℝ" by (rule MMI_ssel)
       have S5: "y ∈ ℝ ∧ x ∈ ℝ ⟶ 
       y \<lsq> x ⟷ y \<ls> x ∨ y = x" by (rule MMI_leloet)
       from S5 have S6: "x ∈ ℝ ⟶ 
	 y ∈ ℝ ⟶ 
	 y \<lsq> x ⟷ y \<ls> x ∨ y = x" by (rule MMI_expcom)
       from S4 S6 have S7: "A ⊆ℝ ⟶ 
	 x ∈ ℝ ⟶ 
	 y ∈ A ⟶ 
	 y \<lsq> x ⟷ y \<ls> x ∨ y = x" by (rule MMI_syl9)
       from S7 have "(A ⊆ℝ ∧ x ∈ ℝ) ∧ y ∈ A ⟶ 
	 y \<lsq> x ⟷ y \<ls> x ∨ y = x" by (rule MMI_imp31)
     } then have S8: "∀y. (A ⊆ℝ ∧ x ∈ ℝ) ∧ y ∈ A ⟶ 
	 y \<lsq> x ⟷ y \<ls> x ∨ y = x" by simp
     from S8 have "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
       (∀y∈A. y \<lsq> x) ⟷ 
       (∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_ralbidva)
   } then have S9: "∀x. A ⊆ℝ ∧ x ∈ ℝ ⟶ 
       (∀y∈A. y \<lsq> x) ⟷ 
       (∀y∈A. y \<ls> x ∨ y = x)" by simp
   from S9 have S10: "A ⊆ℝ ⟶ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟷ 
     ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_rexbidva)
   from S3 S10 have S11: "A ⊆ℝ ⟶ 
     ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟷ 
     A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_anbi12d)
   from S11 have S12: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟷ 
     A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_pm5_32i)
   have S13: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟷ 
   A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)" by (rule MMI_3anass)
   have S14: "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟷ 
   A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_3anass)
   from S12 S13 S14 have S15: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟷ 
   A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x)" by (rule MMI_3bitr4)
   have S16: "A ⊆ℝ ∧ A ≠ 0 ∧ ( ∃x∈ℝ. ∀y∈A. y \<ls> x ∨ y = x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_sup2)
   from S15 S16 show "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_sylbi)
qed

(******* 584 **********************************************)

lemma (in MMIsar0) MMI_infm3lem: 
   shows "x ∈ ℝ ⟶ 
   ( ∃y∈ℝ. x = (\<cn>y))"
proof -
   have S1: "y = (\<cn>x) ⟶ (\<cn>y) = (\<cn>(\<cn>x))" by (rule MMI_negeq)
   from S1 have S2: "y = (\<cn>x) ⟶ 
   x = (\<cn>y) ⟷ x = (\<cn>(\<cn>x))" by (rule MMI_eqeq2d)
   from S2 have S3: "(\<cn>x) ∈ ℝ ∧ x = (\<cn>(\<cn>x)) ⟶ 
   ( ∃y∈ℝ. x = (\<cn>y))" by auto (*rule MMI_rcla4ev*)
   have S4: "x ∈ ℝ ⟶ (\<cn>x) ∈ ℝ" by (rule MMI_renegclt)
   have S5: "x ∈ ℝ ⟶ x ∈ ℂ" by (rule MMI_recnt)
   have S6: "x ∈ ℂ ⟶ (\<cn>(\<cn>x)) = x" by (rule MMI_negnegt)
   from S5 S6 have S7: "x ∈ ℝ ⟶ (\<cn>(\<cn>x)) = x" by (rule MMI_syl)
   from S7 have S8: "x ∈ ℝ ⟶ x = (\<cn>(\<cn>x))" by (rule MMI_eqcomd)
   from S3 S4 S8 show "x ∈ ℝ ⟶ 
   ( ∃y∈ℝ. x = (\<cn>y))" by (rule MMI_sylanc)
qed

(******** 585 ********************************************)

lemma (in MMIsar0) MMI_infm3: 
   shows "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)))"
proof -
  { fix v
    have S1: "A ⊆ℝ ⟶ 
      v ∈ A ⟶ v ∈ ℝ" by (rule MMI_ssel)
    from S1 have "A ⊆ℝ ⟶ 
      v ∈ A ⟷ 
      v ∈ ℝ ∧ v ∈ A" by (rule MMI_pm4_71rd)
  } then have S2: "∀ v. A ⊆ℝ ⟶  v ∈ A ⟷  v ∈ ℝ ∧ v ∈ A" by simp
  from S2 have S3: "A ⊆ℝ ⟶ 
    ( ∃v. v ∈ A) ⟷ 
    ( ∃v. v ∈ ℝ ∧ v ∈ A)" by auto (*rule MMI_exbidv*)
   have S4: "( ∃v∈ℝ. v ∈ A) ⟷ 
   ( ∃v. v ∈ ℝ ∧ v ∈ A)" by (rule MMI_df_rex)
   { fix w
     have "w ∈ ℝ ⟶ (\<cn>w) ∈ ℝ" by (rule MMI_renegclt)
   } then have S5: "∀w. w ∈ ℝ ⟶ (\<cn>w) ∈ ℝ" by simp
   { fix v
     have "v ∈ ℝ ⟶ 
       ( ∃w∈ℝ. v = (\<cn>w))" by (rule MMI_infm3lem)
   } then have S6: "∀ v. v ∈ ℝ ⟶ ( ∃w∈ℝ. v = (\<cn>w))" by simp
   { fix v w
     have  "v = (\<cn>w) ⟶ 
       v ∈ A ⟷ (\<cn>w) ∈ A" by (rule MMI_eleq1)
   } then have S7: "∀v w. v = (\<cn>w) ⟶ v ∈ A ⟷ (\<cn>w) ∈ A"
     by simp
   from S5 S6 S7 have S8: "( ∃v∈ℝ. v ∈ A) ⟷ 
   ( ∃w∈ℝ. (\<cn>w) ∈ A)" by (rule MMI_rexxfr)
   from S4 S8 have S9: "( ∃v. v ∈ ℝ ∧ v ∈ A) ⟷ 
   ( ∃w∈ℝ. (\<cn>w) ∈ A)" by (rule MMI_bitr3)
   from S3 S9 have S10: "A ⊆ℝ ⟶ 
   ( ∃v. v ∈ A) ⟷ 
   ( ∃w∈ℝ. (\<cn>w) ∈ A)" by (rule MMI_syl6bb)
   have S11: "¬(A = 0) ⟷ ( ∃v. v ∈ A)" by (rule MMI_n0)
   have S12: "¬({w ∈ ℝ. (\<cn>w) ∈ A } = 0) ⟷ 
   ( ∃w∈ℝ. (\<cn>w) ∈ A)" by (rule MMI_rabn0)
   from S10 S11 S12 have S13: "A ⊆ℝ ⟶ 
   ¬(A = 0) ⟷ 
   ¬({w ∈ ℝ. (\<cn>w) ∈ A } = 0)" by (rule MMI_3bitr4g)
   { fix x
     { fix y
       have S14: "A ⊆ℝ ⟶ 
	 y ∈ A ⟶ y ∈ ℝ" by (rule MMI_ssel)
       from S14 have S15: "A ⊆ℝ ⟶ 
	 y ∈ A ⟷ 
	 y ∈ ℝ ∧ y ∈ A" by (rule MMI_pm4_71rd)
       from S15 have S16: "A ⊆ℝ ⟶ 
	 (y ∈ A ⟶ x \<lsq> y) ⟷ 
	 (y ∈ ℝ ∧ y ∈ A ⟶ x \<lsq> y)" by (rule MMI_imbi1d)
       have S17: "(y ∈ ℝ ∧ y ∈ A ⟶ x \<lsq> y) ⟷ 
	 (y ∈ ℝ ⟶ 
	 y ∈ A ⟶ x \<lsq> y)" by (rule MMI_impexp)
       from S16 S17 have "A ⊆ℝ ⟶ 
	 (y ∈ A ⟶ x \<lsq> y) ⟷ 
	 (y ∈ ℝ ⟶ 
	 y ∈ A ⟶ x \<lsq> y)" by (rule MMI_syl6bb)
     } then have S18: "∀y. A ⊆ℝ ⟶ 
	 (y ∈ A ⟶ x \<lsq> y) ⟷ 
	 (y ∈ ℝ ⟶ 
	 y ∈ A ⟶ x \<lsq> y)" by simp
     from S18 have S19: "A ⊆ℝ ⟶ 
       (∀y. y ∈ A ⟶ x \<lsq> y) ⟷ 
       (∀y. y ∈ ℝ ⟶ 
       y ∈ A ⟶ x \<lsq> y)" by (rule MMI_albidv)
     have S20: "(∀y∈A. x \<lsq> y) ⟷ 
       (∀y. y ∈ A ⟶ x \<lsq> y)" by (rule MMI_df_ral)
     { fix v
       have  "v ∈ ℝ ⟶ (\<cn>v) ∈ ℝ" by (rule MMI_renegclt)
     } then have S21: "∀ v. v ∈ ℝ ⟶ (\<cn>v) ∈ ℝ" by simp
     { fix y
       have "y ∈ ℝ ⟶ 
	 ( ∃v∈ℝ. y = (\<cn>v))" by (rule MMI_infm3lem)
     } then have S22: "∀y. y ∈ ℝ ⟶ ( ∃v∈ℝ. y = (\<cn>v))"
       by simp
     { fix y v
       have S23: "y = (\<cn>v) ⟶ 
	 y ∈ A ⟷ (\<cn>v) ∈ A" by (rule MMI_eleq1)   
       have S24: "y = (\<cn>v) ⟶ 
	 x \<lsq> y ⟷ x \<lsq> (\<cn>v)" by (rule MMI_breq2)
       from S23 S24 have "y = (\<cn>v) ⟶ 
	 (y ∈ A ⟶ x \<lsq> y) ⟷ 
	 ((\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v))" by (rule MMI_imbi12d)
     } then have S25: "∀ y v. y = (\<cn>v) ⟶ (y ∈ A ⟶ x \<lsq> y) ⟷ 
	 ((\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v))" by simp
     from S21 S22 S25 have S26: "(∀y∈ℝ. y ∈ A ⟶ x \<lsq> y) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v))" by (rule MMI_ralxfr)
     have S27: "(∀y∈ℝ. y ∈ A ⟶ x \<lsq> y) ⟷ 
       (∀y. y ∈ ℝ ⟶  y ∈ A ⟶ x \<lsq> y)" by (rule MMI_df_ral)
     from S26 S27 have S28: "(∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v)) ⟷ 
       (∀y. y ∈ ℝ ⟶ 
       y ∈ A ⟶ x \<lsq> y)" by (rule MMI_bitr3)
     from S19 S20 S28 have "A ⊆ℝ ⟶ 
       (∀y∈A. x \<lsq> y) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v))" by auto (*rule MMI_3bitr4g*)
   } then have S29: "∀ x. A ⊆ℝ ⟶ (∀y∈A. x \<lsq> y) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v))" by simp
   from S29 have S30: "A ⊆ℝ ⟶ 
     ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟷ 
     ( ∃x∈ℝ. ∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v))" 
     by (rule MMI_rexbidv)
   { fix u
     have "u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" by (rule MMI_renegclt)
   } then have S31: "∀ u. u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" by simp
   { fix x
     have S32: "x ∈ ℝ ⟶ ( ∃u∈ℝ. x = (\<cn>u))" by (rule MMI_infm3lem)
   } then have S32: "∀ x. x ∈ ℝ ⟶ ( ∃u∈ℝ. x = (\<cn>u))" by simp
   { fix x u
     have S33: "x = (\<cn>u) ⟶ 
       x \<lsq> (\<cn>v) ⟷ (\<cn>u) \<lsq> (\<cn>v)" by (rule MMI_breq1)
     from S33 have S34: "x = (\<cn>u) ⟶ 
       ((\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v)) ⟷ 
       ((\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by (rule MMI_imbi2d)
     from S34 have S35: "x = (\<cn>u) ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" 
       by auto (*rule MMI_ralbidv*)
   } then have S35: "∀x u. x = (\<cn>u) ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by simp
   from S31 S32 S35 have S36: 
     "( ∃x∈ℝ. ∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v)) ⟷ 
   ( ∃u∈ℝ. ∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" 
     by (rule MMI_rexxfr)
   { fix u
     { fix v
       have S37: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	 v \<lsq> u ⟷ (\<cn>u) \<lsq> (\<cn>v)" by (rule MMI_lenegt)
       from S37 have S38: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 v \<lsq> u ⟷ (\<cn>u) \<lsq> (\<cn>v)" by (rule MMI_ancoms)
       from S38 have S39: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 ((\<cn>v) ∈ A ⟶ v \<lsq> u) ⟷ 
	 ((\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by (rule MMI_imbi2d)
     } then have  S39: "∀ v. u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 ((\<cn>v) ∈ A ⟶ v \<lsq> u) ⟷ 
	 ((\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by simp
     from S39 have S40: "u ∈ ℝ ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ v \<lsq> u) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by (rule MMI_ralbidva)
     have S41: "w = v ⟶ (\<cn>w) = (\<cn>v)" by (rule MMI_negeq)
     from S41 have S42: "w = v ⟶ 
       (\<cn>w) ∈ A ⟷ (\<cn>v) ∈ A" by (rule MMI_eleq1d)
     from S42 have S43: "v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟷ 
       v ∈ ℝ ∧ (\<cn>v) ∈ A" by auto (*rule MMI_elrab*)
     from S43 have S44: "(v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ v \<lsq> u) ⟷ 
       (v ∈ ℝ ∧ (\<cn>v) ∈ A ⟶ v \<lsq> u)" by (rule MMI_imbi1i)
     have S45: "(v ∈ ℝ ∧ (\<cn>v) ∈ A ⟶ v \<lsq> u) ⟷ 
       (v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ v \<lsq> u)" by (rule MMI_impexp)
     from S44 S45 have S46: "(v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ v \<lsq> u) ⟷ 
       (v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ v \<lsq> u)" by (rule MMI_bitr)
     from S46 have S47: "(∀v. v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ v \<lsq> u) ⟷ 
       (∀v. v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ v \<lsq> u)" by auto (*rule MMI_albii*)
     have S48: "(∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u) ⟷ 
       (∀v. v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ v \<lsq> u)" by (rule MMI_df_ral)
     have S49: "(∀v∈ℝ. (\<cn>v) ∈ A ⟶ v \<lsq> u) ⟷ 
       (∀v. v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ v \<lsq> u)" by (rule MMI_df_ral)
     from S47 S48 S49 have S50: "(∀v∈ℝ. (\<cn>v) ∈ A ⟶ v \<lsq> u) ⟷ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u)" by (rule MMI_3bitr4r)
     from S40 S50 have "u ∈ ℝ ⟶ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by (rule MMI_syl5bbr)
   } then have S51: "∀ u. u ∈ ℝ ⟶ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" by simp
   from S51 have S52: "( ∃u∈ℝ. ∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u) ⟷ 
     ( ∃u∈ℝ. ∀v∈ℝ. (\<cn>v) ∈ A ⟶ (\<cn>u) \<lsq> (\<cn>v))" 
     by (rule MMI_rexbiia)
   from S36 S52 have S53: "( ∃x∈ℝ. ∀v∈ℝ. (\<cn>v) ∈ A ⟶ x \<lsq> (\<cn>v)) ⟷ 
     ( ∃u∈ℝ. ∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u)" by (rule MMI_bitr4)
   from S30 S53 have S54: "A ⊆ℝ ⟶ 
     ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟷ 
     ( ∃u∈ℝ. ∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u)" by (rule MMI_syl6bb)
   from S13 S54 have S55: "A ⊆ℝ ⟶ 
     ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟷ 
     ¬({w ∈ ℝ. (\<cn>w) ∈ A } = 0) ∧ 
     ( ∃u∈ℝ. ∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u)" by (rule MMI_anbi12d)
   have S56: "{w ∈ ℝ. (\<cn>w) ∈ A } ⊆ℝ" by (rule MMI_ssrab2)
   have S57: "{w ∈ ℝ. (\<cn>w) ∈ A } ⊆ℝ ∧ ¬({w ∈ ℝ. (\<cn>w) ∈ A } = 0) ∧ 
     ( ∃u∈ℝ. ∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u) ⟶ 
     ( ∃u∈ℝ. (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
     ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)))" by (rule MMI_sup3)
   from S56 S57 have S58: 
     "¬({w ∈ ℝ. (\<cn>w) ∈ A } = 0) ∧ 
     ( ∃u∈ℝ. ∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<lsq> u) ⟶ 
     ( ∃u∈ℝ. (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
     ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)))" by (rule MMI_mp3an1)
   from S55 S58 have S59: "A ⊆ℝ ⟶ 
   ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   ( ∃u∈ℝ. (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
   ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)))" by (rule MMI_syl6bi)
   { fix x
     { fix y
       have S60: "A ⊆ℝ ⟶ 
	 y ∈ A ⟷ 
	 y ∈ ℝ ∧ y ∈ A" using MMI_ssel MMI_pm4_71rd by simp
       from S60 have S61: "A ⊆ℝ ⟶ 
	 (y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
	 (y ∈ ℝ ∧ y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_imbi1d)
       have S62: "(y ∈ ℝ ∧ y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
	 (y ∈ ℝ ⟶ 
	 y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_impexp)
       from S61 S62 have S63: "A ⊆ℝ ⟶  (y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
	 (y ∈ ℝ ⟶ y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_syl6bb)
     } then have S63: "∀y. A ⊆ℝ ⟶  (y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
	 (y ∈ ℝ ⟶ y ∈ A ⟶ ¬(y \<ls> x))" by simp
     from S63 have S64: "A ⊆ℝ ⟶ 
       (∀y. y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
       (∀y. y ∈ ℝ ⟶ 
       y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_albidv)
     have S65: "(∀y∈A. ¬(y \<ls> x)) ⟷ 
       (∀y. y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_df_ral)
     { fix v
       have "v ∈ ℝ ⟶ (\<cn>v) ∈ ℝ" by (rule MMI_renegclt)
     } then have S66: "∀ v. v ∈ ℝ ⟶ (\<cn>v) ∈ ℝ" by simp
     { fix y
       have S67: "y ∈ ℝ ⟶  ( ∃v∈ℝ. y = (\<cn>v))"  by (rule MMI_infm3lem)
     } then have S67: "∀ y. y ∈ ℝ ⟶  ( ∃v∈ℝ. y = (\<cn>v))" by simp
     { fix y v
       have S68: "y = (\<cn>v) ⟶  y ∈ A ⟷ (\<cn>v) ∈ A" by (rule MMI_eleq1)
       have S69: "y = (\<cn>v) ⟶ 
	 y \<ls> x ⟷ (\<cn>v) \<ls> x" by (rule MMI_breq1)
       from S69 have S70: "y = (\<cn>v) ⟶ 
	 ¬(y \<ls> x) ⟷ ¬((\<cn>v) \<ls> x)" by (rule MMI_negbid)
       from S68 S70 have "y = (\<cn>v) ⟶ 
	 (y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
	 ((\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x))" by (rule MMI_imbi12d)
     } then have S71: "∀y v. y = (\<cn>v) ⟶ (y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
	 ((\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x))" by simp
     from S66 S67 S71 have S72: "(∀y∈ℝ. y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x))" by (rule MMI_ralxfr)
     have S73: "(∀y∈ℝ. y ∈ A ⟶ ¬(y \<ls> x)) ⟷ 
       (∀y. y ∈ ℝ ⟶ 
       y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_df_ral)
     from S72 S73 have S74: "(∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ⟷ 
       (∀y. y ∈ ℝ ⟶ 
       y ∈ A ⟶ ¬(y \<ls> x))" by (rule MMI_bitr3)
     from S64 S65 S74 have S75: "A ⊆ℝ ⟶ 
       (∀y∈A. ¬(y \<ls> x)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x))" by (rule MMI_3bitr4g)
     have S76: "A ⊆ℝ ⟶ 
       z ∈ A ⟶ z ∈ ℝ" by (rule MMI_ssel)
     { fix v
       from S76 have S77: "A ⊆ℝ ⟶ 
	 z ∈ A ∧ z \<ls> (\<cn>v) ⟶ z ∈ ℝ" by (rule MMI_adantrd)
       from S77 have S78: "A ⊆ℝ ⟶ 
	 z ∈ A ∧ z \<ls> (\<cn>v) ⟷ 
	 z ∈ ℝ ∧ z ∈ A ∧ z \<ls> (\<cn>v)" by (rule MMI_pm4_71rd)
       from S78 have S79: "A ⊆ℝ ⟶ 
	 ( ∃z. z ∈ A ∧ z \<ls> (\<cn>v)) ⟷ 
	 ( ∃z. z ∈ ℝ ∧ z ∈ A ∧ z \<ls> (\<cn>v))" by auto (*rule MMI_exbidv*)
       have S80: "( ∃z∈A. z \<ls> (\<cn>v)) ⟷ 
	 ( ∃z. z ∈ A ∧ z \<ls> (\<cn>v))" by (rule MMI_df_rex)
       { fix t
	 have "t ∈ ℝ ⟶ (\<cn>t) ∈ ℝ" by (rule MMI_renegclt)
       } then have  S81: "∀ t. t ∈ ℝ ⟶ (\<cn>t) ∈ ℝ" by simp
       { fix z
	 have "z ∈ ℝ ⟶ ( ∃t∈ℝ. z = (\<cn>t))" by (rule MMI_infm3lem)
       } then have S82: "∀ z. z ∈ ℝ ⟶ ( ∃t∈ℝ. z = (\<cn>t))" by simp
       { fix z t
	 have S83: "z = (\<cn>t) ⟶ 
	   z ∈ A ⟷ (\<cn>t) ∈ A" by (rule MMI_eleq1)
	 have S84: "z = (\<cn>t) ⟶ 
	   z \<ls> (\<cn>v) ⟷ (\<cn>t) \<ls> (\<cn>v)" by (rule MMI_breq1)
	 from S83 S84 have S85: "z = (\<cn>t) ⟶ 
	   z ∈ A ∧ z \<ls> (\<cn>v) ⟷ 
	   (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)" by (rule MMI_anbi12d)
       } then have S85: "∀z t. z = (\<cn>t) ⟶ 
	   z ∈ A ∧ z \<ls> (\<cn>v) ⟷ 
	   (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)" by simp
       from S81 S82 S85 have S86: "( ∃z∈ℝ. z ∈ A ∧ z \<ls> (\<cn>v)) ⟷ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))" by (rule MMI_rexxfr)
       have S87: "( ∃z∈ℝ. z ∈ A ∧ z \<ls> (\<cn>v)) ⟷ 
	 ( ∃z. z ∈ ℝ ∧ z ∈ A ∧ z \<ls> (\<cn>v))" by (rule MMI_df_rex)
       from S86 S87 have S88: "( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)) ⟷ 
	 ( ∃z. z ∈ ℝ ∧ z ∈ A ∧ z \<ls> (\<cn>v))" by (rule MMI_bitr3)
       from S79 S80 S88 have S89: "A ⊆ℝ ⟶ 
	 ( ∃z∈A. z \<ls> (\<cn>v)) ⟷ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))" by (rule MMI_3bitr4g)
       from S89 have "A ⊆ℝ ⟶ 
	 (x \<ls> (\<cn>v) ⟶ 
	 ( ∃z∈A. z \<ls> (\<cn>v))) ⟷ 
	 (x \<ls> (\<cn>v) ⟶ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_imbi2d)
     } then have  S90: "∀ v. A ⊆ℝ ⟶ 
	 (x \<ls> (\<cn>v) ⟶ 
	 ( ∃z∈A. z \<ls> (\<cn>v))) ⟷ 
	 (x \<ls> (\<cn>v) ⟶ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by auto
     from S90 have S91: "A ⊆ℝ ⟶ 
       (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃z∈A. z \<ls> (\<cn>v))) ⟷ 
       (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_ralbidv)
     { fix v
       have "v ∈ ℝ ⟶ (\<cn>v) ∈ ℝ" by (rule MMI_renegclt)
     } then have S92: "∀ v. v ∈ ℝ ⟶ (\<cn>v) ∈ ℝ" by simp
     { fix y
       have "y ∈ ℝ ⟶  ( ∃v∈ℝ. y = (\<cn>v))" by (rule MMI_infm3lem)
     } then have S93: "∀ y. y ∈ ℝ ⟶  ( ∃v∈ℝ. y = (\<cn>v))" by simp
     { fix y v
       have S94: "y = (\<cn>v) ⟶  x \<ls> y ⟷ x \<ls> (\<cn>v)" by (rule MMI_breq2)
       { fix z
	 have "y = (\<cn>v) ⟶ 
	   z \<ls> y ⟷ z \<ls> (\<cn>v)" by (rule MMI_breq2)
       } then have S95: "∀ z. y = (\<cn>v) ⟶ 
	   z \<ls> y ⟷ z \<ls> (\<cn>v)" by simp
       from S95 have S96: "y = (\<cn>v) ⟶ 
	 ( ∃z∈A. z \<ls> y) ⟷ 
	 ( ∃z∈A. z \<ls> (\<cn>v))" by (rule MMI_rexbidv)
       from S94 S96 have S97: "y = (\<cn>v) ⟶ 
	 (x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) ⟷ 
	 (x \<ls> (\<cn>v) ⟶ 
	 ( ∃z∈A. z \<ls> (\<cn>v)))" by (rule MMI_imbi12d)
     } then have S97: "∀ y v. y = (\<cn>v) ⟶ 
	 (x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) ⟷ 
	 (x \<ls> (\<cn>v) ⟶ 
	 ( ∃z∈A. z \<ls> (\<cn>v)))" by simp
     from S92 S93 S97 have S98: "(∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) ⟷ 
       (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃z∈A. z \<ls> (\<cn>v)))" by (rule MMI_ralxfr)
     from S91 S98 have S99: "A ⊆ℝ ⟶ 
       (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) ⟷ 
       (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_syl5bb)
     from S75 S99 have S100: "A ⊆ℝ ⟶ 
       (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_anbi12d)
   } then have S100: "∀x. A ⊆ℝ ⟶ 
       (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by simp
   from S100 have S101: "A ⊆ℝ ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))) ⟷ 
   ( ∃x∈ℝ. (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
     ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
   ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))))" by (rule MMI_rexbidv)
   { fix u
     have "u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" by (rule MMI_renegclt)
   } then have S102: "∀ u. u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" by simp
   { fix x
     have "x ∈ ℝ ⟶  ( ∃u∈ℝ. x = (\<cn>u))" by (rule MMI_infm3lem)
   } then have S103: "∀ x. x ∈ ℝ ⟶  ( ∃u∈ℝ. x = (\<cn>u))" by simp
   { fix x u
     have S104: "x = (\<cn>u) ⟶ 
       (\<cn>v) \<ls> x ⟷ (\<cn>v) \<ls> (\<cn>u)" by (rule MMI_breq2)
     from S104 have S105: "x = (\<cn>u) ⟶ 
       ¬((\<cn>v) \<ls> x) ⟷ 
       ¬((\<cn>v) \<ls> (\<cn>u))" by (rule MMI_negbid)
     from S105 have S106: "x = (\<cn>u) ⟶ 
       ((\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ⟷ 
       ((\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u)))" by (rule MMI_imbi2d)
     from S106 have S107: "x = (\<cn>u) ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u)))" by auto (*rule MMI_ralbidv*)
     have S108: "x = (\<cn>u) ⟶ 
       x \<ls> (\<cn>v) ⟷ (\<cn>u) \<ls> (\<cn>v)" by (rule MMI_breq1)
     from S108 have S109: "x = (\<cn>u) ⟶ 
       (x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))) ⟷ 
       ((\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_imbi1d)
     from S109 have S110: "x = (\<cn>u) ⟶ 
       (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))) ⟷ 
       (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by auto (*rule MMI_ralbidv*)
     from S107 S110 have "x = (\<cn>u) ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u))) ∧ (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_anbi12d)
     } then have S111: "∀x u. x = (\<cn>u) ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u))) ∧ (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by simp
   from S102 S103 S111 have S112: 
     "( ∃x∈ℝ. (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
   ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))) ⟷ 
   ( ∃u∈ℝ. (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
   ¬((\<cn>v) \<ls> (\<cn>u))) ∧ (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
   ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))))" by (rule MMI_rexxfr)
   { fix u
     { fix v
       have S113: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 u \<ls> v ⟷ (\<cn>v) \<ls> (\<cn>u)" by (rule MMI_ltnegt)
       from S113 have S114: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 ¬(u \<ls> v) ⟷ 
	 ¬((\<cn>v) \<ls> (\<cn>u))" by (rule MMI_negbid)
       from S114 have "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 ((\<cn>v) ∈ A ⟶ ¬(u \<ls> v)) ⟷ 
	 ((\<cn>v) ∈ A ⟶ 
	 ¬((\<cn>v) \<ls> (\<cn>u)))" by (rule MMI_imbi2d)
     } then have S115: "∀ v. u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 ((\<cn>v) ∈ A ⟶ ¬(u \<ls> v)) ⟷ 
	 ((\<cn>v) ∈ A ⟶ 
	 ¬((\<cn>v) \<ls> (\<cn>u)))" by simp
     from S115 have S116: "u ∈ ℝ ⟶ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬(u \<ls> v)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u)))" by (rule MMI_ralbidva)
     have S117: "v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟷ 
       v ∈ ℝ ∧ (\<cn>v) ∈ A" using MMI_negeq  MMI_eleq1d by auto
     from S117 have S118: "(v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ ¬(u \<ls> v)) ⟷ 
       (v ∈ ℝ ∧ (\<cn>v) ∈ A ⟶ ¬(u \<ls> v))" by (rule MMI_imbi1i)
     have S119: "(v ∈ ℝ ∧ (\<cn>v) ∈ A ⟶ ¬(u \<ls> v)) ⟷ 
       (v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ ¬(u \<ls> v))" by (rule MMI_impexp)
     from S118 S119 have S120: "(v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ ¬(u \<ls> v)) ⟷ 
       (v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ ¬(u \<ls> v))" by (rule MMI_bitr)
     from S120 have S121: "(∀v. v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ ¬(u \<ls> v)) ⟷ 
       (∀v. v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ ¬(u \<ls> v))" by auto (*rule MMI_albii*)
     have S122: "(∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ⟷ 
       (∀v. v ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟶ ¬(u \<ls> v))" by (rule MMI_df_ral)
     have S123: "(∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬(u \<ls> v)) ⟷ 
       (∀v. v ∈ ℝ ⟶ 
       (\<cn>v) ∈ A ⟶ ¬(u \<ls> v))" by (rule MMI_df_ral)
     from S121 S122 S123 have S124: "(∀v∈ℝ. (\<cn>v) ∈ A ⟶ ¬(u \<ls> v)) ⟷ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v))" by (rule MMI_3bitr4r)
     from S116 S124 have S125: "u ∈ ℝ ⟶ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u)))" by (rule MMI_syl5bbr)
     { fix v 
       have S126: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	 v \<ls> u ⟷ (\<cn>u) \<ls> (\<cn>v)" by (rule MMI_ltnegt)
       from S126 have S127: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 v \<ls> u ⟷ (\<cn>u) \<ls> (\<cn>v)" by (rule MMI_ancoms)
       { fix t
	 have S128: "v ∈ ℝ ∧ t ∈ ℝ ⟶ 
	   v \<ls> t ⟷ (\<cn>t) \<ls> (\<cn>v)" by (rule MMI_ltnegt)
	 from S128 have "v ∈ ℝ ∧ t ∈ ℝ ⟶ 
	   (\<cn>t) ∈ A ∧ v \<ls> t ⟷ 
	   (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)" by (rule MMI_anbi2d)
       } then have S129: "∀ t. v ∈ ℝ ∧ t ∈ ℝ ⟶ 
	   (\<cn>t) ∈ A ∧ v \<ls> t ⟷ 
	   (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)" by simp
       from S129 have S130: "v ∈ ℝ ⟶ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ v \<ls> t) ⟷ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))" by (rule MMI_rexbidva)
       have S131: "w = t ⟶ (\<cn>w) = (\<cn>t)" by (rule MMI_negeq)
       from S131 have S132: "w = t ⟶ 
	 (\<cn>w) ∈ A ⟷ (\<cn>t) ∈ A" by (rule MMI_eleq1d)
       from S132 have S133: "t ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ⟷ 
	 t ∈ ℝ ∧ (\<cn>t) ∈ A" by auto (*rule MMI_elrab*)
       from S133 have S134: "t ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ∧ v \<ls> t ⟷ 
	 (t ∈ ℝ ∧ (\<cn>t) ∈ A) ∧ v \<ls> t" by (rule MMI_anbi1i)
       have S135: "(t ∈ ℝ ∧ (\<cn>t) ∈ A) ∧ v \<ls> t ⟷ 
	 t ∈ ℝ ∧ (\<cn>t) ∈ A ∧ v \<ls> t" by (rule MMI_anass)
       from S134 S135 have S136: "t ∈ {w ∈ ℝ. (\<cn>w) ∈ A } ∧ v \<ls> t ⟷ 
	 t ∈ ℝ ∧ (\<cn>t) ∈ A ∧ v \<ls> t" by (rule MMI_bitr)
       from S136 have S137: "( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t) ⟷ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ v \<ls> t)" by auto (*rule MMI_rexbii2*)
       from S130 S137 have S138: "v ∈ ℝ ⟶ 
	 ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t) ⟷ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))" by (rule MMI_syl5bb)
       from S138 have S139: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
       ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t) ⟷ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))" by (rule MMI_adantl)
       from S127 S139 have "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 (v \<ls> u ⟶ 
	 ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)) ⟷ 
	 ((\<cn>u) \<ls> (\<cn>v) ⟶ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_imbi12d)
     } then have S140: "∀ v. u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	 (v \<ls> u ⟶ 
	 ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)) ⟷ 
	 ((\<cn>u) \<ls> (\<cn>v) ⟶ 
	 ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by simp
     from S140 have S141: "u ∈ ℝ ⟶ 
     (∀v∈ℝ. v \<ls> u ⟶ 
       ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)) ⟷ 
       (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_ralbidva)
     from S125 S141 have S142: "u ∈ ℝ ⟶ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
       ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u))) ∧ (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by (rule MMI_anbi12d)
   } then have S142: "∀ u. u ∈ ℝ ⟶ 
       (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
       ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)) ⟷ 
       (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
       ¬((\<cn>v) \<ls> (\<cn>u))) ∧ (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
       ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))" by simp
   from S142 have S143: 
     "( ∃u∈ℝ. (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
     ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t))) ⟷ 
     ( ∃u∈ℝ. (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
     ¬((\<cn>v) \<ls> (\<cn>u))) ∧ (∀v∈ℝ. (\<cn>u) \<ls> (\<cn>v) ⟶ 
     ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v))))" by (rule MMI_rexbiia)
   from S112 S143 have S144: 
     "( ∃x∈ℝ. (∀v∈ℝ. (\<cn>v) ∈ A ⟶ 
     ¬((\<cn>v) \<ls> x)) ∧ (∀v∈ℝ. x \<ls> (\<cn>v) ⟶ 
   ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>v)))) ⟷ 
   ( ∃u∈ℝ. (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
   ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)))" by (rule MMI_bitr4)
   from S101 S144 have S145: "A ⊆ℝ ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))) ⟷ 
   ( ∃u∈ℝ. (∀v∈{w ∈ ℝ. (\<cn>w) ∈ A }. ¬(u \<ls> v)) ∧ (∀v∈ℝ. v \<ls> u ⟶ 
   ( ∃t∈{w ∈ ℝ. (\<cn>w) ∈ A }. v \<ls> t)))" by (rule MMI_syl6bb)
   from S59 S145 have S146: "A ⊆ℝ ⟶ 
   ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)))" 
     by (rule MMI_sylibrd)
   from S146 show "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)))" 
     by (rule MMI_3impib)
qed

(***** 586,587 ****************************************)

lemma (in MMIsar0) MMI_suprcl: 
   shows "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
    Sup(A,ℝ,\<cltrrset>) ∈ ℝ"
proof -
   have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_sup3)
   have S2: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   from S2 have S3: 
     "( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))) ⟶ 
    Sup(A,ℝ,\<cltrrset>)  ∈ ℝ" by (rule MMI_supcl)
   from S1 S3 show "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
    Sup(A,ℝ,\<cltrrset>)  ∈ ℝ" by (rule MMI_syl)
qed

lemma (in MMIsar0) MMI_suprub: 
   shows "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ 
  B \<lsq>  Sup(A,ℝ,\<cltrrset>) "
proof -
   have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_sup3)
   have S2: " \<cltrrset> Orders ℝ" by (rule MMI_ltso)
   from S2 have S3: 
     "( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))) ⟶ 
   B ∈ A ⟶ ¬( Sup(A,ℝ,\<cltrrset>)  \<ls> B)" by (rule MMI_supub)
   from S1 S3 have S4: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   B ∈ A ⟶ 
   ¬( Sup(A,ℝ,\<cltrrset>)  \<ls> B)" by (rule MMI_syl)
   from S4 have S5: "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ 
   ¬( Sup(A,ℝ,\<cltrrset>)  \<ls> B)" by (rule MMI_imp)
   have S6: "B ∈ ℝ ∧  Sup(A,ℝ,\<cltrrset>)  ∈ ℝ ⟶ 
   B \<lsq>  Sup(A,ℝ,\<cltrrset>)  ⟷ 
   ¬( Sup(A,ℝ,\<cltrrset>)  \<ls> B)" by (rule MMI_lenltt)
   have S7: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ A ⊆ℝ" 
     by (rule MMI_3simp1)
   from S7 have S8: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   B ∈ A ⟶ B ∈ ℝ" by (rule MMI_sseld)
   from S8 have S9: 
     "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ B ∈ ℝ" 
     by (rule MMI_imp)
   have S10: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
    Sup(A,ℝ,\<cltrrset>)  ∈ ℝ" by (rule MMI_suprcl)
   from S10 have S11: "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ 
    Sup(A,ℝ,\<cltrrset>)  ∈ ℝ" by (rule MMI_adantr)
   from S6 S9 S11 have S12: 
     "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ 
   B \<lsq>  Sup(A,ℝ,\<cltrrset>)  ⟷ ¬( Sup(A,ℝ,\<cltrrset>)  \<ls> B)" 
     by (rule MMI_sylanc)
   from S5 S12 show 
     "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ 
     B \<lsq>  Sup(A,ℝ,\<cltrrset>)" by (rule MMI_mpbird)
qed

(********** 588 - 590 *****************************)

lemma (in MMIsar0) MMI_suprlub: 
   shows  "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
  ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ B \<ls>  Sup(A,ℝ,\<cltrrset>) ⟶ 
  ( ∃z∈A. B \<ls> z)"
proof -
   have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_sup3)
   have S2: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   from S2 have S3: 
     "( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))) ⟶ 
   B ∈ ℝ ∧ B \<ls>  Sup(A,ℝ,\<cltrrset>) ⟶ ( ∃z∈A. B \<ls> z)" 
     by (rule MMI_suplub)
   from S1 S3 have S4: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   B ∈ ℝ ∧ B \<ls>  Sup(A,ℝ,\<cltrrset>) ⟶ ( ∃z∈A. B \<ls> z)" by (rule MMI_syl)
   from S4 show "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ B \<ls>  Sup(A,ℝ,\<cltrrset>) ⟶ 
     ( ∃z∈A. B \<ls> z)" by (rule MMI_imp)
qed

lemma (in MMIsar0) MMI_suprnub: 
   shows "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
  ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))"
proof -
  have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
    ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
    by (rule MMI_sup3)
  have S2: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
  from S2 have S3: 
    "( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))) ⟶ 
    B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
    ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_supnub)
  from S1 S3 have S4: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
    B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
    ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_syl)
  from S4 show "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
    ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_imp)
qed

lemma (in MMIsar0) MMI_suprleub: 
   shows 
  "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B"
proof -
  { fix z
    have S1: "z ∈ ℝ ∧ B ∈ ℝ ⟶ 
      z \<lsq> B ⟷ ¬(B \<ls> z)" by (rule MMI_lenltt)
    have S2: "A ⊆ℝ ∧ z ∈ A ⟶ z ∈ ℝ" by (rule MMI_ssel2)
    from S1 S2 have S3: "(A ⊆ℝ ∧ z ∈ A) ∧ B ∈ ℝ ⟶ 
      z \<lsq> B ⟷ ¬(B \<ls> z)" by (rule MMI_sylan)
    from S3 have "(A ⊆ℝ ∧ B ∈ ℝ) ∧ z ∈ A ⟶ 
      z \<lsq> B ⟷ ¬(B \<ls> z)" by (rule MMI_an1rs)
  } then have S4: "∀z. (A ⊆ℝ ∧ B ∈ ℝ) ∧ z ∈ A ⟶ 
      z \<lsq> B ⟷ ¬(B \<ls> z)" by simp
  from S4 have S5: "A ⊆ℝ ∧ B ∈ ℝ ⟶ 
    (∀z∈A. z \<lsq> B) ⟷ 
    (∀z∈A. ¬(B \<ls> z))" by (rule MMI_ralbidva)
  from S5 have S6: "A ⊆ℝ ⟶ 
   B ∈ ℝ ⟶ 
   (∀z∈A. z \<lsq> B) ⟷ 
   (∀z∈A. ¬(B \<ls> z))" by (rule MMI_ex)
   from S6 have S7: "A ⊆ℝ ⟶ 
   B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟷ 
   B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z))" by (rule MMI_pm5_32d)
   from S7 have S8: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟷ 
   B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z))" by (rule MMI_3ad2ant1)
   have S9: "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
     ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_suprnub)
   have S10: " Sup(A,ℝ,\<cltrrset>) ∈ ℝ ∧ B ∈ ℝ ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B ⟷ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_lenltt)
   have S11: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
    Sup(A,ℝ,\<cltrrset>) ∈ ℝ" by (rule MMI_suprcl)
   from S10 S11 have S12: "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B ⟷ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_sylan)
   from S12 have S13: "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B ⟷ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_adantrr)
   from S9 S13 have S14: "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B" by (rule MMI_mpbird)
   from S14 have S15: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B" by (rule MMI_ex)
   from S8 S15 have S16: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B" by (rule MMI_sylbid)
   from S16 show "(A ⊆ℝ ∧ ¬(A = 0) ∧ 
     ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B" by (rule MMI_imp)
qed

(************** 591 - 595 ******************************)

lemma (in MMIsar0) MMI_sup3i: 
  assumes A1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)"   
   shows " ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))"
proof -
   from A1 have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)".
   have S2: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x) ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z)))" 
     by (rule MMI_sup3)
   from S1 S2 show 
     " ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))" 
     by (rule MMI_ax_mp)
qed

lemma (in MMIsar0) MMI_suprcli: 
  assumes A1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)"   
   shows " Sup(A,ℝ,\<cltrrset>) ∈ ℝ"
proof -
   have S1: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   from A1 have S2: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)".
   from S2 have S3: 
     " ∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))" 
     by (rule MMI_sup3i)
   from S1 S3 show " Sup(A,ℝ,\<cltrrset>) ∈ ℝ" by (rule MMI_supcli)
qed

lemma (in MMIsar0) MMI_suprubi: 
  assumes A1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)"   
   shows "B ∈ A ⟶ 
   B \<lsq>  Sup(A,ℝ,\<cltrrset>)"
proof -
   from A1 have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)".
   have S2: "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ A ⟶ 
   B \<lsq>  Sup(A,ℝ,\<cltrrset>)" by (rule MMI_suprub)
   from S1 S2 show "B ∈ A ⟶ 
   B \<lsq>  Sup(A,ℝ,\<cltrrset>)" by (rule MMI_mpan)
qed

lemma (in MMIsar0) MMI_suprlubi: 
  assumes A1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)"   
  shows "B ∈ ℝ ∧ B \<ls>  Sup(A,ℝ,\<cltrrset>) ⟶ ( ∃z∈A. B \<ls> z)"
proof -
   have S1: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   from A1 have S2: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)".
   from S2 have S3: 
     "∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))" 
     by (rule MMI_sup3i)
   from S1 S3 show "B ∈ ℝ ∧ B \<ls>  Sup(A,ℝ,\<cltrrset>) ⟶ ( ∃z∈A. B \<ls> z)" 
     by (rule MMI_suplubi)
qed

lemma (in MMIsar0) MMI_suprnubi: 
  assumes A1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)"   
   shows "B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))"
proof -
   have S1: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   from A1 have S2: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)".
   from S2 have S3: 
     "∃x∈ℝ. (∀y∈A. ¬(x \<ls> y)) ∧ (∀y∈ℝ. y \<ls> x ⟶ ( ∃z∈A. y \<ls> z))" 
     by (rule MMI_sup3i)
   from S1 S3 show "B ∈ ℝ ∧ (∀z∈A. ¬(B \<ls> z)) ⟶ 
   ¬(B \<ls>  Sup(A,ℝ,\<cltrrset>))" by (rule MMI_supnubi)
qed

(************ 596 - 598 ***********************)

lemma (in MMIsar0) MMI_suprleubi: 
  assumes A1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)"   
   shows "B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B"
proof -
   from A1 have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)".
   have S2: 
     "(A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. y \<lsq> x)) ∧ B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B" by (rule MMI_suprleub)
   from S1 S2 show "B ∈ ℝ ∧ (∀z∈A. z \<lsq> B) ⟶ 
    Sup(A,ℝ,\<cltrrset>) \<lsq> B" by (rule MMI_mpan)
qed  

lemma (in MMIsar0) MMI_reuunineg: assumes 
  A1: "∀x y. x = (\<cn>y) ⟶  φ(x) ⟷ ψ(y)"   
   shows "(∃!x. x∈ℝ ∧ φ(x)) ⟶ 
   ⋃ {x ∈ ℝ. φ(x) } = (\<cn>(⋃ {y ∈ ℝ. ψ(y) }))"
proof -
  let ?C = "\<cn>(⋃ {y ∈ ℝ. ψ(y) })"
  { fix z
    have S1: "z ∈ {y ∈ ℝ. ψ(y) } ⟶ 
      (∀y. z ∈ {y ∈ ℝ. ψ(y) })" by (rule MMI_hbrab1)
    from S1 have S2: "z ∈ ⋃ {y ∈ ℝ. ψ(y) } ⟶ 
      (∀y. z ∈ ⋃ {y ∈ ℝ. ψ(y) })" by (rule MMI_hbuni)
    from S2 have "z ∈ (\<cn>(⋃ {y ∈ ℝ. ψ(y) })) ⟶ 
      (∀y. z ∈ (\<cn>(⋃ {y ∈ ℝ. ψ(y) })))" by (rule MMI_hbneg)
  } then have S3: "∀ z. z ∈ ?C ⟶ (∀y. z ∈ ?C)" by simp
  { fix y
    have "y ∈ ℝ ⟶ (\<cn>y) ∈ ℝ" by (rule MMI_renegclt)
  } then have S4: "∀ y. y ∈ ℝ ⟶ (\<cn>y) ∈ ℝ" by simp
   have S5: "⋃ {y ∈ ℝ. ψ(y) } ∈ ℝ ⟶ ?C ∈ ℝ" by (rule MMI_renegclt)
   from A1 have S6: "∀x y.  x = (\<cn>y) ⟶  φ(x) ⟷ ψ(y)" .
   { fix y
     have "y = ⋃ {y ∈ ℝ. ψ(y) } ⟶ 
       (\<cn>y) = (\<cn>(⋃ {y ∈ ℝ. ψ(y) }))" by (rule MMI_negeq)
   } then have S7: "∀ y. y = ⋃ {y ∈ ℝ. ψ(y) } ⟶ 
       (\<cn>y) = (\<cn>(⋃ {y ∈ ℝ. ψ(y) }))" by simp
   { fix x
     have "x ∈ ℝ ⟶ (\<cn>x) ∈ ℝ" by (rule MMI_renegclt)
   } then have S8: "∀ x. x ∈ ℝ ⟶ (\<cn>x) ∈ ℝ" by simp
   { fix x y
     have S9: "x ∈ ℂ ∧ y ∈ ℂ ⟶ 
       x = (\<cn>y) ⟷ y = (\<cn>x)" by (rule MMI_negcon2t)
     have S10: "x ∈ ℝ ⟶ x ∈ ℂ" by (rule MMI_recnt)
     have S11: "y ∈ ℝ ⟶ y ∈ ℂ" by (rule MMI_recnt)
     from S9 S10 S11 have "x ∈ ℝ ∧ y ∈ ℝ ⟶ 
       x = (\<cn>y) ⟷ y = (\<cn>x)" by (rule MMI_syl2an)
   } then have S12: "∀x y. x ∈ ℝ ∧ y ∈ ℝ ⟶ 
       x = (\<cn>y) ⟷ y = (\<cn>x)" by simp
   from S8 S12 have S13: "∀x. x ∈ ℝ ⟶ 
   (∃!y. y∈ℝ∧x = (\<cn>y))" by (rule MMI_reuhyp)
   from S3 S4 S5 S6 S7 S13 show "(∃!x. x∈ℝ ∧ φ(x)) ⟶ 
   ⋃ {x ∈ ℝ. φ(x) } = (\<cn>(⋃ {y ∈ ℝ. ψ(y) }))" by (rule MMI_reuunixfr)
qed

lemma (in MMIsar0) MMI_dfinfmr: 
   shows "A ⊆ℝ ⟶  Sup(A,ℝ,converse(\<cltrrset>)) = 
  ⋃ {x ∈ ℝ. (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) }"
proof -
  { fix x
    { fix y
      have S1: "x ∈ ℝ ∧ y ∈ ℝ ⟶ 
	x \<lsq> y ⟷ ¬(y \<ls> x)" by (rule MMI_lenltt)
      have S2: "x = x" by simp (*rule MMI_visset&*)
      have S3: "y = y" by simp (*rule MMI_visset*)
      from S2 S3 have S4: "x > y ⟷ y \<ls> x" by (rule MMI_brcnv)
      from S4 have S5: "¬(x > y) ⟷ ¬(y \<ls> x)" by (rule MMI_negbii)
      from S1 S5 have S6: "x ∈ ℝ ∧ y ∈ ℝ ⟶ 
	¬(x > y) ⟷ x \<lsq> y" by auto (*rule MMI_syl6rbbr*)
      have S7: "A ⊆ℝ ∧ y ∈ A ⟶ y ∈ ℝ" by (rule MMI_ssel2)
      from S6 S7 have S8: "x ∈ ℝ ∧ A ⊆ℝ ∧ y ∈ A ⟶ 
	¬(x > y) ⟷ x \<lsq> y" by (rule MMI_sylan2)
      from S8 have S9: "(A ⊆ℝ ∧ y ∈ A) ∧ x ∈ ℝ ⟶ 
	¬(x > y) ⟷ x \<lsq> y" by (rule MMI_ancoms)
      from S9 have "(A ⊆ℝ ∧ x ∈ ℝ) ∧ y ∈ A ⟶ 
	¬(x > y) ⟷ x \<lsq> y" by (rule MMI_an1rs)
    } then have S10: "∀ y. (A ⊆ℝ ∧ x ∈ ℝ) ∧ y ∈ A ⟶ 
	¬(x > y) ⟷ x \<lsq> y" by simp
    from S10 have S11: "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
      (∀y∈A. ¬(x > y)) ⟷ (∀y∈A. x \<lsq> y)" by (rule MMI_ralbidva)
    { fix y::i
      have S12: "y = y" by simp
      have S13: "x = x" by simp
      from S12 S13 have S14: "y > x ⟷ x \<ls> y" by (rule MMI_brcnv)
      have S15: "y = y" by simp
      { fix z::i
	have S16: "z = z" by simp
	from S15 S16 have S17: "y > z ⟷ z \<ls> y" by (rule MMI_brcnv)
      } then have  S17: "∀ z. y > z ⟷ z \<ls> y" by simp
      from S17 have S18: "( ∃z∈A. y > z) ⟷ ( ∃z∈A. z \<ls> y)" by (rule MMI_rexbii)
      from S14 S18 have "(y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
	(x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))" by (rule MMI_imbi12i)
    } then have  S19: "∀ y. (y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
	(x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))" by simp
    from S19 have S20: "(∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
      (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))" by (rule MMI_ralbii)
    from S20 have S21: "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
      (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
      (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))" by (rule MMI_a1i)
    from S11 S21 have S22: "A ⊆ℝ ∧ x ∈ ℝ ⟶ 
      (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
      (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))" 
      by (rule MMI_anbi12d)
    from S22 have "A ⊆ℝ ⟶ x ∈ ℝ ⟶ 
      (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
      (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))" 
      by (rule MMI_ex)
  } then have S23: "∀ x. A ⊆ℝ ⟶ x ∈ ℝ ⟶ 
      (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) ⟷ 
      (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y))"
    by simp
  from S23 have S24: "A ⊆ℝ ⟶ 
    {x ∈ ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) } = 
    {x ∈ ℝ. (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) }" 
    by (rule MMI_rabbidv)
  from S24 have S25: "A ⊆ℝ ⟶ 
    ⋃ {x ∈ ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) } = 
    ⋃ {x ∈ ℝ. (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) }" 
    by (rule MMI_unieqd)
  have S26: "Sup(A,ℝ,converse(\<cltrrset>)) = 
    ⋃ {x ∈ ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃z∈A. y > z)) }" 
    by (rule MMI_df_inf)
  from S25 S26 show "A ⊆ℝ ⟶  Sup(A,ℝ,converse(\<cltrrset>)) = 
    ⋃ {x ∈ ℝ. (∀y∈A. x \<lsq> y) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃z∈A. z \<ls> y)) }" 
    by (rule MMI_syl5eq)
qed

(******* 599,600 *****************************)

lemma (in MMIsar0) MMI_infmsup: 
   shows "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))"
proof -
  have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
    ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)))" 
    by (rule MMI_infm3)
  from S1 have S2: "A ⊆ℝ ⟶ 
    ¬(A = 0) ⟶ 
    ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
    ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)))" 
    by (rule MMI_3exp)
  { fix x v
    have S3: "x = (\<cn>v) ⟶ 
      y \<ls> x ⟷ y \<ls> (\<cn>v)" by (rule MMI_breq2)
    from S3 have S4: "x = (\<cn>v) ⟶ 
      ¬(y \<ls> x) ⟷ ¬(y \<ls> (\<cn>v))" by (rule MMI_negbid)
    from S4 have S5: "x = (\<cn>v) ⟶ 
      (∀y∈A. ¬(y \<ls> x)) ⟷ 
      (∀y∈A. ¬(y \<ls> (\<cn>v)))" by auto (*rule MMI_ralbidv*)
    have S6: "x = (\<cn>v) ⟶ 
      x \<ls> y ⟷ (\<cn>v) \<ls> y" by (rule MMI_breq1)
    from S6 have S7: "x = (\<cn>v) ⟶ 
      (x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
      ((\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by (rule MMI_imbi1d)
    from S7 have S8: "x = (\<cn>v) ⟶ 
      (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
      (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by auto (*rule MMI_ralbidv*)
    from S5 S8 have S9: "x = (\<cn>v) ⟶ 
      (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
      (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" 
      by (rule MMI_anbi12d)
  } then have S9: "∀ x v. x = (\<cn>v) ⟶ 
      (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
      (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" 
    by simp
  from S9 have S10: 
    "(∃!x. x∈ℝ ∧ (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))) ⟶ 
    ⋃ {x ∈ ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) } = 
    (\<cn>(⋃ {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ 
    ( ∃w∈A. w \<ls> y)) }))" by (rule MMI_reuunineg)
  have S11: "Sup(A,ℝ,converse(\<cltrrset>)) = 
   ⋃ {x ∈ ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) }" by (rule MMI_df_inf)
  { fix x::i 
    { fix y::i 
      have S12: "x = x" by simp (*rule MMI_visset*)
      have S13: "y = y" by simp (*rule MMI_visset*)
      from S12 S13 have S14: "x > y ⟷ y \<ls> x" by (rule MMI_brcnv)
      from S14 have S15: "¬(x > y) ⟷ ¬(y \<ls> x)" by (rule MMI_negbii)
    } then have  S15: "∀ y. ¬(x > y) ⟷ ¬(y \<ls> x)" by simp
    from S15 have S16: "(∀y∈A. ¬(x > y)) ⟷ 
      (∀y∈A. ¬(y \<ls> x))" by (rule MMI_ralbii)
    { fix y::i
      have S17: "y = y" by simp
      have S18: "x = x" by simp
      from S17 S18 have S19: "y > x ⟷ x \<ls> y" by (rule MMI_brcnv)
      have S20: "y = y" by simp
      { fix w::i
	have S21: "w = w" by simp (*rule MMI_visset*)
	from S20 S21 have S22: "y > w ⟷ w \<ls> y" by (rule MMI_brcnv)
      } then have  S22: "∀ w. y > w ⟷ w \<ls> y" by simp
      from S22 have S23: "( ∃w∈A. y > w) ⟷ ( ∃w∈A. w \<ls> y)" by (rule MMI_rexbii)
      from S19 S23 have "(y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
	(x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by (rule MMI_imbi12i)
    } then have S24: "∀y.(y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
	(x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by simp
    from S24 have S25: "(∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
      (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by (rule MMI_ralbii)
    from S16 S25 have "(∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
      (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" 
      by (rule MMI_anbi12i)
  } then have S26: "∀x. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
      (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by simp
  then have S27: "∀ x. x ∈ ℝ ⟶ 
    (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
    (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by simp
    from S27 have S28: 
      "{x ∈ ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) } = 
      {x ∈ ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) }" 
      by (rule MMI_rabbii)
    from S28 have S29: 
      "⋃ {x ∈ ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) } = 
      ⋃ {x ∈ ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) }" 
      by (rule MMI_unieqi)
    from S11 S29 have S30: "Sup(A,ℝ,converse(\<cltrrset>)) = 
      ⋃ {x ∈ ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) }" 
      by (rule MMI_eqtr)
    from S10 S30 have S31: 
      "(∃!x. x∈ℝ ∧ (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))) ⟶ 
      Sup(A,ℝ,converse(\<cltrrset>)) = 
      (\<cn>(⋃ {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ 
      ( ∃w∈A. w \<ls> y)) }))" by (rule MMI_syl5eq)
    { fix v
      { fix u
	have S32: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	  v \<ls> u ⟷ (\<cn>u) \<ls> (\<cn>v)" by (rule MMI_ltnegt)
	from S32 have S33: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	  ¬(v \<ls> u) ⟷ 
	  ¬((\<cn>u) \<ls> (\<cn>v))" by (rule MMI_negbid)
	from S33 have "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	  ((\<cn>u) ∈ A ⟶ ¬(v \<ls> u)) ⟷ 
	  ((\<cn>u) ∈ A ⟶ 
	  ¬((\<cn>u) \<ls> (\<cn>v)))" by (rule MMI_imbi2d)
    } then have  S34: "∀ u. v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	((\<cn>u) ∈ A ⟶ ¬(v \<ls> u)) ⟷ 
	((\<cn>u) ∈ A ⟶ ¬((\<cn>u) \<ls> (\<cn>v)))" by simp
    from S34 have S35: "v ∈ ℝ ⟶ 
      (∀u∈ℝ. (\<cn>u) ∈ A ⟶ ¬(v \<ls> u)) ⟷ 
      (∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
      ¬((\<cn>u) \<ls> (\<cn>v)))" by (rule MMI_ralbidva)
    have S36: "z = u ⟶ (\<cn>z) = (\<cn>u)" by (rule MMI_negeq)
    from S36 have S37: "z = u ⟶ 
      (\<cn>z) ∈ A ⟷ (\<cn>u) ∈ A" by (rule MMI_eleq1d)
    from S37 have S38: "u ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ⟷ 
      u ∈ ℝ ∧ (\<cn>u) ∈ A" by auto (*rule MMI_elrab*)
    from S38 have S39: "(u ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ⟶ ¬(v \<ls> u)) ⟷ 
      (u ∈ ℝ ∧ (\<cn>u) ∈ A ⟶ ¬(v \<ls> u))" by (rule MMI_imbi1i)
    have S40: "(u ∈ ℝ ∧ (\<cn>u) ∈ A ⟶ ¬(v \<ls> u)) ⟷ 
      (u ∈ ℝ ⟶ 
      (\<cn>u) ∈ A ⟶ ¬(v \<ls> u))" by (rule MMI_impexp)
    from S39 S40 have S41: "(u ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ⟶ ¬(v \<ls> u)) ⟷ 
      (u ∈ ℝ ⟶ 
      (\<cn>u) ∈ A ⟶ ¬(v \<ls> u))" by (rule MMI_bitr)
    from S41 have S42: "(∀u. u ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ⟶ ¬(v \<ls> u)) ⟷ 
      (∀u. u ∈ ℝ ⟶ 
      (\<cn>u) ∈ A ⟶ ¬(v \<ls> u))" by auto (*rule MMI_albii*)
    have S43: "(∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ⟷ 
      (∀u. u ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ⟶ ¬(v \<ls> u))" by (rule MMI_df_ral)
    have S44: "(∀u∈ℝ. (\<cn>u) ∈ A ⟶ ¬(v \<ls> u)) ⟷ 
      (∀u. u ∈ ℝ ⟶ 
      (\<cn>u) ∈ A ⟶ ¬(v \<ls> u))" by (rule MMI_df_ral)
    from S42 S43 S44 have S45: "(∀u∈ℝ. (\<cn>u) ∈ A ⟶ ¬(v \<ls> u)) ⟷ 
      (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u))" by (rule MMI_3bitr4r)
    from S35 S45 have S46: "v ∈ ℝ ⟶ 
      (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ⟷ 
      (∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
      ¬((\<cn>u) \<ls> (\<cn>v)))" by (rule MMI_syl5bbr)
    { fix u
      have S47: "u ∈ ℝ ∧ v ∈ ℝ ⟶ 
	u \<ls> v ⟷ (\<cn>v) \<ls> (\<cn>u)" by (rule MMI_ltnegt)
      from S47 have S48: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	u \<ls> v ⟷ (\<cn>v) \<ls> (\<cn>u)" by (rule MMI_ancoms)
      { fix t
	have S49: "u ∈ ℝ ∧ t ∈ ℝ ⟶ 
	  u \<ls> t ⟷ (\<cn>t) \<ls> (\<cn>u)" by (rule MMI_ltnegt)
	from S49 have "u ∈ ℝ ∧ t ∈ ℝ ⟶ 
	  (\<cn>t) ∈ A ∧ u \<ls> t ⟷ 
	  (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)" by (rule MMI_anbi2d)
      } then have S50: "∀ t. u ∈ ℝ ∧ t ∈ ℝ ⟶ 
	  (\<cn>t) ∈ A ∧ u \<ls> t ⟷ 
	  (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)" by simp
      from S50 have S51: "u ∈ ℝ ⟶ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ u \<ls> t) ⟷ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))" by (rule MMI_rexbidva)
      have S52: "z = t ⟶ (\<cn>z) = (\<cn>t)" by (rule MMI_negeq)
      from S52 have S53: "z = t ⟶ 
	(\<cn>z) ∈ A ⟷ (\<cn>t) ∈ A" by (rule MMI_eleq1d)
      from S53 have S54: "t ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ⟷ 
	t ∈ ℝ ∧ (\<cn>t) ∈ A" by auto (*rule MMI_elrab*)
      from S54 have S55: "t ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ∧ u \<ls> t ⟷ 
	(t ∈ ℝ ∧ (\<cn>t) ∈ A) ∧ u \<ls> t" by (rule MMI_anbi1i)
      have S56: "(t ∈ ℝ ∧ (\<cn>t) ∈ A) ∧ u \<ls> t ⟷ 
	t ∈ ℝ ∧ (\<cn>t) ∈ A ∧ u \<ls> t" by (rule MMI_anass)
      from S55 S56 have S57: "t ∈ {z ∈ ℝ. (\<cn>z) ∈ A } ∧ u \<ls> t ⟷ 
	t ∈ ℝ ∧ (\<cn>t) ∈ A ∧ u \<ls> t" by (rule MMI_bitr)
      from S57 have S58: "( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t) ⟷ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ u \<ls> t)" by auto (*rule MMI_rexbii2*)
      from S51 S58 have S59: "u ∈ ℝ ⟶ 
	( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t) ⟷ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))" by (rule MMI_syl5bb)
      from S59 have S60: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t) ⟷ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))" by (rule MMI_adantl)
      from S48 S60 have S61: "v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	(u \<ls> v ⟶ 
	( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
	((\<cn>v) \<ls> (\<cn>u) ⟶ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))" by (rule MMI_imbi12d)
    } then have S61: "∀ u. v ∈ ℝ ∧ u ∈ ℝ ⟶ 
	(u \<ls> v ⟶ ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
	((\<cn>v) \<ls> (\<cn>u) ⟶ ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))"
      by simp
    from S61 have S62: "v ∈ ℝ ⟶ 
      (∀u∈ℝ. u \<ls> v ⟶ 
      ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
      (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
      ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))" by (rule MMI_ralbidva)
    from S46 S62 have S63: "v ∈ ℝ ⟶ 
      (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
      ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
      (∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
      ¬((\<cn>u) \<ls> (\<cn>v))) ∧ (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
      ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))" by (rule MMI_anbi12d)
    have S64: "A ⊆ℝ ⟶ 
      y ∈ A ⟶ y ∈ ℝ" by (rule MMI_ssel)
    from S64 have S65: "A ⊆ℝ ⟶ 
      y ∈ A ⟷ 
      y ∈ ℝ ∧ y ∈ A" by (rule MMI_pm4_71rd)
    from S65 have S66: "A ⊆ℝ ⟶ 
      (y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
      (y ∈ ℝ ∧ y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by (rule MMI_imbi1d)
    have S67: "(y ∈ ℝ ∧ y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
      (y ∈ ℝ ⟶ 
      y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by (rule MMI_impexp)
    from S66 S67 have S68: "A ⊆ℝ ⟶ 
      (y ∈ ℝ ⟶ 
      y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
      (y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by (rule MMI_syl6rbb)
    from S68 have S69: "A ⊆ℝ ⟶ 
      (∀y. y ∈ ℝ ⟶ 
      y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
      (∀y. y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by auto (*rule MMI_albidv*)
    { fix u
      have "u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" by (rule MMI_renegclt)
    } then have S70: "∀ u. u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" by simp
    { fix y
      have "y ∈ ℝ ⟶ ( ∃u∈ℝ. y = (\<cn>u))" by (rule MMI_infm3lem)
    } then have S71: "∀ y. y ∈ ℝ ⟶ ( ∃u∈ℝ. y = (\<cn>u))" by simp
    { fix y u
      have S72: "y = (\<cn>u) ⟶ 
	y ∈ A ⟷ (\<cn>u) ∈ A" by (rule MMI_eleq1)
      have S73: "y = (\<cn>u) ⟶ 
	y \<ls> (\<cn>v) ⟷ (\<cn>u) \<ls> (\<cn>v)" by (rule MMI_breq1)
      from S73 have S74: "y = (\<cn>u) ⟶ 
	¬(y \<ls> (\<cn>v)) ⟷ 
	¬((\<cn>u) \<ls> (\<cn>v))" by (rule MMI_negbid)
      from S72 S74 have S75: "y = (\<cn>u) ⟶ 
	(y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
	((\<cn>u) ∈ A ⟶ 
	¬((\<cn>u) \<ls> (\<cn>v)))" by (rule MMI_imbi12d)
    } then have S75: "∀y u. y = (\<cn>u) ⟶ 
	(y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ ((\<cn>u) ∈ A ⟶  ¬((\<cn>u) \<ls> (\<cn>v)))" 
      by simp
    from S70 S71 S75 have S76: "(∀y∈ℝ. y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
      (∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
      ¬((\<cn>u) \<ls> (\<cn>v)))" by (rule MMI_ralxfr)
    have S77: "(∀y∈ℝ. y ∈ A ⟶ ¬(y \<ls> (\<cn>v))) ⟷ 
      (∀y. y ∈ ℝ ⟶ 
      y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by (rule MMI_df_ral)
    from S76 S77 have S78: "(∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
      ¬((\<cn>u) \<ls> (\<cn>v))) ⟷ 
      (∀y. y ∈ ℝ ⟶ 
      y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by (rule MMI_bitr3)
    have S79: "(∀y∈A. ¬(y \<ls> (\<cn>v))) ⟷ 
      (∀y. y ∈ A ⟶ ¬(y \<ls> (\<cn>v)))" by (rule MMI_df_ral)
    from S69 S78 S79 have S80: "A ⊆ℝ ⟶ 
      (∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
      ¬((\<cn>u) \<ls> (\<cn>v))) ⟷ 
      (∀y∈A. ¬(y \<ls> (\<cn>v)))" by (rule MMI_3bitr4g)
    { fix u
      have S81: "A ⊆ℝ ⟶ 
	w ∈ A ⟶ w ∈ ℝ" by (rule MMI_ssel)
      from S81 have S82: "A ⊆ℝ ⟶ 
	w ∈ A ∧ w \<ls> (\<cn>u) ⟶ w ∈ ℝ" by (rule MMI_adantrd)
      from S82 have S83: "A ⊆ℝ ⟶ 
	w ∈ A ∧ w \<ls> (\<cn>u) ⟷ 
	w ∈ ℝ ∧ w ∈ A ∧ w \<ls> (\<cn>u)" by (rule MMI_pm4_71rd)
      from S83 have S84: "A ⊆ℝ ⟶ 
	( ∃w. w ∈ A ∧ w \<ls> (\<cn>u)) ⟷ 
	( ∃w. w ∈ ℝ ∧ w ∈ A ∧ w \<ls> (\<cn>u))" by auto (*rule MMI_exbidv*)
      have S85: "( ∃w∈A. w \<ls> (\<cn>u)) ⟷ 
	( ∃w. w ∈ A ∧ w \<ls> (\<cn>u))" by (rule MMI_df_rex)
      { fix t
	have S86: "t ∈ ℝ ⟶ (\<cn>t) ∈ ℝ" by (rule MMI_renegclt)
      } then have S86: "∀ t. t ∈ ℝ ⟶ (\<cn>t) ∈ ℝ" by simp
      { fix w
	have S87: "w ∈ ℝ ⟶ ( ∃t∈ℝ. w = (\<cn>t))" by (rule MMI_infm3lem)
      } then have S87: "∀ w. w ∈ ℝ ⟶ ( ∃t∈ℝ. w = (\<cn>t))" by simp
      { fix w t
	have S88: "w = (\<cn>t) ⟶ 
	  w ∈ A ⟷ (\<cn>t) ∈ A" by (rule MMI_eleq1)
	have S89: "w = (\<cn>t) ⟶ 
	  w \<ls> (\<cn>u) ⟷ (\<cn>t) \<ls> (\<cn>u)" by (rule MMI_breq1)
	from S88 S89 have S90: "w = (\<cn>t) ⟶ 
	  w ∈ A ∧ w \<ls> (\<cn>u) ⟷ 
	  (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)" by (rule MMI_anbi12d)
      } then have  S90: "∀ w t. w = (\<cn>t) ⟶  w ∈ A ∧ w \<ls> (\<cn>u) ⟷ 
	  (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)" by simp
      from S86 S87 S90 have S91: "( ∃w∈ℝ. w ∈ A ∧ w \<ls> (\<cn>u)) ⟷ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))" by (rule MMI_rexxfr)
      have S92: "( ∃w∈ℝ. w ∈ A ∧ w \<ls> (\<cn>u)) ⟷ 
	( ∃w. w ∈ ℝ ∧ w ∈ A ∧ w \<ls> (\<cn>u))" by (rule MMI_df_rex)
      from S91 S92 have S93: "( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)) ⟷ 
	( ∃w. w ∈ ℝ ∧ w ∈ A ∧ w \<ls> (\<cn>u))" by (rule MMI_bitr3)
      from S84 S85 S93 have S94: "A ⊆ℝ ⟶ 
	( ∃w∈A. w \<ls> (\<cn>u)) ⟷ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))" by (rule MMI_3bitr4g)
      from S94 have "A ⊆ℝ ⟶ 
	((\<cn>v) \<ls> (\<cn>u) ⟶ 
	( ∃w∈A. w \<ls> (\<cn>u))) ⟷ 
	((\<cn>v) \<ls> (\<cn>u) ⟶ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))" by (rule MMI_imbi2d)
    } then have S95: "∀ u. A ⊆ℝ ⟶ 
	((\<cn>v) \<ls> (\<cn>u) ⟶ 
	( ∃w∈A. w \<ls> (\<cn>u))) ⟷ 
       ((\<cn>v) \<ls> (\<cn>u) ⟶ 
	( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))" by simp
    from S95 have S96: "A ⊆ℝ ⟶ 
      (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
      ( ∃w∈A. w \<ls> (\<cn>u))) ⟷ 
      (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
      ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u)))" by (rule MMI_ralbidv)
    from S70 have S97: "∀ u. u ∈ ℝ ⟶ (\<cn>u) ∈ ℝ" .
    from S71 have S98: "∀ y. y ∈ ℝ ⟶ ( ∃u∈ℝ. y = (\<cn>u))" .
    { fix y u
      have S99: "y = (\<cn>u) ⟶ 
	(\<cn>v) \<ls> y ⟷ (\<cn>v) \<ls> (\<cn>u)" by (rule MMI_breq2)
      { fix w
	have "y = (\<cn>u) ⟶ 
	  w \<ls> y ⟷ w \<ls> (\<cn>u)" by (rule MMI_breq2)
      } then have S100: "∀ w. y = (\<cn>u) ⟶ 
	  w \<ls> y ⟷ w \<ls> (\<cn>u)" by simp
      from S100 have S101: "y = (\<cn>u) ⟶ 
	( ∃w∈A. w \<ls> y) ⟷ 
	( ∃w∈A. w \<ls> (\<cn>u))" by (rule MMI_rexbidv)
     from S99 S101 have "y = (\<cn>u) ⟶ 
       ((\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
       ((\<cn>v) \<ls> (\<cn>u) ⟶ 
       ( ∃w∈A. w \<ls> (\<cn>u)))" by (rule MMI_imbi12d)
   } then have S102: "∀ y u. y = (\<cn>u) ⟶ 
       ((\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
       ((\<cn>v) \<ls> (\<cn>u) ⟶ 
       ( ∃w∈A. w \<ls> (\<cn>u)))" by simp
   from S97 S98 S102 have S103: "(∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) ⟷ 
     (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
     ( ∃w∈A. w \<ls> (\<cn>u)))" by (rule MMI_ralxfr)
   from S96 S103 have S104: "A ⊆ℝ ⟶ 
     (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
     ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))) ⟷ 
     (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" by (rule MMI_syl5rbb)
   from S80 S104 have S105: "A ⊆ℝ ⟶ 
     (∀u∈ℝ. (\<cn>u) ∈ A ⟶ 
     ¬((\<cn>u) \<ls> (\<cn>v))) ∧ (∀u∈ℝ. (\<cn>v) \<ls> (\<cn>u) ⟶ 
     ( ∃t∈ℝ. (\<cn>t) ∈ A ∧ (\<cn>t) \<ls> (\<cn>u))) ⟷ 
     (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" 
     by (rule MMI_anbi12d)
   from S63 S105 have S106: "A ⊆ℝ ∧ v ∈ ℝ ⟶ 
     (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
     ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
     (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" 
     by (rule MMI_sylan9bbr)
   from S106 have S107: "A ⊆ℝ ⟶  v ∈ ℝ ⟶ 
     (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
     ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
     (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" 
     by (rule MMI_ex)
 } then have S107: "∀ v. A ⊆ℝ ⟶  v ∈ ℝ ⟶ 
     (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
     ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) ⟷ 
     (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y))"
   by simp
   from S107 have S108: "A ⊆ℝ ⟶ 
     {v ∈ ℝ. (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
     ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) } = 
     {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ 
     ( ∃w∈A. w \<ls> y)) }" by (rule MMI_rabbidv)
   from S108 have S109: "A ⊆ℝ ⟶  
     ⋃ {v ∈ ℝ. (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
     ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) } = 
     ⋃ {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ 
     (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) }" by (rule MMI_unieqd)
   have S110: "Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>) = 
     ⋃ {v ∈ ℝ. (∀u∈{z ∈ ℝ. (\<cn>z) ∈ A }. ¬(v \<ls> u)) ∧ (∀u∈ℝ. u \<ls> v ⟶ 
     ( ∃t∈{z ∈ ℝ. (\<cn>z) ∈ A }. u \<ls> t)) }" by (rule MMI_df_sup)
   from S109 S110 have S111: "A ⊆ℝ ⟶ Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>) = 
     ⋃ {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ 
     (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) }" by (rule MMI_syl5eq)
   from S111 have S112: "A ⊆ℝ ⟶ 
     (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>)) = 
     (\<cn>(⋃ {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ 
     (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) }))" by (rule MMI_negeqd)
   from S112 have S113: "A ⊆ℝ ⟶ 
   (\<cn>(⋃ {v ∈ ℝ. (∀y∈A. ¬(y \<ls> (\<cn>v))) ∧ 
     (∀y∈ℝ. (\<cn>v) \<ls> y ⟶ ( ∃w∈A. w \<ls> y)) })) = 
     (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))" by (rule MMI_eqcomd)
   from S31 S113 have S114: "A ⊆ℝ ∧ (∃!x. x∈ℝ ∧ (∀y∈A. ¬(y \<ls> x)) ∧ 
     (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))) ⟶ 
     Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))" 
     by (rule MMI_sylan9eqr)
   from S114 have S115: "A ⊆ℝ ⟶ 
   (∃!x. x∈ℝ ∧ (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))" 
     by (rule MMI_ex)
   have S116: "\<cltrrset> Orders ℝ" by (rule MMI_ltso)
   have S117: "\<cltrrset> Orders ℝ ⟷ converse(\<cltrrset>) Orders ℝ" by (rule MMI_cnvso)
   from S116 S117 have S118: "converse(\<cltrrset>) Orders ℝ" by (rule MMI_mpbi)
   from S118 have S119: 
     "( ∃x∈ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w))) ⟶ 
     (∃!x. x∈ℝ ∧ (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)))" 
     by (rule MMI_infeu)
   (*from S26 have S120: "(∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
     (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" .;*)
   from (*S120*) S26 have S121: 
     "( ∃x∈ℝ. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w))) ⟷ 
     ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)))" 
     by (rule MMI_rexbii)
   from S26 have S122: "∀ x. (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w)) ⟷ 
   (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))" .
   from S122 have S123: 
     "(∃!x. x∈ℝ ∧ (∀y∈A. ¬(x > y)) ∧ (∀y∈ℝ. y > x ⟶ ( ∃w∈A. y > w))) ⟷ 
   (∃!x. x∈ℝ ∧ (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)))" 
     by (rule MMI_reubii)
   from S119 S121 S123 have S124: 
     "( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))) ⟶ 
   (∃!x. x∈ℝ ∧ (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y)))" 
     by (rule MMI_3imtr3)
   from S115 S124 have S125: "A ⊆ℝ ⟶ 
   ( ∃x∈ℝ. (∀y∈A. ¬(y \<ls> x)) ∧ (∀y∈ℝ. x \<ls> y ⟶ ( ∃w∈A. w \<ls> y))) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))" 
     by (rule MMI_syl5)
   from S2 S125 have S126: "A ⊆ℝ ⟶ 
   ¬(A = 0) ⟶ 
   ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))" 
     by (rule MMI_syl6d)
   from S126 show "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({z ∈ ℝ. (\<cn>z) ∈ A },ℝ,\<cltrrset>))" 
     by (rule MMI_3imp)
qed

lemma (in MMIsar0) MMI_infmrcl: 
   shows "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) ∈ ℝ"
proof -
   have S1: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
   Sup(A,ℝ,converse(\<cltrrset>)) = (\<cn>Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>))" 
     by (rule MMI_infmsup)
   have S2: "{v ∈ ℝ. (\<cn>v) ∈ A } ⊆ℝ" by (rule MMI_ssrab2)
   have S3: "{v ∈ ℝ. (\<cn>v) ∈ A } ⊆ℝ ∧ ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0) ∧ 
     ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z) ⟶ 
     Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>) ∈ ℝ" by (rule MMI_suprcl)
   from S2 S3 have S4: "¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0) ∧ 
     ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z) ⟶ 
     Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>) ∈ ℝ" by (rule MMI_mp3an1)
   { fix z
     have S5: "A ⊆ℝ ⟶ 
       z ∈ A ⟶ z ∈ ℝ" by (rule MMI_ssel)
     have S6: "z ∈ ℝ ⟶ (\<cn>z) ∈ ℝ" by (rule MMI_renegclt)
     from S5 S6 have S7: "A ⊆ℝ ⟶ 
       z ∈ A ⟶ (\<cn>z) ∈ ℝ" by (rule MMI_syl6)
     have S8: "A ⊆ℝ ∧ z ∈ A ⟶ z ∈ ℝ" by (rule MMI_ssel2)
     have S9: "z ∈ ℝ ⟶ z ∈ ℂ" by (rule MMI_recnt)
     have S10: "z ∈ ℂ ⟶ (\<cn>(\<cn>z)) = z" by (rule MMI_negnegt)
     from S8 S9 S10 have S11: "A ⊆ℝ ∧ z ∈ A ⟶ (\<cn>(\<cn>z)) = z" by (rule MMI_3syl)
     have S12: "A ⊆ℝ ∧ z ∈ A ⟶ z ∈ A" by (rule MMI_pm3_27)
     from S11 S12 have S13: "A ⊆ℝ ∧ z ∈ A ⟶ (\<cn>(\<cn>z)) ∈ A" by (rule MMI_eqeltrd)
     from S13 have S14: "A ⊆ℝ ⟶ 
       z ∈ A ⟶ (\<cn>(\<cn>z)) ∈ A" by (rule MMI_ex)
     from S7 S14 have S15: "A ⊆ℝ ⟶ 
       z ∈ A ⟶ 
       (\<cn>z) ∈ ℝ ∧ (\<cn>(\<cn>z)) ∈ A" by (rule MMI_jcad)
     have S16: "v = (\<cn>z) ⟶ (\<cn>v) = (\<cn>(\<cn>z))" by (rule MMI_negeq)
     from S16 have S17: "v = (\<cn>z) ⟶ 
       (\<cn>v) ∈ A ⟷ (\<cn>(\<cn>z)) ∈ A" by (rule MMI_eleq1d)
     from S17 have S18: "(\<cn>z) ∈ {v ∈ ℝ. (\<cn>v) ∈ A } ⟷ 
       (\<cn>z) ∈ ℝ ∧ (\<cn>(\<cn>z)) ∈ A" by auto (*rule MMI_elrab*)
     have S19: "(\<cn>z) ∈ {v ∈ ℝ. (\<cn>v) ∈ A } ⟶ 
       ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_n0i)
     from S18 S19 have S20: "(\<cn>z) ∈ ℝ ∧ (\<cn>(\<cn>z)) ∈ A ⟶ 
       ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_sylbir)
     from S15 S20 have "A ⊆ℝ ⟶ z ∈ A ⟶ 
       ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_syl6)
   } then have S21: "∀ z. A ⊆ℝ ⟶  z ∈ A ⟶ 
       ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by simp
   from S21 have S22: "A ⊆ℝ ⟶ ( ∃z. z ∈ A) ⟶ 
     ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_19_23adv)
   from S22 have S23: "A ⊆ℝ ∧ ( ∃z. z ∈ A) ⟶ 
     ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_imp)
   have S24: "¬(A = 0) ⟷ ( ∃z. z ∈ A)" by (rule MMI_n0)
   from S23 S24 have S25: "A ⊆ℝ ∧ ¬(A = 0) ⟶ 
     ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_sylan2b)
   from S25 have S26: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
     ¬({v ∈ ℝ. (\<cn>v) ∈ A } = 0)" by (rule MMI_3adant3)
   { fix x
     { fix w
       have S27: "y = (\<cn>w) ⟶ 
	 x \<lsq> y ⟷ x \<lsq> (\<cn>w)" by (rule MMI_breq2)
       from S27 have S28: "(\<cn>w) ∈ A ∧ (∀y∈A. x \<lsq> y) ⟶ x \<lsq> (\<cn>w)" 
	 by auto (*rule MMI_rcla4va*)
       from S28 have S29: 
	 "(w ∈ ℝ ∧ (\<cn>w) ∈ A) ∧ (∀y∈A. x \<lsq> y) ⟶ x \<lsq> (\<cn>w)" 
	 by (rule MMI_adantll)
       from S29 have S30: 
	 "(x ∈ ℝ ∧ w ∈ ℝ ∧ (\<cn>w) ∈ A) ∧ (∀y∈A. x \<lsq> y) ⟶ 
	 x \<lsq> (\<cn>w)" by (rule MMI_adantll)
       have S31: "x ∈ ℝ ∧ w ∈ ℝ ⟶ 
	 x \<lsq> (\<cn>w) ⟷ w \<lsq> (\<cn>x)" by (rule MMI_lenegcon2t)
       from S31 have S32: "x ∈ ℝ ∧ w ∈ ℝ ∧ (\<cn>w) ∈ A ⟶ 
	 x \<lsq> (\<cn>w) ⟷ w \<lsq> (\<cn>x)" by (rule MMI_adantrr)
       from S32 have S33: "(x ∈ ℝ ∧ w ∈ ℝ ∧ (\<cn>w) ∈ A) ∧ (∀y∈A. x \<lsq> y) ⟶ 
	 x \<lsq> (\<cn>w) ⟷ w \<lsq> (\<cn>x)" by (rule MMI_adantr)
       from S30 S33 have S34: 
	 "(x ∈ ℝ ∧ w ∈ ℝ ∧ (\<cn>w) ∈ A) ∧ (∀y∈A. x \<lsq> y) ⟶ 
	 w \<lsq> (\<cn>x)" by (rule MMI_mpbid)
       from S34 have S35: "x ∈ ℝ ⟶ 
	 w ∈ ℝ ∧ (\<cn>w) ∈ A ⟶ 
	 (∀y∈A. x \<lsq> y) ⟶ w \<lsq> (\<cn>x)" by (rule MMI_exp31)
       have S36: "v = w ⟶ (\<cn>v) = (\<cn>w)" by (rule MMI_negeq)
       from S36 have S37: "v = w ⟶ 
	 (\<cn>v) ∈ A ⟷ (\<cn>w) ∈ A" by (rule MMI_eleq1d)
       from S37 have S38: "w ∈ {v ∈ ℝ. (\<cn>v) ∈ A } ⟷ 
	 w ∈ ℝ ∧ (\<cn>w) ∈ A" by auto (*rule MMI_elrab*)
       from S35 S38 have S39: "x ∈ ℝ ⟶ 
	 w ∈ {v ∈ ℝ. (\<cn>v) ∈ A } ⟶ 
	 (∀y∈A. x \<lsq> y) ⟶ w \<lsq> (\<cn>x)" by (rule MMI_syl5ib)
       from S39 have S40: "x ∈ ℝ ⟶ 
	 (∀y∈A. x \<lsq> y) ⟶ 
	 w ∈ {v ∈ ℝ. (\<cn>v) ∈ A } ⟶ w \<lsq> (\<cn>x)" by (rule MMI_com23)
     } then have S40: "x ∈ ℝ ⟶  (∀y∈A. x \<lsq> y) ⟶ 
	 (∀ w. w ∈ {v ∈ ℝ. (\<cn>v) ∈ A } ⟶ w \<lsq> (\<cn>x))" by simp
     from S40 have S41: "x ∈ ℝ ⟶ 
       (∀y∈A. x \<lsq> y) ⟶ 
       (∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> (\<cn>x))" by auto (*rule MMI_r19_21adv*)
     have S42: "x ∈ ℝ ⟶ (\<cn>x) ∈ ℝ" by (rule MMI_renegclt)
     from S41 S42 have S43: "x ∈ ℝ ⟶ 
       (∀y∈A. x \<lsq> y) ⟶ 
       (\<cn>x) ∈ ℝ ∧ (∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> (\<cn>x))" by (rule MMI_jctild)
     have S44: "z = (\<cn>x) ⟶ 
       w \<lsq> z ⟷ w \<lsq> (\<cn>x)" by (rule MMI_breq2)
     from S44 have S45: "z = (\<cn>x) ⟶ 
       (∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z) ⟷ 
       (∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> (\<cn>x))" by auto (*rule MMI_ralbidv*)
     from S45 have S46: "(\<cn>x) ∈ ℝ ∧ (∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> (\<cn>x)) ⟶ 
       ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z)" by auto (*rule MMI_rcla4ev*)
     from S43 S46 have "x ∈ ℝ ⟶ 
       (∀y∈A. x \<lsq> y) ⟶ 
       ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z)" by (rule MMI_syl6)
   } then have S47: "∀ x. x ∈ ℝ ⟶ (∀y∈A. x \<lsq> y) ⟶ 
       ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z)"
     by simp
   from S47 have S48: "( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
     ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z)" by (rule MMI_r19_23aiv)
   from S48 have S49: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
     ( ∃z∈ℝ. ∀w∈{v ∈ ℝ. (\<cn>v) ∈ A }. w \<lsq> z)" by (rule MMI_3ad2ant3)
   from S4 S26 S49 have S50: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
     Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>) ∈ ℝ" by (rule MMI_sylanc)
   have S51: "Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>) ∈ ℝ ⟶ 
     (\<cn>Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>)) ∈ ℝ" by (rule MMI_renegclt)
   from S50 S51 have S52: "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
     (\<cn>Sup({v ∈ ℝ. (\<cn>v) ∈ A },ℝ,\<cltrrset>)) ∈ ℝ" by (rule MMI_syl)
   from S1 S52 show "A ⊆ℝ ∧ ¬(A = 0) ∧ ( ∃x∈ℝ. ∀y∈A. x \<lsq> y) ⟶ 
     Sup(A,ℝ,converse(\<cltrrset>)) ∈ ℝ" by (rule MMI_eqeltrd)
 qed
end