(* This file is a part of MMIsar - a translation of Metamath's set.mm to Isabelle 2005 (ZF logic). Copyright (C) 2006 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 1› theory MMI_Complex_ZF_1 imports MMI_examples 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 full atribution. This theory contains about 200 theorems. *} (********211-220*************************) lemma (in MMIsar0) MMI_recrect: shows "( A ∈ ℂ ∧ A ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> ( 𝟭 \<cdiv> A ) ) = A" proof - have S1: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) )" by (rule MMI_opreq2) from S1 have S2: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( 𝟭 \<cdiv> ( 𝟭 \<cdiv> A ) ) = ( 𝟭 \<cdiv> ( 𝟭 \<cdiv> if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ) )" by (rule MMI_opreq2d) have S3: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 )" by (rule MMI_id) from S2 S3 have S4: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( ( 𝟭 \<cdiv> ( 𝟭 \<cdiv> A ) ) = A ⟷ ( 𝟭 \<cdiv> ( 𝟭 \<cdiv> if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ) ) = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) )" by (rule MMI_eqeq12d) have S5: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( A ∈ ℂ ⟷ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ )" by (rule MMI_eleq1) have S6: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( A ≠ 𝟬 ⟷ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬 )" by (rule MMI_neeq1) from S5 S6 have S7: "A = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) ⟷ ( if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ ∧ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬 ) )" by (rule MMI_anbi12d) have S8: "𝟭 = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( 𝟭 ∈ ℂ ⟷ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ )" by (rule MMI_eleq1) have S9: "𝟭 = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( 𝟭 ≠ 𝟬 ⟷ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬 )" by (rule MMI_neeq1) from S8 S9 have S10: "𝟭 = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ⟶ ( ( 𝟭 ∈ ℂ ∧ 𝟭 ≠ 𝟬 ) ⟷ ( if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ ∧ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬 ) )" by (rule MMI_anbi12d) have S11: "𝟭 ∈ ℂ" by (rule MMI_1cn) have S12: "𝟭 ≠ 𝟬" by (rule MMI_ax1ne0) from S11 S12 have S13: "𝟭 ∈ ℂ ∧ 𝟭 ≠ 𝟬" by (rule MMI_pm3_2i) from S7 S10 S13 have S14: "if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ ∧ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬" by (rule MMI_elimhyp) from S14 have S15: "if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ" by (rule MMI_pm3_26i) from S14 have S16: "if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ∈ ℂ ∧ if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬" . from S16 have S17: "if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ≠ 𝟬" by (rule MMI_pm3_27i) from S15 S17 have S18: "( 𝟭 \<cdiv> ( 𝟭 \<cdiv> if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 ) ) ) = if ( ( A ∈ ℂ ∧ A ≠ 𝟬 ) , A , 𝟭 )" by (rule MMI_recrec) from S4 S18 show "( A ∈ ℂ ∧ A ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> ( 𝟭 \<cdiv> A ) ) = A" by (rule MMI_dedth) qed lemma (in MMIsar0) MMI_rec11i: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "A ≠ 𝟬" and A4: "B ≠ 𝟬" shows "( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟷ A = B" proof - have S1: "( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟶ ( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> A ) ) = ( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_opreq2) from A1 have S2: "A ∈ ℂ". from A2 have S3: "B ∈ ℂ". from A1 have S4: "A ∈ ℂ". from A3 have S5: "A ≠ 𝟬". from S4 S5 have S6: "( 𝟭 \<cdiv> A ) ∈ ℂ" by (rule MMI_reccl) from S2 S3 S6 have S7: "( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> A ) ) = ( ( A ⋅ ( 𝟭 \<cdiv> A ) ) ⋅ B )" by (rule MMI_mul23) from A1 have S8: "A ∈ ℂ". from A3 have S9: "A ≠ 𝟬". from S8 S9 have S10: "( A ⋅ ( 𝟭 \<cdiv> A ) ) = 𝟭" by (rule MMI_recid) from S10 have S11: "( ( A ⋅ ( 𝟭 \<cdiv> A ) ) ⋅ B ) = ( 𝟭 ⋅ B )" by (rule MMI_opreq1i) from A2 have S12: "B ∈ ℂ". from S12 have S13: "( 𝟭 ⋅ B ) = B" by (rule MMI_mulid2) from S7 S11 S13 have S14: "( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> A ) ) = B" by (rule MMI_3eqtr) from A1 have S15: "A ∈ ℂ". from A2 have S16: "B ∈ ℂ". from A2 have S17: "B ∈ ℂ". from A4 have S18: "B ≠ 𝟬". from S17 S18 have S19: "( 𝟭 \<cdiv> B ) ∈ ℂ" by (rule MMI_reccl) from S15 S16 S19 have S20: "( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> B ) ) = ( A ⋅ ( B ⋅ ( 𝟭 \<cdiv> B ) ) )" by (rule MMI_mulass) from A2 have S21: "B ∈ ℂ". from A4 have S22: "B ≠ 𝟬". from S21 S22 have S23: "( B ⋅ ( 𝟭 \<cdiv> B ) ) = 𝟭" by (rule MMI_recid) from S23 have S24: "( A ⋅ ( B ⋅ ( 𝟭 \<cdiv> B ) ) ) = ( A ⋅ 𝟭 )" by (rule MMI_opreq2i) from A1 have S25: "A ∈ ℂ". from S25 have S26: "( A ⋅ 𝟭 ) = A" by (rule MMI_mulid1) from S20 S24 S26 have S27: "( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> B ) ) = A" by (rule MMI_3eqtr) from S14 S27 have S28: "( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> A ) ) = ( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> B ) ) ⟷ B = A" by (rule MMI_eqeq12i) have S29: "B = A ⟷ A = B" by (rule MMI_eqcom) from S28 S29 have S30: "( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> A ) ) = ( ( A ⋅ B ) ⋅ ( 𝟭 \<cdiv> B ) ) ⟷ A = B" by (rule MMI_bitr) from S1 S30 have S31: "( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟶ A = B" by (rule MMI_sylib) have S32: "A = B ⟶ ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B )" by (rule MMI_opreq2) from S31 S32 show "( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟷ A = B" by (rule MMI_impbi) qed lemma (in MMIsar0) MMI_rec11: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" shows "( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ⟶ ( ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟷ A = B )" proof - have S1: "A = if ( A ≠ 𝟬 , A , 𝟭 ) ⟶ ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) )" by (rule MMI_opreq2) from S1 have S2: "A = if ( A ≠ 𝟬 , A , 𝟭 ) ⟶ ( ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟷ ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> B ) )" by (rule MMI_eqeq1d) have S3: "A = if ( A ≠ 𝟬 , A , 𝟭 ) ⟶ ( A = B ⟷ if ( A ≠ 𝟬 , A , 𝟭 ) = B )" by (rule MMI_eqeq1) from S2 S3 have S4: "A = if ( A ≠ 𝟬 , A , 𝟭 ) ⟶ ( ( ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟷ A = B ) ⟷ ( ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> B ) ⟷ if ( A ≠ 𝟬 , A , 𝟭 ) = B ) )" by (rule MMI_bibi12d) have S5: "B = if ( B ≠ 𝟬 , B , 𝟭 ) ⟶ ( 𝟭 \<cdiv> B ) = ( 𝟭 \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) )" by (rule MMI_opreq2) from S5 have S6: "B = if ( B ≠ 𝟬 , B , 𝟭 ) ⟶ ( ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> B ) ⟷ ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) ) )" by (rule MMI_eqeq2d) have S7: "B = if ( B ≠ 𝟬 , B , 𝟭 ) ⟶ ( if ( A ≠ 𝟬 , A , 𝟭 ) = B ⟷ if ( A ≠ 𝟬 , A , 𝟭 ) = if ( B ≠ 𝟬 , B , 𝟭 ) )" by (rule MMI_eqeq2) from S6 S7 have S8: "B = if ( B ≠ 𝟬 , B , 𝟭 ) ⟶ ( ( ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> B ) ⟷ if ( A ≠ 𝟬 , A , 𝟭 ) = B ) ⟷ ( ( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) ) ⟷ if ( A ≠ 𝟬 , A , 𝟭 ) = if ( B ≠ 𝟬 , B , 𝟭 ) ) )" by (rule MMI_bibi12d) from A1 have S9: "A ∈ ℂ". have S10: "𝟭 ∈ ℂ" by (rule MMI_1cn) from S9 S10 have S11: "if ( A ≠ 𝟬 , A , 𝟭 ) ∈ ℂ" by (rule MMI_keepel) from A2 have S12: "B ∈ ℂ". have S13: "𝟭 ∈ ℂ" by (rule MMI_1cn) from S12 S13 have S14: "if ( B ≠ 𝟬 , B , 𝟭 ) ∈ ℂ" by (rule MMI_keepel) have S15: "if ( A ≠ 𝟬 , A , 𝟭 ) ≠ 𝟬" by (rule MMI_elimne0) have S16: "if ( B ≠ 𝟬 , B , 𝟭 ) ≠ 𝟬" by (rule MMI_elimne0) from S11 S14 S15 S16 have S17: "( 𝟭 \<cdiv> if ( A ≠ 𝟬 , A , 𝟭 ) ) = ( 𝟭 \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) ) ⟷ if ( A ≠ 𝟬 , A , 𝟭 ) = if ( B ≠ 𝟬 , B , 𝟭 )" by (rule MMI_rec11i) from S4 S8 S17 show "( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ⟶ ( ( 𝟭 \<cdiv> A ) = ( 𝟭 \<cdiv> B ) ⟷ A = B )" by (rule MMI_dedth2h) qed lemma (in MMIsar0) MMI_divmuldivt: shows "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" proof - have S1: "( ( B ⋅ D ) ∈ ℂ ∧ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ∈ ℂ ∧ ( B ⋅ D ) ≠ 𝟬 ) ⟶ ( ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ) \<cdiv> ( B ⋅ D ) ) = ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) )" by (rule MMI_divcan3t) have S2: "( B ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( B ⋅ D ) ∈ ℂ" by (rule MMI_axmulcl) from S2 have S3: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ D ) ∈ ℂ" by (rule MMI_ad2ant2l) from S3 have S4: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B ⋅ D ) ∈ ℂ" by (rule MMI_adantr) have S5: "( ( A \<cdiv> B ) ∈ ℂ ∧ ( C \<cdiv> D ) ∈ ℂ ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ∈ ℂ" by (rule MMI_axmulcl) have S6: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_divclt) from S6 have S7: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_3expa) have S8: "( C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_divclt) from S8 have S9: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_3expa) from S5 S7 S9 have S10: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ∧ ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ∈ ℂ" by (rule MMI_syl2an) from S10 have S11: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ∈ ℂ" by (rule MMI_an4s) have S12: "( B ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( B ⋅ D ) ≠ 𝟬 )" by (rule MMI_muln0bt) from S12 have S13: "( B ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟶ ( B ⋅ D ) ≠ 𝟬 )" by (rule MMI_biimpd) from S13 have S14: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟶ ( B ⋅ D ) ≠ 𝟬 )" by (rule MMI_ad2ant2l) from S14 have S15: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B ⋅ D ) ≠ 𝟬" by (rule MMI_imp) from S1 S4 S11 S15 have S16: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ) \<cdiv> ( B ⋅ D ) ) = ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) )" by (rule MMI_syl3anc) have S17: "( ( B ∈ ℂ ∧ ( A \<cdiv> B ) ∈ ℂ ) ∧ ( D ∈ ℂ ∧ ( C \<cdiv> D ) ∈ ℂ ) ) ⟶ ( ( B ⋅ ( A \<cdiv> B ) ) ⋅ ( D ⋅ ( C \<cdiv> D ) ) ) = ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) )" by (rule MMI_mul4t) have S18: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ B ∈ ℂ" by (rule MMI_3simp2) from S6 have S19: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" . from S18 S19 have S20: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( B ∈ ℂ ∧ ( A \<cdiv> B ) ∈ ℂ )" by (rule MMI_jca) from S20 have S21: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( B ∈ ℂ ∧ ( A \<cdiv> B ) ∈ ℂ )" by (rule MMI_3expa) have S22: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ D ∈ ℂ" by (rule MMI_pm3_27) from S22 have S23: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ D ∈ ℂ" by (rule MMI_adantr) from S9 have S24: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" . from S23 S24 have S25: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( D ∈ ℂ ∧ ( C \<cdiv> D ) ∈ ℂ )" by (rule MMI_jca) from S17 S21 S25 have S26: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ∧ ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ) ⟶ ( ( B ⋅ ( A \<cdiv> B ) ) ⋅ ( D ⋅ ( C \<cdiv> D ) ) ) = ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) )" by (rule MMI_syl2an) have S27: "( B ∈ ℂ ∧ A ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( B ⋅ ( A \<cdiv> B ) ) = A" by (rule MMI_divcan2t) from S27 have S28: "B ∈ ℂ ⟶ ( A ∈ ℂ ⟶ ( B ≠ 𝟬 ⟶ ( B ⋅ ( A \<cdiv> B ) ) = A ) )" by (rule MMI_3exp) from S28 have S29: "( A ∈ ℂ ∧ B ∈ ℂ ) ⟶ ( B ≠ 𝟬 ⟶ ( B ⋅ ( A \<cdiv> B ) ) = A )" by (rule MMI_impcom) from S29 have S30: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( B ⋅ ( A \<cdiv> B ) ) = A" by (rule MMI_imp) have S31: "( D ∈ ℂ ∧ C ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( D ⋅ ( C \<cdiv> D ) ) = C" by (rule MMI_divcan2t) from S31 have S32: "( C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( D ⋅ ( C \<cdiv> D ) ) = C" by (rule MMI_3com12) from S32 have S33: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( D ⋅ ( C \<cdiv> D ) ) = C" by (rule MMI_3expa) from S30 S33 have S34: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ∧ ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ) ⟶ ( ( B ⋅ ( A \<cdiv> B ) ) ⋅ ( D ⋅ ( C \<cdiv> D ) ) ) = ( A ⋅ C )" by (rule MMI_opreqan12d) from S26 S34 have S35: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ∧ ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ) ⟶ ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ) = ( A ⋅ C )" by (rule MMI_eqtr3d) from S35 have S36: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ) = ( A ⋅ C )" by (rule MMI_an4s) from S36 have S37: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( ( B ⋅ D ) ⋅ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) ) \<cdiv> ( B ⋅ D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_opreq1d) from S16 S37 show "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_eqtr3d) qed lemma (in MMIsar0) MMI_divcan5t: shows "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( ( C ⋅ A ) \<cdiv> ( C ⋅ B ) ) = ( A \<cdiv> B )" proof - have S1: "( C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ ( C \<cdiv> C ) = 𝟭" by (rule MMI_dividt) from S1 have S2: "( C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ ( ( C \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( 𝟭 ⋅ ( A \<cdiv> B ) )" by (rule MMI_opreq1d) from S2 have S3: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( ( C \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( 𝟭 ⋅ ( A \<cdiv> B ) )" by (rule MMI_3ad2ant3) have S4: "( ( ( C ∈ ℂ ∧ C ∈ ℂ ) ∧ ( A ∈ ℂ ∧ B ∈ ℂ ) ) ∧ ( C ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( C \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( ( C ⋅ A ) \<cdiv> ( C ⋅ B ) )" by (rule MMI_divmuldivt) have S5: "( C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ C ∈ ℂ" by (rule MMI_pm3_26) from S5 have S6: "( C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ C ∈ ℂ" . from S5 S6 have S7: "( C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ ( C ∈ ℂ ∧ C ∈ ℂ )" by (rule MMI_jca) have S8: "( B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ B ∈ ℂ" by (rule MMI_pm3_26) from S8 have S9: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ) ⟶ ( A ∈ ℂ ∧ B ∈ ℂ )" by (rule MMI_anim2i) from S7 S9 have S10: "( ( C ∈ ℂ ∧ C ≠ 𝟬 ) ∧ ( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ) ) ⟶ ( ( C ∈ ℂ ∧ C ∈ ℂ ) ∧ ( A ∈ ℂ ∧ B ∈ ℂ ) )" by (rule MMI_anim12i) from S10 have S11: "( ( C ∈ ℂ ∧ C ≠ 𝟬 ) ∧ A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ) ⟶ ( ( C ∈ ℂ ∧ C ∈ ℂ ) ∧ ( A ∈ ℂ ∧ B ∈ ℂ ) )" by (rule MMI_3impb) from S11 have S12: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( ( C ∈ ℂ ∧ C ∈ ℂ ) ∧ ( A ∈ ℂ ∧ B ∈ ℂ ) )" by (rule MMI_3coml) have S13: "( C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ C ≠ 𝟬" by (rule MMI_pm3_27) have S14: "( B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ B ≠ 𝟬" by (rule MMI_pm3_27) from S13 S14 have S15: "( ( C ∈ ℂ ∧ C ≠ 𝟬 ) ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ) ⟶ ( C ≠ 𝟬 ∧ B ≠ 𝟬 )" by (rule MMI_anim12i) from S15 have S16: "( ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( C ≠ 𝟬 ∧ B ≠ 𝟬 )" by (rule MMI_ancoms) from S16 have S17: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( C ≠ 𝟬 ∧ B ≠ 𝟬 )" by (rule MMI_3adant1) from S4 S12 S17 have S18: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( ( C \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( ( C ⋅ A ) \<cdiv> ( C ⋅ B ) )" by (rule MMI_sylanc) have S19: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_divclt) from S19 have S20: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_3expb) have S21: "( A \<cdiv> B ) ∈ ℂ ⟶ ( 𝟭 ⋅ ( A \<cdiv> B ) ) = ( A \<cdiv> B )" by (rule MMI_mulid2t) from S20 S21 have S22: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ) ⟶ ( 𝟭 ⋅ ( A \<cdiv> B ) ) = ( A \<cdiv> B )" by (rule MMI_syl) from S22 have S23: "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( 𝟭 ⋅ ( A \<cdiv> B ) ) = ( A \<cdiv> B )" by (rule MMI_3adant3) from S3 S18 S23 show "( A ∈ ℂ ∧ ( B ∈ ℂ ∧ B ≠ 𝟬 ) ∧ ( C ∈ ℂ ∧ C ≠ 𝟬 ) ) ⟶ ( ( C ⋅ A ) \<cdiv> ( C ⋅ B ) ) = ( A \<cdiv> B )" by (rule MMI_3eqtr3d) qed lemma (in MMIsar0) MMI_divmul13t: shows "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) )" proof - have S1: "( A ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( A ⋅ C ) = ( C ⋅ A )" by (rule MMI_axmulcom) from S1 have S2: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( A ⋅ C ) = ( C ⋅ A )" by (rule MMI_ad2ant2r) from S2 have S3: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) ) = ( ( C ⋅ A ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_opreq1d) from S3 have S4: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) ) = ( ( C ⋅ A ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_adantr) have S5: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldivt) have S6: "( ( ( C ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) ) = ( ( C ⋅ A ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldivt) have S7: "( A ∈ ℂ ∧ B ∈ ℂ ) ⟷ ( B ∈ ℂ ∧ A ∈ ℂ )" by (rule MMI_ancom) from S7 have S8: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟷ ( ( B ∈ ℂ ∧ A ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) )" by (rule MMI_anbi1i) have S9: "( ( B ∈ ℂ ∧ A ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟷ ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( B ∈ ℂ ∧ A ∈ ℂ ) )" by (rule MMI_ancom) have S10: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( B ∈ ℂ ∧ A ∈ ℂ ) ) ⟷ ( ( C ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ∈ ℂ ∧ D ∈ ℂ ) )" by (rule MMI_an42) from S8 S9 S10 have S11: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟷ ( ( C ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ∈ ℂ ∧ D ∈ ℂ ) )" by (rule MMI_3bitr) from S6 S11 have S12: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) ) = ( ( C ⋅ A ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_sylanb) from S4 S5 S12 show "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) )" by (rule MMI_3eqtr4d) qed lemma (in MMIsar0) MMI_divmul24t: shows "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A \<cdiv> D ) ⋅ ( C \<cdiv> B ) )" proof - have S1: "( B ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( B ⋅ D ) = ( D ⋅ B )" by (rule MMI_axmulcom) from S1 have S2: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ D ) = ( D ⋅ B )" by (rule MMI_ad2ant2l) from S2 have S3: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) ) = ( ( A ⋅ C ) \<cdiv> ( D ⋅ B ) )" by (rule MMI_opreq2d) from S3 have S4: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) ) = ( ( A ⋅ C ) \<cdiv> ( D ⋅ B ) )" by (rule MMI_adantr) have S5: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldivt) have S6: "( ( ( A ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ∈ ℂ ∧ B ∈ ℂ ) ) ∧ ( D ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> D ) ⋅ ( C \<cdiv> B ) ) = ( ( A ⋅ C ) \<cdiv> ( D ⋅ B ) )" by (rule MMI_divmuldivt) have S7: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟷ ( ( A ∈ ℂ ∧ C ∈ ℂ ) ∧ ( D ∈ ℂ ∧ B ∈ ℂ ) )" by (rule MMI_an42) have S8: "( ( A ∈ ℂ ∧ C ∈ ℂ ) ∧ ( D ∈ ℂ ∧ B ∈ ℂ ) ) ⟷ ( ( A ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ∈ ℂ ∧ B ∈ ℂ ) )" by (rule MMI_an4) from S7 S8 have S9: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟷ ( ( A ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ∈ ℂ ∧ B ∈ ℂ ) )" by (rule MMI_bitr) have S10: "( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( D ≠ 𝟬 ∧ B ≠ 𝟬 )" by (rule MMI_ancom) from S6 S9 S10 have S11: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> D ) ⋅ ( C \<cdiv> B ) ) = ( ( A ⋅ C ) \<cdiv> ( D ⋅ B ) )" by (rule MMI_syl2anb) from S4 S5 S11 show "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A \<cdiv> D ) ⋅ ( C \<cdiv> B ) )" by (rule MMI_3eqtr4d) qed lemma (in MMIsar0) MMI_divadddivt: shows "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<ca> ( C \<cdiv> D ) ) = ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) )" proof - have S1: "( B ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( B ⋅ D ) ≠ 𝟬 )" by (rule MMI_muln0bt) from S1 have S2: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( B ⋅ D ) ≠ 𝟬 )" by (rule MMI_ad2ant2l) have S3: "( ( ( A ⋅ D ) ∈ ℂ ∧ ( B ⋅ C ) ∈ ℂ ∧ ( B ⋅ D ) ∈ ℂ ) ∧ ( B ⋅ D ) ≠ 𝟬 ) ⟶ ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) ) = ( ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) \<ca> ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) )" by (rule MMI_divdirt) from S3 have S4: "( ( A ⋅ D ) ∈ ℂ ∧ ( B ⋅ C ) ∈ ℂ ∧ ( B ⋅ D ) ∈ ℂ ) ⟶ ( ( B ⋅ D ) ≠ 𝟬 ⟶ ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) ) = ( ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) \<ca> ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) ) )" by (rule MMI_ex) have S5: "( A ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_axmulcl) from S5 have S6: "( A ∈ ℂ ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_adantrl) from S6 have S7: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_adantlr) have S8: "( B ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_axmulcl) from S8 have S9: "( B ∈ ℂ ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_adantrr) from S9 have S10: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_adantll) have S11: "( B ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( B ⋅ D ) ∈ ℂ" by (rule MMI_axmulcl) from S11 have S12: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ D ) ∈ ℂ" by (rule MMI_ad2ant2l) from S4 S7 S10 S12 have S13: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( B ⋅ D ) ≠ 𝟬 ⟶ ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) ) = ( ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) \<ca> ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) ) )" by (rule MMI_syl3anc) from S2 S13 have S14: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟶ ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) ) = ( ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) \<ca> ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) ) )" by (rule MMI_sylbid) from S14 have S15: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) ) = ( ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) \<ca> ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) )" by (rule MMI_imp) have S16: "( D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( D \<cdiv> D ) = 𝟭" by (rule MMI_dividt) from S16 have S17: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( D \<cdiv> D ) = 𝟭" by (rule MMI_ad2ant2l) from S17 have S18: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( D \<cdiv> D ) = 𝟭" by (rule MMI_adantll) from S18 have S19: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> D ) ) = ( ( A \<cdiv> B ) ⋅ 𝟭 )" by (rule MMI_opreq2d) have S20: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( D ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldivt) have S21: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ D ∈ ℂ" by (rule MMI_pm3_27) from S21 have S22: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ D ∈ ℂ" . from S21 S22 have S23: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( D ∈ ℂ ∧ D ∈ ℂ )" by (rule MMI_jca) from S20 S23 have S24: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_sylanl2) have S25: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_divclt) from S25 have S26: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_3expa) have S27: "( A \<cdiv> B ) ∈ ℂ ⟶ ( ( A \<cdiv> B ) ⋅ 𝟭 ) = ( A \<cdiv> B )" by (rule MMI_ax1id) from S26 S27 have S28: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( ( A \<cdiv> B ) ⋅ 𝟭 ) = ( A \<cdiv> B )" by (rule MMI_syl) from S28 have S29: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ 𝟭 ) = ( A \<cdiv> B )" by (rule MMI_ad2ant2r) from S19 S24 S29 have S30: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) = ( A \<cdiv> B )" by (rule MMI_3eqtr3d) have S31: "( B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( B \<cdiv> B ) = 𝟭" by (rule MMI_dividt) from S31 have S32: "( B ∈ ℂ ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B \<cdiv> B ) = 𝟭" by (rule MMI_adantrr) from S32 have S33: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B \<cdiv> B ) = 𝟭" by (rule MMI_adantll) from S33 have S34: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B \<cdiv> B ) = 𝟭" by (rule MMI_adantlr) from S34 have S35: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( B \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( 𝟭 ⋅ ( C \<cdiv> D ) )" by (rule MMI_opreq1d) have S36: "( ( ( B ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( B \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldivt) have S37: "( A ∈ ℂ ∧ B ∈ ℂ ) ⟶ B ∈ ℂ" by (rule MMI_pm3_27) from S37 have S38: "( A ∈ ℂ ∧ B ∈ ℂ ) ⟶ B ∈ ℂ" . from S37 S38 have S39: "( A ∈ ℂ ∧ B ∈ ℂ ) ⟶ ( B ∈ ℂ ∧ B ∈ ℂ )" by (rule MMI_jca) from S36 S39 have S40: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( B \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_sylanl1) have S41: "( C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_divclt) from S41 have S42: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_3expa) have S43: "( C \<cdiv> D ) ∈ ℂ ⟶ ( 𝟭 ⋅ ( C \<cdiv> D ) ) = ( C \<cdiv> D )" by (rule MMI_mulid2t) from S42 S43 have S44: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( 𝟭 ⋅ ( C \<cdiv> D ) ) = ( C \<cdiv> D )" by (rule MMI_syl) from S44 have S45: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( 𝟭 ⋅ ( C \<cdiv> D ) ) = ( C \<cdiv> D )" by (rule MMI_ad2ant2l) from S35 S40 S45 have S46: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) = ( C \<cdiv> D )" by (rule MMI_3eqtr3d) from S30 S46 have S47: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( ( A ⋅ D ) \<cdiv> ( B ⋅ D ) ) \<ca> ( ( B ⋅ C ) \<cdiv> ( B ⋅ D ) ) ) = ( ( A \<cdiv> B ) \<ca> ( C \<cdiv> D ) )" by (rule MMI_opreq12d) from S15 S47 show "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<ca> ( C \<cdiv> D ) ) = ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_eqtr2d) qed lemma (in MMIsar0) MMI_divdivdivt: shows "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" proof - have S1: "( ( D \<cdiv> C ) ∈ ℂ ∧ ( A \<cdiv> B ) ∈ ℂ ) ⟶ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> C ) )" by (rule MMI_axmulcom) have S2: "( D ∈ ℂ ∧ C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ ( D \<cdiv> C ) ∈ ℂ" by (rule MMI_divclt) from S2 have S3: "( C ∈ ℂ ∧ D ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ ( D \<cdiv> C ) ∈ ℂ" by (rule MMI_3com12) from S3 have S4: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ C ≠ 𝟬 ) ⟶ ( D \<cdiv> C ) ∈ ℂ" by (rule MMI_3expa) from S4 have S5: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( D \<cdiv> C ) ∈ ℂ" by (rule MMI_adantrr) from S5 have S6: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( D \<cdiv> C ) ∈ ℂ" by (rule MMI_ad2ant2l) have S7: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_divclt) from S7 have S8: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_3expa) from S8 have S9: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( A \<cdiv> B ) ∈ ℂ" by (rule MMI_ad2ant2r) from S1 S6 S9 have S10: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> C ) )" by (rule MMI_sylanc) have S11: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( D ∈ ℂ ∧ C ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> C ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_divmuldivt) have S12: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( D ∈ ℂ ∧ C ∈ ℂ )" by (rule MMI_pm3_22) from S12 have S13: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( D ∈ ℂ ∧ C ∈ ℂ ) )" by (rule MMI_anim2i) have S14: "( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟶ C ≠ 𝟬" by (rule MMI_pm3_26) from S14 have S15: "( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B ≠ 𝟬 ∧ C ≠ 𝟬 )" by (rule MMI_anim2i) from S11 S13 S15 have S16: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( D \<cdiv> C ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_syl2an) from S10 S16 have S17: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_eqtrd) from S17 have S18: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( C \<cdiv> D ) ⋅ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) ) = ( ( C \<cdiv> D ) ⋅ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) )" by (rule MMI_opreq2d) from S12 have S19: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( D ∈ ℂ ∧ C ∈ ℂ )" . from S19 have S20: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( D ∈ ℂ ∧ C ∈ ℂ ) )" by (rule MMI_ancli) have S21: "( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟶ ( D ≠ 𝟬 ∧ C ≠ 𝟬 )" by (rule MMI_pm3_22) from S21 have S22: "( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( D ≠ 𝟬 ∧ C ≠ 𝟬 )" by (rule MMI_adantl) from S20 S22 have S23: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( D ∈ ℂ ∧ C ∈ ℂ ) ) ∧ ( D ≠ 𝟬 ∧ C ≠ 𝟬 ) )" by (rule MMI_anim12i) from S23 have S24: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( D ∈ ℂ ∧ C ∈ ℂ ) ) ∧ ( D ≠ 𝟬 ∧ C ≠ 𝟬 ) )" by (rule MMI_adantll) have S25: "( ( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( D ∈ ℂ ∧ C ∈ ℂ ) ) ∧ ( D ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( C \<cdiv> D ) ⋅ ( D \<cdiv> C ) ) = ( ( C ⋅ D ) \<cdiv> ( D ⋅ C ) )" by (rule MMI_divmuldivt) from S24 S25 have S26: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( C \<cdiv> D ) ⋅ ( D \<cdiv> C ) ) = ( ( C ⋅ D ) \<cdiv> ( D ⋅ C ) )" by (rule MMI_syl) have S27: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( C ⋅ D ) = ( D ⋅ C )" by (rule MMI_axmulcom) from S27 have S28: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( C ⋅ D ) = ( D ⋅ C )" by (rule MMI_ad2antlr) from S28 have S29: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( C ⋅ D ) \<cdiv> ( D ⋅ C ) ) = ( ( D ⋅ C ) \<cdiv> ( D ⋅ C ) )" by (rule MMI_opreq1d) have S30: "( ( D ⋅ C ) ∈ ℂ ∧ ( D ⋅ C ) ≠ 𝟬 ) ⟶ ( ( D ⋅ C ) \<cdiv> ( D ⋅ C ) ) = 𝟭" by (rule MMI_dividt) have S31: "( D ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( D ⋅ C ) ∈ ℂ" by (rule MMI_axmulcl) from S31 have S32: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( D ⋅ C ) ∈ ℂ" by (rule MMI_ancoms) from S32 have S33: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( D ⋅ C ) ∈ ℂ" by (rule MMI_ad2antlr) have S34: "( D ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( ( D ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟷ ( D ⋅ C ) ≠ 𝟬 )" by (rule MMI_muln0bt) have S35: "( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( D ≠ 𝟬 ∧ C ≠ 𝟬 )" by (rule MMI_ancom) from S34 S35 have S36: "( D ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( D ⋅ C ) ≠ 𝟬 )" by (rule MMI_syl5bb) from S36 have S37: "( C ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( D ⋅ C ) ≠ 𝟬 )" by (rule MMI_ancoms) from S37 have S38: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( D ⋅ C ) ≠ 𝟬" by (rule MMI_biimpa) from S38 have S39: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( D ⋅ C ) ≠ 𝟬" by (rule MMI_ad2ant2l) from S30 S33 S39 have S40: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( D ⋅ C ) \<cdiv> ( D ⋅ C ) ) = 𝟭" by (rule MMI_sylanc) from S26 S29 S40 have S41: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( C \<cdiv> D ) ⋅ ( D \<cdiv> C ) ) = 𝟭" by (rule MMI_3eqtrd) from S41 have S42: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( ( C \<cdiv> D ) ⋅ ( D \<cdiv> C ) ) ⋅ ( A \<cdiv> B ) ) = ( 𝟭 ⋅ ( A \<cdiv> B ) )" by (rule MMI_opreq1d) have S43: "( ( C \<cdiv> D ) ∈ ℂ ∧ ( D \<cdiv> C ) ∈ ℂ ∧ ( A \<cdiv> B ) ∈ ℂ ) ⟶ ( ( ( C \<cdiv> D ) ⋅ ( D \<cdiv> C ) ) ⋅ ( A \<cdiv> B ) ) = ( ( C \<cdiv> D ) ⋅ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) )" by (rule MMI_axmulass) have S44: "( C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_divclt) from S44 have S45: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ D ≠ 𝟬 ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_3expa) from S45 have S46: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_adantrl) from S46 have S47: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( C \<cdiv> D ) ∈ ℂ" by (rule MMI_ad2ant2l) from S6 have S48: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( D \<cdiv> C ) ∈ ℂ" . from S9 have S49: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( A \<cdiv> B ) ∈ ℂ" . from S43 S47 S48 S49 have S50: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( ( C \<cdiv> D ) ⋅ ( D \<cdiv> C ) ) ⋅ ( A \<cdiv> B ) ) = ( ( C \<cdiv> D ) ⋅ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) )" by (rule MMI_syl3anc) from S9 have S51: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( A \<cdiv> B ) ∈ ℂ" . have S52: "( A \<cdiv> B ) ∈ ℂ ⟶ ( 𝟭 ⋅ ( A \<cdiv> B ) ) = ( A \<cdiv> B )" by (rule MMI_mulid2t) from S51 S52 have S53: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( 𝟭 ⋅ ( A \<cdiv> B ) ) = ( A \<cdiv> B )" by (rule MMI_syl) from S42 S50 S53 have S54: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( C \<cdiv> D ) ⋅ ( ( D \<cdiv> C ) ⋅ ( A \<cdiv> B ) ) ) = ( A \<cdiv> B )" by (rule MMI_3eqtr3d) from S18 S54 have S55: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( C \<cdiv> D ) ⋅ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ) = ( A \<cdiv> B )" by (rule MMI_eqtr3d) have S56: "( ( ( A \<cdiv> B ) ∈ ℂ ∧ ( C \<cdiv> D ) ∈ ℂ ∧ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ∈ ℂ ) ∧ ( C \<cdiv> D ) ≠ 𝟬 ) ⟶ ( ( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ⟷ ( ( C \<cdiv> D ) ⋅ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ) = ( A \<cdiv> B ) )" by (rule MMI_divmult) from S9 have S57: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( A \<cdiv> B ) ∈ ℂ" . from S47 have S58: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( C \<cdiv> D ) ∈ ℂ" . have S59: "( ( A ⋅ D ) ∈ ℂ ∧ ( B ⋅ C ) ∈ ℂ ∧ ( B ⋅ C ) ≠ 𝟬 ) ⟶ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ∈ ℂ" by (rule MMI_divclt) have S60: "( A ∈ ℂ ∧ D ∈ ℂ ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_axmulcl) from S60 have S61: "( A ∈ ℂ ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_adantrl) from S61 have S62: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_adantlr) from S62 have S63: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( A ⋅ D ) ∈ ℂ" by (rule MMI_adantr) have S64: "( B ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_axmulcl) from S64 have S65: "( B ∈ ℂ ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_adantrr) from S65 have S66: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_adantll) from S66 have S67: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( B ⋅ C ) ∈ ℂ" by (rule MMI_adantr) have S68: "( B ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟷ ( B ⋅ C ) ≠ 𝟬 )" by (rule MMI_muln0bt) from S68 have S69: "( B ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟶ ( B ⋅ C ) ≠ 𝟬 )" by (rule MMI_biimpd) from S14 have S70: "( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟶ C ≠ 𝟬" . from S69 S70 have S71: "( B ∈ ℂ ∧ C ∈ ℂ ) ⟶ ( ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B ⋅ C ) ≠ 𝟬 )" by (rule MMI_sylan2i) from S71 have S72: "( B ∈ ℂ ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B ⋅ C ) ≠ 𝟬 )" by (rule MMI_adantrr) from S72 have S73: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ⟶ ( ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( B ⋅ C ) ≠ 𝟬 )" by (rule MMI_adantll) from S73 have S74: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( B ⋅ C ) ≠ 𝟬" by (rule MMI_imp) from S59 S63 S67 S74 have S75: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ∈ ℂ" by (rule MMI_syl3anc) from S57 S58 S75 have S76: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( A \<cdiv> B ) ∈ ℂ ∧ ( C \<cdiv> D ) ∈ ℂ ∧ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ∈ ℂ )" by (rule MMI_3jca) have S77: "( C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( C ≠ 𝟬 ⟷ ( C \<cdiv> D ) ≠ 𝟬 )" by (rule MMI_divne0bt) from S77 have S78: "( C ∈ ℂ ∧ D ∈ ℂ ∧ D ≠ 𝟬 ) ⟶ ( C ≠ 𝟬 ⟶ ( C \<cdiv> D ) ≠ 𝟬 )" by (rule MMI_biimpd) from S78 have S79: "C ∈ ℂ ⟶ ( D ∈ ℂ ⟶ ( D ≠ 𝟬 ⟶ ( C ≠ 𝟬 ⟶ ( C \<cdiv> D ) ≠ 𝟬 ) ) )" by (rule MMI_3exp) from S79 have S80: "C ∈ ℂ ⟶ ( D ∈ ℂ ⟶ ( C ≠ 𝟬 ⟶ ( D ≠ 𝟬 ⟶ ( C \<cdiv> D ) ≠ 𝟬 ) ) )" by (rule MMI_com34) from S80 have S81: "( ( C ∈ ℂ ∧ D ∈ ℂ ) ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( C \<cdiv> D ) ≠ 𝟬" by (rule MMI_imp43) from S81 have S82: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( C \<cdiv> D ) ≠ 𝟬" by (rule MMI_ad2ant2l) from S56 S76 S82 have S83: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ⟷ ( ( C \<cdiv> D ) ⋅ ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) ) ) = ( A \<cdiv> B ) )" by (rule MMI_sylanc) from S55 S83 have S84: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_mpbird) have S85: "( B ≠ 𝟬 ∧ C ≠ 𝟬 ∧ D ≠ 𝟬 ) ⟷ ( B ≠ 𝟬 ∧ ( C ≠ 𝟬 ∧ D ≠ 𝟬 ) )" by (rule MMI_3anass) from S84 S85 show "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_sylan2b) qed lemma (in MMIsar0) MMI_divmuldiv: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "C ∈ ℂ" and A4: "D ∈ ℂ" and A5: "B ≠ 𝟬" and A6: "D ≠ 𝟬" shows "( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" proof - from A1 have S1: "A ∈ ℂ". from A2 have S2: "B ∈ ℂ". from S1 S2 have S3: "A ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_pm3_2i) from A3 have S4: "C ∈ ℂ". from A4 have S5: "D ∈ ℂ". from S4 S5 have S6: "C ∈ ℂ ∧ D ∈ ℂ" by (rule MMI_pm3_2i) from S3 S6 have S7: "( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ )" by (rule MMI_pm3_2i) from A5 have S8: "B ≠ 𝟬". from A6 have S9: "D ≠ 𝟬". from S8 S9 have S10: "B ≠ 𝟬 ∧ D ≠ 𝟬" by (rule MMI_pm3_2i) have S11: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldivt) from S7 S10 S11 show "( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_mp2an) qed (************221-230********************) lemma (in MMIsar0) MMI_divmul13: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "C ∈ ℂ" and A4: "D ∈ ℂ" and A5: "B ≠ 𝟬" and A6: "D ≠ 𝟬" shows "( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) )" proof - from A3 have S1: "C ∈ ℂ". from A1 have S2: "A ∈ ℂ". from S1 S2 have S3: "( C ⋅ A ) = ( A ⋅ C )" by (rule MMI_mulcom) from S3 have S4: "( ( C ⋅ A ) \<cdiv> ( B ⋅ D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_opreq1i) from A3 have S5: "C ∈ ℂ". from A2 have S6: "B ∈ ℂ". from A1 have S7: "A ∈ ℂ". from A4 have S8: "D ∈ ℂ". from A5 have S9: "B ≠ 𝟬". from A6 have S10: "D ≠ 𝟬". from S5 S6 S7 S8 S9 S10 have S11: "( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) ) = ( ( C ⋅ A ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldiv) from A1 have S12: "A ∈ ℂ". from A2 have S13: "B ∈ ℂ". from A3 have S14: "C ∈ ℂ". from A4 have S15: "D ∈ ℂ". from A5 have S16: "B ≠ 𝟬". from A6 have S17: "D ≠ 𝟬". from S12 S13 S14 S15 S16 S17 have S18: "( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( A ⋅ C ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divmuldiv) from S4 S11 S18 show "( ( A \<cdiv> B ) ⋅ ( C \<cdiv> D ) ) = ( ( C \<cdiv> B ) ⋅ ( A \<cdiv> D ) )" by (rule MMI_3eqtr4r) qed lemma (in MMIsar0) MMI_divadddiv: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "C ∈ ℂ" and A4: "D ∈ ℂ" and A5: "B ≠ 𝟬" and A6: "D ≠ 𝟬" shows "( ( A \<cdiv> B ) \<ca> ( C \<cdiv> D ) ) = ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) )" proof - from A1 have S1: "A ∈ ℂ". from A2 have S2: "B ∈ ℂ". from S1 S2 have S3: "A ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_pm3_2i) from A3 have S4: "C ∈ ℂ". from A4 have S5: "D ∈ ℂ". from S4 S5 have S6: "C ∈ ℂ ∧ D ∈ ℂ" by (rule MMI_pm3_2i) from S3 S6 have S7: "( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ )" by (rule MMI_pm3_2i) from A5 have S8: "B ≠ 𝟬". from A6 have S9: "D ≠ 𝟬". from S8 S9 have S10: "B ≠ 𝟬 ∧ D ≠ 𝟬" by (rule MMI_pm3_2i) have S11: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<ca> ( C \<cdiv> D ) ) = ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_divadddivt) from S7 S10 S11 show "( ( A \<cdiv> B ) \<ca> ( C \<cdiv> D ) ) = ( ( ( A ⋅ D ) \<ca> ( B ⋅ C ) ) \<cdiv> ( B ⋅ D ) )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_divdivdiv: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "C ∈ ℂ" and A4: "D ∈ ℂ" and A5: "B ≠ 𝟬" and A6: "D ≠ 𝟬" and A7: "C ≠ 𝟬" shows "( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" proof - from A1 have S1: "A ∈ ℂ". from A2 have S2: "B ∈ ℂ". from S1 S2 have S3: "A ∈ ℂ ∧ B ∈ ℂ" by (rule MMI_pm3_2i) from A3 have S4: "C ∈ ℂ". from A4 have S5: "D ∈ ℂ". from S4 S5 have S6: "C ∈ ℂ ∧ D ∈ ℂ" by (rule MMI_pm3_2i) from S3 S6 have S7: "( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ )" by (rule MMI_pm3_2i) from A5 have S8: "B ≠ 𝟬". from A7 have S9: "C ≠ 𝟬". from A6 have S10: "D ≠ 𝟬". from S8 S9 S10 have S11: "B ≠ 𝟬 ∧ C ≠ 𝟬 ∧ D ≠ 𝟬" by (rule MMI_3pm3_2i) have S12: "( ( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( C ∈ ℂ ∧ D ∈ ℂ ) ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ∧ D ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_divdivdivt) from S7 S11 S12 show "( ( A \<cdiv> B ) \<cdiv> ( C \<cdiv> D ) ) = ( ( A ⋅ D ) \<cdiv> ( B ⋅ C ) )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_recdivt: shows "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( 𝟭 \<cdiv> ( A \<cdiv> B ) ) = ( B \<cdiv> A )" proof - have S1: "𝟭 ∈ ℂ" by (rule MMI_1cn) have S2: "𝟭 ∈ ℂ" by (rule MMI_1cn) from S1 S2 have S3: "𝟭 ∈ ℂ ∧ 𝟭 ∈ ℂ" by (rule MMI_pm3_2i) have S4: "( ( ( 𝟭 ∈ ℂ ∧ 𝟭 ∈ ℂ ) ∧ ( A ∈ ℂ ∧ B ∈ ℂ ) ) ∧ ( 𝟭 ≠ 𝟬 ∧ A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( 𝟭 \<cdiv> 𝟭 ) \<cdiv> ( A \<cdiv> B ) ) = ( ( 𝟭 ⋅ B ) \<cdiv> ( 𝟭 ⋅ A ) )" by (rule MMI_divdivdivt) have S5: "𝟭 ≠ 𝟬" by (rule MMI_ax1ne0) from S5 have S6: "( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ⟶ ( 𝟭 ≠ 𝟬 ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) )" by (rule MMI_jctl) have S7: "( 𝟭 ≠ 𝟬 ∧ A ≠ 𝟬 ∧ B ≠ 𝟬 ) ⟷ ( 𝟭 ≠ 𝟬 ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) )" by (rule MMI_3anass) from S6 S7 have S8: "( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ⟶ ( 𝟭 ≠ 𝟬 ∧ A ≠ 𝟬 ∧ B ≠ 𝟬 )" by (rule MMI_sylibr) from S4 S8 have S9: "( ( ( 𝟭 ∈ ℂ ∧ 𝟭 ∈ ℂ ) ∧ ( A ∈ ℂ ∧ B ∈ ℂ ) ) ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( 𝟭 \<cdiv> 𝟭 ) \<cdiv> ( A \<cdiv> B ) ) = ( ( 𝟭 ⋅ B ) \<cdiv> ( 𝟭 ⋅ A ) )" by (rule MMI_sylan2) from S3 S9 have S10: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( 𝟭 \<cdiv> 𝟭 ) \<cdiv> ( A \<cdiv> B ) ) = ( ( 𝟭 ⋅ B ) \<cdiv> ( 𝟭 ⋅ A ) )" by (rule MMI_mpanl1) have S11: "𝟭 ∈ ℂ" by (rule MMI_1cn) from S11 have S12: "( 𝟭 \<cdiv> 𝟭 ) = 𝟭" by (rule MMI_div1) from S12 have S13: "( ( 𝟭 \<cdiv> 𝟭 ) \<cdiv> ( A \<cdiv> B ) ) = ( 𝟭 \<cdiv> ( A \<cdiv> B ) )" by (rule MMI_opreq1i) from S13 have S14: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( 𝟭 \<cdiv> 𝟭 ) \<cdiv> ( A \<cdiv> B ) ) = ( 𝟭 \<cdiv> ( A \<cdiv> B ) )" by (rule MMI_a1i) have S15: "B ∈ ℂ ⟶ ( 𝟭 ⋅ B ) = B" by (rule MMI_mulid2t) have S16: "A ∈ ℂ ⟶ ( 𝟭 ⋅ A ) = A" by (rule MMI_mulid2t) from S15 S16 have S17: "( A ∈ ℂ ∧ B ∈ ℂ ) ⟶ ( ( 𝟭 ⋅ B ) \<cdiv> ( 𝟭 ⋅ A ) ) = ( B \<cdiv> A )" by (rule MMI_opreqan12rd) from S17 have S18: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( ( 𝟭 ⋅ B ) \<cdiv> ( 𝟭 ⋅ A ) ) = ( B \<cdiv> A )" by (rule MMI_adantr) from S10 S14 S18 show "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ ( A ≠ 𝟬 ∧ B ≠ 𝟬 ) ) ⟶ ( 𝟭 \<cdiv> ( A \<cdiv> B ) ) = ( B \<cdiv> A )" by (rule MMI_3eqtr3d) qed lemma (in MMIsar0) MMI_divdiv23t: shows "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" proof - have S1: "( ( A ∈ ℂ ∧ ( 𝟭 \<cdiv> B ) ∈ ℂ ∧ C ∈ ℂ ) ∧ C ≠ 𝟬 ) ⟶ ( ( A ⋅ ( 𝟭 \<cdiv> B ) ) \<cdiv> C ) = ( ( A \<cdiv> C ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_div23t) have S2: "( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ⟶ A ∈ ℂ" by (rule MMI_3simp1) from S2 have S3: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ A ∈ ℂ" by (rule MMI_adantr) have S4: "( B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℂ" by (rule MMI_recclt) have S5: "( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ⟶ B ∈ ℂ" by (rule MMI_3simp2) from S4 S5 have S6: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℂ" by (rule MMI_sylan) from S6 have S7: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℂ" by (rule MMI_adantrr) have S8: "( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ⟶ C ∈ ℂ" by (rule MMI_3simp3) from S8 have S9: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ C ∈ ℂ" by (rule MMI_adantr) from S3 S7 S9 have S10: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( A ∈ ℂ ∧ ( 𝟭 \<cdiv> B ) ∈ ℂ ∧ C ∈ ℂ )" by (rule MMI_3jca) have S11: "( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟶ C ≠ 𝟬" by (rule MMI_pm3_27) from S11 have S12: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ C ≠ 𝟬" by (rule MMI_adantl) from S1 S10 S12 have S13: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A ⋅ ( 𝟭 \<cdiv> B ) ) \<cdiv> C ) = ( ( A \<cdiv> C ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_sylanc) have S14: "( A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) = ( A ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_divrect) from S14 have S15: "( ( A ∈ ℂ ∧ B ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) = ( A ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_3expa) from S15 have S16: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) = ( A ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_3adantl3) from S16 have S17: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( A \<cdiv> B ) = ( A ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_adantrr) from S17 have S18: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A ⋅ ( 𝟭 \<cdiv> B ) ) \<cdiv> C )" by (rule MMI_opreq1d) have S19: "( ( A \<cdiv> C ) ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 𝟬 ) ⟶ ( ( A \<cdiv> C ) \<cdiv> B ) = ( ( A \<cdiv> C ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_divrect) have S20: "( A ∈ ℂ ∧ C ∈ ℂ ∧ C ≠ 𝟬 ) ⟶ ( A \<cdiv> C ) ∈ ℂ" by (rule MMI_divclt) from S20 have S21: "( ( A ∈ ℂ ∧ C ∈ ℂ ) ∧ C ≠ 𝟬 ) ⟶ ( A \<cdiv> C ) ∈ ℂ" by (rule MMI_3expa) from S21 have S22: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ C ≠ 𝟬 ) ⟶ ( A \<cdiv> C ) ∈ ℂ" by (rule MMI_3adantl2) from S22 have S23: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( A \<cdiv> C ) ∈ ℂ" by (rule MMI_adantrl) from S5 have S24: "( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ⟶ B ∈ ℂ" . from S24 have S25: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ B ∈ ℂ" by (rule MMI_adantr) have S26: "( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟶ B ≠ 𝟬" by (rule MMI_pm3_26) from S26 have S27: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ B ≠ 𝟬" by (rule MMI_adantl) from S19 S23 S25 S27 have S28: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> C ) \<cdiv> B ) = ( ( A \<cdiv> C ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_syl3anc) from S13 S18 S28 show "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" by (rule MMI_3eqtr4d) qed lemma (in MMIsar0) MMI_divdiv23: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "C ∈ ℂ" and A4: "B ≠ 𝟬" and A5: "C ≠ 𝟬" shows "( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" proof - from A1 have S1: "A ∈ ℂ". from A2 have S2: "B ∈ ℂ". from A4 have S3: "B ≠ 𝟬". from S2 S3 have S4: "( 𝟭 \<cdiv> B ) ∈ ℂ" by (rule MMI_reccl) from A3 have S5: "C ∈ ℂ". from A5 have S6: "C ≠ 𝟬". from S1 S4 S5 S6 have S7: "( ( A ⋅ ( 𝟭 \<cdiv> B ) ) \<cdiv> C ) = ( ( A \<cdiv> C ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_div23) from A1 have S8: "A ∈ ℂ". from A2 have S9: "B ∈ ℂ". from A4 have S10: "B ≠ 𝟬". from S8 S9 S10 have S11: "( A \<cdiv> B ) = ( A ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_divrec) from S11 have S12: "( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A ⋅ ( 𝟭 \<cdiv> B ) ) \<cdiv> C )" by (rule MMI_opreq1i) from A1 have S13: "A ∈ ℂ". from A3 have S14: "C ∈ ℂ". from A5 have S15: "C ≠ 𝟬". from S13 S14 S15 have S16: "( A \<cdiv> C ) ∈ ℂ" by (rule MMI_divcl) from A2 have S17: "B ∈ ℂ". from A4 have S18: "B ≠ 𝟬". from S16 S17 S18 have S19: "( ( A \<cdiv> C ) \<cdiv> B ) = ( ( A \<cdiv> C ) ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_divrec) from S7 S12 S19 show "( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" by (rule MMI_3eqtr4) qed lemma (in MMIsar0) MMI_divdiv23z: assumes A1: "A ∈ ℂ" and A2: "B ∈ ℂ" and A3: "C ∈ ℂ" shows "( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟶ ( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" proof - from A1 have S1: "A ∈ ℂ". from A2 have S2: "B ∈ ℂ". from A3 have S3: "C ∈ ℂ". from S1 S2 S3 have S4: "A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ" by (rule MMI_3pm3_2i) have S5: "( ( A ∈ ℂ ∧ B ∈ ℂ ∧ C ∈ ℂ ) ∧ ( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ) ⟶ ( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" by (rule MMI_divdiv23t) from S4 S5 show "( B ≠ 𝟬 ∧ C ≠ 𝟬 ) ⟶ ( ( A \<cdiv> B ) \<cdiv> C ) = ( ( A \<cdiv> C ) \<cdiv> B )" by (rule MMI_mpan) qed lemma (in MMIsar0) MMI_redivcl: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" and A3: "B ≠ 𝟬" shows "( A \<cdiv> B ) ∈ ℝ" proof - from A1 have S1: "A ∈ ℝ". from S1 have S2: "A ∈ ℂ" by (rule MMI_recn) from A2 have S3: "B ∈ ℝ". from S3 have S4: "B ∈ ℂ" by (rule MMI_recn) from A3 have S5: "B ≠ 𝟬". from S2 S4 S5 have S6: "( A \<cdiv> B ) = ( A ⋅ ( 𝟭 \<cdiv> B ) )" by (rule MMI_divrec) from A1 have S7: "A ∈ ℝ". from A2 have S8: "B ∈ ℝ". from A3 have S9: "B ≠ 𝟬". have S10: "( B ∈ ℝ ∧ B ≠ 𝟬 ) ⟶ ( ∃ x ∈ ℝ . ( B ⋅ x ) = 𝟭 )" by (rule MMI_axrrecex) from S8 S9 S10 have S11: "∃ x ∈ ℝ . ( B ⋅ x ) = 𝟭" by (rule MMI_mp2an) have S12: "( ∃ x ∈ ℝ . ( B ⋅ x ) = 𝟭 ) ⟷ ( ∃ x . ( x ∈ ℝ ∧ ( B ⋅ x ) = 𝟭 ) )" by (rule MMI_df_rex) { fix x have S13: "x ∈ ℝ ⟶ x ∈ ℂ" by (rule MMI_recnt) have S14: "x = if ( x ∈ ℂ , x , 𝟭 ) ⟶ ( ( 𝟭 \<cdiv> B ) = x ⟷ ( 𝟭 \<cdiv> B ) = if ( x ∈ ℂ , x , 𝟭 ) )" by (rule MMI_eqeq2) have S15: "x = if ( x ∈ ℂ , x , 𝟭 ) ⟶ ( B ⋅ x ) = ( B ⋅ if ( x ∈ ℂ , x , 𝟭 ) )" by (rule MMI_opreq2) from S15 have S16: "x = if ( x ∈ ℂ , x , 𝟭 ) ⟶ ( ( B ⋅ x ) = 𝟭 ⟷ ( B ⋅ if ( x ∈ ℂ , x , 𝟭 ) ) = 𝟭 )" by (rule MMI_eqeq1d) from S14 S16 have S17: "x = if ( x ∈ ℂ , x , 𝟭 ) ⟶ ( ( ( 𝟭 \<cdiv> B ) = x ⟷ ( B ⋅ x ) = 𝟭 ) ⟷ ( ( 𝟭 \<cdiv> B ) = if ( x ∈ ℂ , x , 𝟭 ) ⟷ ( B ⋅ if ( x ∈ ℂ , x , 𝟭 ) ) = 𝟭 ) )" by (rule MMI_bibi12d) have S18: "𝟭 ∈ ℂ" by (rule MMI_1cn) from S4 have S19: "B ∈ ℂ" . have S20: "𝟭 ∈ ℂ" by (rule MMI_1cn) from S20 have S21: "if ( x ∈ ℂ , x , 𝟭 ) ∈ ℂ" by (rule MMI_elimel) from A3 have S22: "B ≠ 𝟬". from S18 S19 S21 S22 have S23: "( 𝟭 \<cdiv> B ) = if ( x ∈ ℂ , x , 𝟭 ) ⟷ ( B ⋅ if ( x ∈ ℂ , x , 𝟭 ) ) = 𝟭" by (rule MMI_divmul) from S17 S23 have S24: "x ∈ ℂ ⟶ ( ( 𝟭 \<cdiv> B ) = x ⟷ ( B ⋅ x ) = 𝟭 )" by (rule MMI_dedth) from S13 S24 have S25: "x ∈ ℝ ⟶ ( ( 𝟭 \<cdiv> B ) = x ⟷ ( B ⋅ x ) = 𝟭 )" by (rule MMI_syl) have S26: "x ∈ ℝ ⟶ ( ( 𝟭 \<cdiv> B ) = x ⟶ ( 𝟭 \<cdiv> B ) ∈ ℝ )" by (rule MMI_eleq1a) from S25 S26 have S27: "x ∈ ℝ ⟶ ( ( B ⋅ x ) = 𝟭 ⟶ ( 𝟭 \<cdiv> B ) ∈ ℝ )" by (rule MMI_sylbird) from S27 have "( x ∈ ℝ ∧ ( B ⋅ x ) = 𝟭 ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℝ" by (rule MMI_imp) } then have S28: "∀x. ( x ∈ ℝ ∧ ( B ⋅ x ) = 𝟭 ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℝ" by auto from S28 have S29: "( ∃ x . ( x ∈ ℝ ∧ ( B ⋅ x ) = 𝟭 ) ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℝ" by (rule MMI_19_23aiv) from S12 S29 have S30: "( ∃ x ∈ ℝ . ( B ⋅ x ) = 𝟭 ) ⟶ ( 𝟭 \<cdiv> B ) ∈ ℝ" by (rule MMI_sylbi) from S11 S30 have S31: "( 𝟭 \<cdiv> B ) ∈ ℝ" by (rule MMI_ax_mp) from S7 S31 have S32: "( A ⋅ ( 𝟭 \<cdiv> B ) ) ∈ ℝ" by (rule MMI_remulcl) from S6 S32 show "( A \<cdiv> B ) ∈ ℝ" by (rule MMI_eqeltr) qed lemma (in MMIsar0) MMI_redivclz: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "B ≠ 𝟬 ⟶ ( A \<cdiv> B ) ∈ ℝ" proof - have S1: "B = if ( B ≠ 𝟬 , B , 𝟭 ) ⟶ ( A \<cdiv> B ) = ( A \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) )" by (rule MMI_opreq2) from S1 have S2: "B = if ( B ≠ 𝟬 , B , 𝟭 ) ⟶ ( ( A \<cdiv> B ) ∈ ℝ ⟷ ( A \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) ) ∈ ℝ )" by (rule MMI_eleq1d) from A1 have S3: "A ∈ ℝ". from A2 have S4: "B ∈ ℝ". have S5: "𝟭 ∈ ℝ" by (rule MMI_ax1re) from S4 S5 have S6: "if ( B ≠ 𝟬 , B , 𝟭 ) ∈ ℝ" by (rule MMI_keepel) have S7: "if ( B ≠ 𝟬 , B , 𝟭 ) ≠ 𝟬" by (rule MMI_elimne0) from S3 S6 S7 have S8: "( A \<cdiv> if ( B ≠ 𝟬 , B , 𝟭 ) ) ∈ ℝ" by (rule MMI_redivcl) from S2 S8 show "B ≠ 𝟬 ⟶ ( A \<cdiv> B ) ∈ ℝ" by (rule MMI_dedth) qed lemma (in MMIsar0) MMI_redivclt: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℝ" proof - have S1: "A = if ( A ∈ ℝ , A , 𝟬 ) ⟶ ( A \<cdiv> B ) = ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> B )" by (rule MMI_opreq1) from S1 have S2: "A = if ( A ∈ ℝ , A , 𝟬 ) ⟶ ( ( A \<cdiv> B ) ∈ ℝ ⟷ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> B ) ∈ ℝ )" by (rule MMI_eleq1d) from S2 have S3: "A = if ( A ∈ ℝ , A , 𝟬 ) ⟶ ( ( B ≠ 𝟬 ⟶ ( A \<cdiv> B ) ∈ ℝ ) ⟷ ( B ≠ 𝟬 ⟶ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> B ) ∈ ℝ ) )" by (rule MMI_imbi2d) have S4: "B = if ( B ∈ ℝ , B , 𝟬 ) ⟶ ( B ≠ 𝟬 ⟷ if ( B ∈ ℝ , B , 𝟬 ) ≠ 𝟬 )" by (rule MMI_neeq1) have S5: "B = if ( B ∈ ℝ , B , 𝟬 ) ⟶ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> B ) = ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> if ( B ∈ ℝ , B , 𝟬 ) )" by (rule MMI_opreq2) from S5 have S6: "B = if ( B ∈ ℝ , B , 𝟬 ) ⟶ ( ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> B ) ∈ ℝ ⟷ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> if ( B ∈ ℝ , B , 𝟬 ) ) ∈ ℝ )" by (rule MMI_eleq1d) from S4 S6 have S7: "B = if ( B ∈ ℝ , B , 𝟬 ) ⟶ ( ( B ≠ 𝟬 ⟶ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> B ) ∈ ℝ ) ⟷ ( if ( B ∈ ℝ , B , 𝟬 ) ≠ 𝟬 ⟶ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> if ( B ∈ ℝ , B , 𝟬 ) ) ∈ ℝ ) )" by (rule MMI_imbi12d) have S8: "𝟬 ∈ ℝ" by (rule MMI_0re) from S8 have S9: "if ( A ∈ ℝ , A , 𝟬 ) ∈ ℝ" by (rule MMI_elimel) have S10: "𝟬 ∈ ℝ" by (rule MMI_0re) from S10 have S11: "if ( B ∈ ℝ , B , 𝟬 ) ∈ ℝ" by (rule MMI_elimel) from S9 S11 have S12: "if ( B ∈ ℝ , B , 𝟬 ) ≠ 𝟬 ⟶ ( if ( A ∈ ℝ , A , 𝟬 ) \<cdiv> if ( B ∈ ℝ , B , 𝟬 ) ) ∈ ℝ" by (rule MMI_redivclz) from S3 S7 S12 have S13: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( B ≠ 𝟬 ⟶ ( A \<cdiv> B ) ∈ ℝ )" by (rule MMI_dedth2h) from S13 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ B ≠ 𝟬 ) ⟶ ( A \<cdiv> B ) ∈ ℝ" by (rule MMI_3impia) qed (*********221-223*******************************************) lemma (in MMIsar0) MMI_rereccl: assumes A1: "A ∈ ℝ" and A2: "A ≠ 𝟬" shows "( 𝟭 \<cdiv> A ) ∈ ℝ" proof - have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re) from A1 have S2: "A ∈ ℝ". from A2 have S3: "A ≠ 𝟬". from S1 S2 S3 show "( 𝟭 \<cdiv> A ) ∈ ℝ" by (rule MMI_redivcl) qed lemma (in MMIsar0) MMI_rerecclz: assumes A1: "A ∈ ℝ" shows "A ≠ 𝟬 ⟶ ( 𝟭 \<cdiv> A ) ∈ ℝ" proof - have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re) from A1 have S2: "A ∈ ℝ". from S1 S2 show "A ≠ 𝟬 ⟶ ( 𝟭 \<cdiv> A ) ∈ ℝ" by (rule MMI_redivclz) qed lemma (in MMIsar0) MMI_rerecclt: shows "( A ∈ ℝ ∧ A ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> A ) ∈ ℝ" proof - have S1: "𝟭 ∈ ℝ" by (rule MMI_ax1re) have S2: "( 𝟭 ∈ ℝ ∧ A ∈ ℝ ∧ A ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> A ) ∈ ℝ" by (rule MMI_redivclt) from S1 S2 show "( A ∈ ℝ ∧ A ≠ 𝟬 ) ⟶ ( 𝟭 \<cdiv> A ) ∈ ℝ" by (rule MMI_mp3an1) qed (*********** a couple of definitions translated by hand ****) lemma (in MMIsar0) MMI_df_pnf: shows "\<cpnf> = ℂ" using cpnf_def by simp lemma (in MMIsar0) MMI_df_mnf: shows "\<cmnf> = {ℂ}" using cmnf_def by simp lemma (in MMIsar0) MMI_df_xr: shows "ℝ⇧^{*}= ℝ ∪ {\<cpnf>,\<cmnf>}" using cxr_def by simp lemma (in MMIsar0) MMI_ltxrt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟷ ( ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" using cxr_def lessr_def cxr_def cltrrset_def cltrr_def by auto (***223-225***************************************) lemma (in MMIsar0) MMI_pnfnre: shows "\<cpnf> ∉ ℝ" proof - have S1: "¬ ( ℂ ∈ ℂ )" by (rule MMI_eirr) have S2: "\<cpnf> = ℂ" by (rule MMI_df_pnf) from S2 have S3: "\<cpnf> ∈ ℂ ⟷ ℂ ∈ ℂ" by (rule MMI_eleq1i) from S1 S3 have S4: "¬ ( \<cpnf> ∈ ℂ )" by (rule MMI_mtbir) have S5: "\<cpnf> ∈ ℝ ⟶ \<cpnf> ∈ ℂ" by (rule MMI_recnt) from S4 S5 have S6: "¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_mto) have S7: "\<cpnf> ∉ ℝ ⟷ ¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_df_nel) from S6 S7 show "\<cpnf> ∉ ℝ" by (rule MMI_mpbir) qed lemma (in MMIsar0) MMI_minfnre: shows "\<cmnf> ∉ ℝ" proof - have S1: "ℂ isASet" by (rule MMI_axcnex) from S1 have S2: "ℂ ∈ { ℂ }" by (rule MMI_snid) have S3: "¬ ( ( ℂ ∈ { ℂ } ∧ { ℂ } ∈ ℂ ) )" by (rule MMI_en2lp) have S4: "( ℂ ∈ { ℂ } ⟶ ¬ ( { ℂ } ∈ ℂ ) ) ⟷ ¬ ( ( ℂ ∈ { ℂ } ∧ { ℂ } ∈ ℂ ) )" by (rule MMI_imnan) from S3 S4 have S5: "ℂ ∈ { ℂ } ⟶ ¬ ( { ℂ } ∈ ℂ )" by (rule MMI_mpbir) from S2 S5 have S6: "¬ ( { ℂ } ∈ ℂ )" by (rule MMI_ax_mp) have S7: "\<cmnf> = { ℂ }" by (rule MMI_df_mnf) from S7 have S8: "\<cmnf> ∈ ℂ ⟷ { ℂ } ∈ ℂ" by (rule MMI_eleq1i) from S6 S8 have S9: "¬ ( \<cmnf> ∈ ℂ )" by (rule MMI_mtbir) have S10: "\<cmnf> ∈ ℝ ⟶ \<cmnf> ∈ ℂ" by (rule MMI_recnt) from S9 S10 have S11: "¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_mto) have S12: "\<cmnf> ∉ ℝ ⟷ ¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_df_nel) from S11 S12 show "\<cmnf> ∉ ℝ" by (rule MMI_mpbir) qed (***********226-228*********************************) lemma (in MMIsar0) MMI_ressxr: shows "ℝ ⊆ ℝ⇧^{*}" proof - have S1: "ℝ ⊆ ( ℝ ∪ { \<cpnf> , \<cmnf> } )" by (rule MMI_ssun1) have S2: "ℝ⇧^{*}= ( ℝ ∪ { \<cpnf> , \<cmnf> } )" by (rule MMI_df_xr) from S1 S2 show "ℝ ⊆ ℝ⇧^{*}" by (rule MMI_sseqtr4) qed lemma (in MMIsar0) MMI_rexrt: shows "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" proof - have S1: "ℝ ⊆ ℝ⇧^{*}" by (rule MMI_ressxr) from S1 show "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_sseli) qed lemma (in MMIsar0) MMI_ltxrltt: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" proof - have S1: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟷ ( ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) have S2: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S3: "B ∈ ℝ ⟶ B ∈ ℝ⇧^{*}" by (rule MMI_rexrt) from S1 S2 S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ( ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" by (rule MMI_syl2an) have S5: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsr> B ⟷ ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) )" by (rule MMI_ibar) have S6: "\<cpnf> ∉ ℝ" by (rule MMI_pnfnre) have S7: "\<cpnf> ∉ ℝ ⟷ ¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_df_nel) from S6 S7 have S8: "¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_mpbi) have S9: "B = \<cpnf> ⟶ ( B ∈ ℝ ⟷ \<cpnf> ∈ ℝ )" by (rule MMI_eleq1) from S8 S9 have S10: "B = \<cpnf> ⟶ ¬ ( B ∈ ℝ )" by (rule MMI_mtbiri) from S10 have S11: "B ∈ ℝ ⟶ ¬ ( B = \<cpnf> )" by (rule MMI_con2i) from S11 have S12: "B ∈ ℝ ⟶ ¬ ( ( A = \<cmnf> ∧ B = \<cpnf> ) )" by (rule MMI_intnand) from S12 have S13: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ¬ ( ( A = \<cmnf> ∧ B = \<cpnf> ) )" by (rule MMI_adantl) from S11 have S14: "B ∈ ℝ ⟶ ¬ ( B = \<cpnf> )" . from S14 have S15: "B ∈ ℝ ⟶ ¬ ( ( A ∈ ℝ ∧ B = \<cpnf> ) )" by (rule MMI_intnand) have S16: "\<cmnf> ∉ ℝ" by (rule MMI_minfnre) have S17: "\<cmnf> ∉ ℝ ⟷ ¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_df_nel) from S16 S17 have S18: "¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_mpbi) have S19: "A = \<cmnf> ⟶ ( A ∈ ℝ ⟷ \<cmnf> ∈ ℝ )" by (rule MMI_eleq1) from S18 S19 have S20: "A = \<cmnf> ⟶ ¬ ( A ∈ ℝ )" by (rule MMI_mtbiri) from S20 have S21: "A ∈ ℝ ⟶ ¬ ( A = \<cmnf> )" by (rule MMI_con2i) from S21 have S22: "A ∈ ℝ ⟶ ¬ ( ( A = \<cmnf> ∧ B ∈ ℝ ) )" by (rule MMI_intnanrd) from S15 S22 have S23: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( ¬ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ) ∧ ¬ ( ( A = \<cmnf> ∧ B ∈ ℝ ) ) )" by (rule MMI_anim12i) have S24: "¬ ( ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ⟷ ( ¬ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ) ∧ ¬ ( ( A = \<cmnf> ∧ B ∈ ℝ ) ) )" by (rule MMI_ioran) from S23 S24 have S25: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ¬ ( ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) )" by (rule MMI_sylibr) from S25 have S26: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ¬ ( ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) )" by (rule MMI_ancoms) from S13 S26 have S27: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∧ ¬ ( ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" by (rule MMI_jca) have S28: "¬ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ) ⟷ ( ¬ ( ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∧ ¬ ( ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" by (rule MMI_ioran) from S27 S28 have S29: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ¬ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" by (rule MMI_sylibr) have S30: "¬ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ) ⟶ ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ⟷ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ∨ ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ) )" by (rule MMI_biorf) from S29 S30 have S31: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ⟷ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ∨ ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ) )" by (rule MMI_syl) from S5 S31 have S32: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ∨ ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ) ⟷ A \<lsr> B )" by (rule MMI_bitr2d) have S33: "( ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ⟷ ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) )" by (rule MMI_orass) have S34: "( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ) ⟷ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ∨ ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) )" by (rule MMI_orcom) from S33 S34 have S35: "( ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ⟷ ( ( ( A = \<cmnf> ∧ B = \<cpnf> ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ∨ ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) )" by (rule MMI_bitr) from S32 S35 have S36: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( ( ( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsr> B ) ∨ ( A = \<cmnf> ∧ B = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ B = \<cpnf> ) ∨ ( A = \<cmnf> ∧ B ∈ ℝ ) ) ) ⟷ A \<lsr> B )" by (rule MMI_syl5bb) from S4 S36 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" by (rule MMI_bitrd) qed (*********** proven by hand from definition******** note that MMIsar definition of \<lsq> (see the locale (is different than Metamath's, we may have to change it if it leads problems. ******************************************************) lemma (in MMIsar0) MMI_xrlenltt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" using lsq_def by simp (*********229,230*******************************) lemma (in MMIsar0) MMI_axlttri: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ¬ ( ( A = B ∨ B \<ls> A ) ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsr> B ⟷ ¬ ( ( A = B ∨ B \<lsr> A ) ) )" by (rule MMI_pre_axlttri) have S2: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" by (rule MMI_ltxrltt) have S3: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( B \<ls> A ⟷ B \<lsr> A )" by (rule MMI_ltxrltt) from S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( B \<ls> A ⟷ B \<lsr> A )" by (rule MMI_ancoms) from S4 have S5: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( A = B ∨ B \<ls> A ) ⟷ ( A = B ∨ B \<lsr> A ) )" by (rule MMI_orbi2d) from S5 have S6: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( ( A = B ∨ B \<ls> A ) ) ⟷ ¬ ( ( A = B ∨ B \<lsr> A ) ) )" by (rule MMI_negbid) from S1 S2 S6 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ¬ ( ( A = B ∨ B \<ls> A ) ) )" by (rule MMI_3bitr4d) qed lemma (in MMIsar0) MMI_axlttrn: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsr> B ∧ B \<lsr> C ) ⟶ A \<lsr> C )" by (rule MMI_pre_axlttrn) have S2: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" by (rule MMI_ltxrltt) from S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" by (rule MMI_3adant3) have S4: "( B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<ls> C ⟷ B \<lsr> C )" by (rule MMI_ltxrltt) from S4 have S5: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<ls> C ⟷ B \<lsr> C )" by (rule MMI_3adant1) from S3 S5 have S6: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟷ ( A \<lsr> B ∧ B \<lsr> C ) )" by (rule MMI_anbi12d) have S7: "( A ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> C ⟷ A \<lsr> C )" by (rule MMI_ltxrltt) from S7 have S8: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> C ⟷ A \<lsr> C )" by (rule MMI_3adant2) from S1 S6 S8 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3imtr4d) qed (***************231-235********************************) lemma (in MMIsar0) MMI_axltadd: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ( C \<ca> A ) \<ls> ( C \<ca> B ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<lsr> B ⟶ ( C \<ca> A ) \<lsr> ( C \<ca> B ) )" by (rule MMI_pre_axltadd) have S2: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" by (rule MMI_ltxrltt) from S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟷ A \<lsr> B )" by (rule MMI_3adant3) have S4: "( ( C \<ca> A ) ∈ ℝ ∧ ( C \<ca> B ) ∈ ℝ ) ⟶ ( ( C \<ca> A ) \<ls> ( C \<ca> B ) ⟷ ( C \<ca> A ) \<lsr> ( C \<ca> B ) )" by (rule MMI_ltxrltt) have S5: "( C ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( C \<ca> A ) ∈ ℝ" by (rule MMI_axaddrcl) have S6: "( C ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( C \<ca> B ) ∈ ℝ" by (rule MMI_axaddrcl) from S4 S5 S6 have S7: "( ( C ∈ ℝ ∧ A ∈ ℝ ) ∧ ( C ∈ ℝ ∧ B ∈ ℝ ) ) ⟶ ( ( C \<ca> A ) \<ls> ( C \<ca> B ) ⟷ ( C \<ca> A ) \<lsr> ( C \<ca> B ) )" by (rule MMI_syl2an) from S7 have S8: "( C ∈ ℝ ∧ A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( C \<ca> A ) \<ls> ( C \<ca> B ) ⟷ ( C \<ca> A ) \<lsr> ( C \<ca> B ) )" by (rule MMI_3impdi) from S8 have S9: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( C \<ca> A ) \<ls> ( C \<ca> B ) ⟷ ( C \<ca> A ) \<lsr> ( C \<ca> B ) )" by (rule MMI_3coml) from S1 S3 S9 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ( C \<ca> A ) \<ls> ( C \<ca> B ) )" by (rule MMI_3imtr4d) qed lemma (in MMIsar0) MMI_axmulgt0: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( 𝟬 \<ls> A ∧ 𝟬 \<ls> B ) ⟶ 𝟬 \<ls> ( A ⋅ B ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( 𝟬 \<lsr> A ∧ 𝟬 \<lsr> B ) ⟶ 𝟬 \<lsr> ( A ⋅ B ) )" by (rule MMI_pre_axmulgt0) have S2: "𝟬 ∈ ℝ" by (rule MMI_0re) have S3: "( 𝟬 ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( 𝟬 \<ls> A ⟷ 𝟬 \<lsr> A )" by (rule MMI_ltxrltt) from S2 S3 have S4: "A ∈ ℝ ⟶ ( 𝟬 \<ls> A ⟷ 𝟬 \<lsr> A )" by (rule MMI_mpan) have S5: "𝟬 ∈ ℝ" by (rule MMI_0re) have S6: "( 𝟬 ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( 𝟬 \<ls> B ⟷ 𝟬 \<lsr> B )" by (rule MMI_ltxrltt) from S5 S6 have S7: "B ∈ ℝ ⟶ ( 𝟬 \<ls> B ⟷ 𝟬 \<lsr> B )" by (rule MMI_mpan) from S4 S7 have S8: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( 𝟬 \<ls> A ∧ 𝟬 \<ls> B ) ⟷ ( 𝟬 \<lsr> A ∧ 𝟬 \<lsr> B ) )" by (rule MMI_bi2anan9) have S9: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A ⋅ B ) ∈ ℝ" by (rule MMI_axmulrcl) have S10: "𝟬 ∈ ℝ" by (rule MMI_0re) have S11: "( 𝟬 ∈ ℝ ∧ ( A ⋅ B ) ∈ ℝ ) ⟶ ( 𝟬 \<ls> ( A ⋅ B ) ⟷ 𝟬 \<lsr> ( A ⋅ B ) )" by (rule MMI_ltxrltt) from S10 S11 have S12: "( A ⋅ B ) ∈ ℝ ⟶ ( 𝟬 \<ls> ( A ⋅ B ) ⟷ 𝟬 \<lsr> ( A ⋅ B ) )" by (rule MMI_mpan) from S9 S12 have S13: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( 𝟬 \<ls> ( A ⋅ B ) ⟷ 𝟬 \<lsr> ( A ⋅ B ) )" by (rule MMI_syl) from S1 S8 S13 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( 𝟬 \<ls> A ∧ 𝟬 \<ls> B ) ⟶ 𝟬 \<ls> ( A ⋅ B ) )" by (rule MMI_3imtr4d) qed lemma (in MMIsar0) MMI_axsup: shows "( ( A ⊆ ℝ ∧ A ≠ 0 ∧ ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<ls> x ) ) ⟶ ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<ls> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ) ) ) )" proof - have S1: "( ( A ⊆ ℝ ∧ A ≠ 0 ∧ ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<lsr> x ) ) ⟶ ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) )" by (rule MMI_pre_axsup) from S1 have S2: "( ( ( A ⊆ ℝ ∧ A ≠ 0 ) ∧ ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<lsr> x ) ) ⟶ ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) )" by (rule MMI_3expa) from S2 have S3: "( ( A ⊆ ℝ ∧ A ≠ 0 ) ⟶ ( ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<lsr> x ) ⟶ ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) ) )" by (rule MMI_ex) { fix x { fix y have S4: "( y ∈ ℝ ∧ x ∈ ℝ ) ⟶ ( y \<ls> x ⟷ y \<lsr> x )" by (rule MMI_ltxrltt) have S5: "( ( A ⊆ ℝ ∧ y ∈ A ) ⟶ y ∈ ℝ )" by (rule MMI_ssel2) from S4 S5 have S6: "( ( ( A ⊆ ℝ ∧ y ∈ A ) ∧ x ∈ ℝ ) ⟶ ( y \<ls> x ⟷ y \<lsr> x ) )" by (rule MMI_sylan) from S6 have "( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ A ) ⟶ ( y \<ls> x ⟷ y \<lsr> x ) )" by (rule MMI_an1rs) } then have S7: "∀y. ( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ A ) ⟶ ( y \<ls> x ⟷ y \<lsr> x ) )" by simp from S7 have "( ( A ⊆ ℝ ∧ x ∈ ℝ ) ⟶ ( ( ∀ y ∈ A . y \<ls> x ) ⟷ ( ∀ y ∈ A . y \<lsr> x ) ) )" by (rule MMI_ralbidva) } then have S8: "∀ x. ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ⟶ ( ( ∀ y ∈ A . y \<ls> x ) ⟷ ( ∀ y ∈ A . y \<lsr> x ) ) )" by simp from S8 have S9: "( A ⊆ ℝ ⟶ ( ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<ls> x ) ⟷ ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<lsr> x ) ) )" by (rule MMI_rexbidva) from S9 have S10: "( ( A ⊆ ℝ ∧ A ≠ 0 ) ⟶ ( ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<ls> x ) ⟷ ( ∃ x ∈ ℝ . ∀ y ∈ A . y \<lsr> x ) ) )" by (rule MMI_adantr) { fix x { fix y have S11: "( x ∈ ℝ ∧ y ∈ ℝ ) ⟶ ( x \<ls> y ⟷ x \<lsr> y )" by (rule MMI_ltxrltt) from S11 have S12: "( y ∈ ℝ ∧ x ∈ ℝ ) ⟶ ( x \<ls> y ⟷ x \<lsr> y )" by (rule MMI_ancoms) have S13: "( ( A ⊆ ℝ ∧ y ∈ A ) ⟶ y ∈ ℝ )" by (rule MMI_ssel2) from S12 S13 have S14: "( ( ( A ⊆ ℝ ∧ y ∈ A ) ∧ x ∈ ℝ ) ⟶ ( x \<ls> y ⟷ x \<lsr> y ) )" by (rule MMI_sylan) from S14 have S15: "( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ A ) ⟶ ( x \<ls> y ⟷ x \<lsr> y ) )" by (rule MMI_an1rs) from S15 have "( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ A ) ⟶ ( ¬ ( x \<ls> y ) ⟷ ¬ ( x \<lsr> y ) ) )" by (rule MMI_negbid) } then have S16: "∀ y. ( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ A ) ⟶ ( ¬ ( x \<ls> y ) ⟷ ¬ ( x \<lsr> y ) ) )" by simp from S16 have S17: "( ( A ⊆ ℝ ∧ x ∈ ℝ ) ⟶ ( ( ∀ y ∈ A . ¬ ( x \<ls> y ) ) ⟷ ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ) )" by (rule MMI_ralbidva) { fix y have S18: "( y ∈ ℝ ∧ x ∈ ℝ ) ⟶ ( y \<ls> x ⟷ y \<lsr> x )" by (rule MMI_ltxrltt) from S18 have S19: "( x ∈ ℝ ∧ y ∈ ℝ ) ⟶ ( y \<ls> x ⟷ y \<lsr> x )" by (rule MMI_ancoms) from S19 have S20: "( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ ℝ ) ⟶ ( y \<ls> x ⟷ y \<lsr> x ) )" by (rule MMI_adantll) { fix z have S21: "( y ∈ ℝ ∧ z ∈ ℝ ) ⟶ ( y \<ls> z ⟷ y \<lsr> z )" by (rule MMI_ltxrltt) from S21 have S22: "( z ∈ ℝ ∧ y ∈ ℝ ) ⟶ ( y \<ls> z ⟷ y \<lsr> z )" by (rule MMI_ancoms) have S23: "( ( A ⊆ ℝ ∧ z ∈ A ) ⟶ z ∈ ℝ )" by (rule MMI_ssel2) from S22 S23 have S24: "( ( ( A ⊆ ℝ ∧ z ∈ A ) ∧ y ∈ ℝ ) ⟶ ( y \<ls> z ⟷ y \<lsr> z ) )" by (rule MMI_sylan) from S24 have S25: "( ( ( A ⊆ ℝ ∧ y ∈ ℝ ) ∧ z ∈ A ) ⟶ ( y \<ls> z ⟷ y \<lsr> z ) )" by (rule MMI_an1rs) } then have S25: "∀z. ( ( ( A ⊆ ℝ ∧ y ∈ ℝ ) ∧ z ∈ A ) ⟶ ( y \<ls> z ⟷ y \<lsr> z ) )" by simp from S25 have S26: "( ( A ⊆ ℝ ∧ y ∈ ℝ ) ⟶ ( ( ∃ z ∈ A . y \<ls> z ) ⟷ ( ∃ z ∈ A . y \<lsr> z ) ) )" by (rule MMI_rexbidva) from S26 have S27: "( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ ℝ ) ⟶ ( ( ∃ z ∈ A . y \<ls> z ) ⟷ ( ∃ z ∈ A . y \<lsr> z ) ) )" by (rule MMI_adantlr) from S20 S27 have "( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ ℝ ) ⟶ ( ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ⟷ ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) )" by (rule MMI_imbi12d) } then have S28: "∀ y. ( ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ∧ y ∈ ℝ ) ⟶ ( ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ⟷ ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) )" by simp from S28 have S29: "( ( A ⊆ ℝ ∧ x ∈ ℝ ) ⟶ ( ( ∀ y ∈ ℝ . ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ) ⟷ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) )" by (rule MMI_ralbidva) from S17 S29 have "( ( A ⊆ ℝ ∧ x ∈ ℝ ) ⟶ ( ( ( ∀ y ∈ A . ¬ ( x \<ls> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ) ) ⟷ ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) )" by (rule MMI_anbi12d) } then have S30: "∀ x. ( ( A ⊆ ℝ ∧ x ∈ ℝ ) ⟶ ( ( ( ∀ y ∈ A . ¬ ( x \<ls> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ) ) ⟷ ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) )" by simp from S30 have S31: "( A ⊆ ℝ ⟶ ( ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<ls> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ) ) ) ⟷ ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) ) )" by (rule MMI_rexbidva) from S31 have S32: "( ( A ⊆ ℝ ∧ A ≠ 0 ) ⟶ ( ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<ls> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<ls> x ⟶ ( ∃ z ∈ A . y \<ls> z ) ) ) ) ) ⟷ ( ∃ x ∈ ℝ . ( ( ∀ y ∈ A . ¬ ( x \<lsr> y ) ) ∧ ( ∀ y ∈ ℝ . ( y \<lsr> x ⟶ ( ∃ z ∈ A . y \<lsr> z ) ) ) ) ) ) )" by (rule MMI_adantr) from S3 S10 S32 have S33: "( ( 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_3imtr4d) from S33 show "( ( 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_3impia) qed lemma (in MMIsar0) MMI_lenltt: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" proof - have S1: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_xrlenltt) have S2: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S3: "B ∈ ℝ ⟶ B ∈ ℝ⇧^{*}" by (rule MMI_rexrt) from S1 S2 S3 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_syl2an) qed lemma (in MMIsar0) MMI_ltnlet: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ¬ ( B \<lsq> A ) )" proof - have S1: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( B \<lsq> A ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_lenltt) from S1 have S2: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( B \<lsq> A ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_ancoms) from S2 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ¬ ( B \<lsq> A ) )" by (rule MMI_con2bid) qed (**********236*********************) lemma (in MMIsar0) MMI_ltso: shows "\<cltrrset> Orders ℝ" proof - { fix x y z have S1: "( x ∈ ℝ ∧ y ∈ ℝ ) ⟶ ( x \<ls> y ⟷ ¬ ( ( x = y ∨ y \<ls> x ) ) )" by (rule MMI_axlttri) from S1 have S2: "( x ∈ ℝ ∧ y ∈ ℝ ∧ z ∈ ℝ ) ⟶ ( x \<ls> y ⟷ ¬ ( ( x = y ∨ y \<ls> x ) ) )" by (rule MMI_3adant3) have S3: "( x ∈ ℝ ∧ y ∈ ℝ ∧ z ∈ ℝ ) ⟶ ( ( x \<ls> y ∧ y \<ls> z ) ⟶ x \<ls> z )" by (rule MMI_axlttrn) from S2 S3 have "( x ∈ ℝ ∧ y ∈ ℝ ∧ z ∈ ℝ ) ⟶ ( ( x \<ls> y ⟷ ¬ ( ( x = y ∨ y \<ls> x ) ) ) ∧ ( ( x \<ls> y ∧ y \<ls> z ) ⟶ x \<ls> z ) )" by (rule MMI_jca) then have "( x ∈ ℝ ∧ y ∈ ℝ ∧ z ∈ ℝ ) ⟶ ( ( ⟨x, y⟩ ∈ \<cltrrset> ⟷ ¬ ( ( x = y ∨ ⟨y,x⟩ ∈ \<cltrrset> ) ) ) ∧ ( ( ⟨x,y⟩ ∈ \<cltrrset> ∧ ⟨y,z⟩ ∈ \<cltrrset> ) ⟶ ⟨x, z⟩ ∈ \<cltrrset> ) )" using cltrr_def by simp } then have S4: "∀x y z. ( x ∈ ℝ ∧ y ∈ ℝ ∧ z ∈ ℝ ) ⟶ ( ( ⟨x, y⟩ ∈ \<cltrrset> ⟷ ¬ ( ( x = y ∨ ⟨y,x⟩ ∈ \<cltrrset> ) ) ) ∧ ( ( ⟨x,y⟩ ∈ \<cltrrset> ∧ ⟨y,z⟩ ∈ \<cltrrset> ) ⟶ ⟨x, z⟩ ∈ \<cltrrset> ) )" by auto from S4 show "\<cltrrset> Orders ℝ" by (rule MMI_so) qed (*********237-240************************) lemma (in MMIsar0) MMI_lttri2t: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( A = B ) ⟷ ( A \<ls> B ∨ B \<ls> A ) )" proof - have S1: "\<cltrrset> Orders ℝ" by (rule MMI_ltso) have "( \<cltrrset> Orders ℝ ∧ ( A ∈ ℝ ∧ B ∈ ℝ ) ) ⟶ ( A = B ⟷ ¬ ( ( ⟨A, B⟩ ∈ \<cltrrset> ∨ ⟨B,A ⟩ ∈ \<cltrrset>) ) )" by (rule MMI_sotrieq) then have S2: "( \<cltrrset> Orders ℝ ∧ ( A ∈ ℝ ∧ B ∈ ℝ ) ) ⟶ ( A = B ⟷ ¬ ( ( A \<ls> B ∨ B \<ls> A ) ) )" using cltrr_def by simp from S1 S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ¬ ( ( A \<ls> B ∨ B \<ls> A ) ) )" by (rule MMI_mpan) from S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( ( A \<ls> B ∨ B \<ls> A ) ) ⟷ A = B )" by (rule MMI_bicomd) from S4 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( A = B ) ⟷ ( A \<ls> B ∨ B \<ls> A ) )" by (rule MMI_con1bid) qed lemma (in MMIsar0) MMI_lttri3t: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" proof - have S1: "\<cltrrset> Orders ℝ" by (rule MMI_ltso) have "( \<cltrrset> Orders ℝ ∧ ( A ∈ ℝ ∧ B ∈ ℝ ) ) ⟶ ( A = B ⟷ ( ¬ ( ⟨A, B⟩ ∈ \<cltrrset> ) ∧ ¬ ( ⟨B,A⟩ ∈ \<cltrrset> ) ) )" by (rule MMI_sotrieq2) then have S2: "( \<cltrrset> Orders ℝ ∧ ( A ∈ ℝ ∧ B ∈ ℝ ) ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" using cltrr_def by simp from S1 S2 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" by (rule MMI_mpan) qed lemma (in MMIsar0) MMI_ltnet: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( A = B ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( A = B ) ⟷ ( A \<ls> B ∨ B \<ls> A ) )" by (rule MMI_lttri2t) have S2: "A \<ls> B ⟶ ( A \<ls> B ∨ B \<ls> A )" by (rule MMI_orc) from S1 S2 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( A = B ) )" by (rule MMI_syl5bir) qed lemma (in MMIsar0) MMI_letri3t: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" by (rule MMI_lttri3t) have S2: "( ¬ ( B \<ls> A ) ∧ ¬ ( A \<ls> B ) ) ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) )" by (rule MMI_ancom) from S1 S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( ¬ ( B \<ls> A ) ∧ ¬ ( A \<ls> B ) ) )" by (rule MMI_syl6bbr) have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_lenltt) have S5: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( B \<lsq> A ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_lenltt) from S5 have S6: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( B \<lsq> A ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_ancoms) from S4 S6 have S7: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<lsq> A ) ⟷ ( ¬ ( B \<ls> A ) ∧ ¬ ( A \<ls> B ) ) )" by (rule MMI_anbi12d) from S3 S7 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A ) )" by (rule MMI_bitr4d) qed (************** 240-250********************************) lemma (in MMIsar0) MMI_leloet: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_lenltt) have S2: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( B \<ls> A ⟷ ¬ ( ( B = A ∨ A \<ls> B ) ) )" by (rule MMI_axlttri) from S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( B \<ls> A ⟷ ¬ ( ( B = A ∨ A \<ls> B ) ) )" by (rule MMI_ancoms) from S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( B = A ∨ A \<ls> B ) ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_con2bid) have S5: "B = A ⟷ A = B" by (rule MMI_eqcom) from S5 have S6: "( B = A ∨ A \<ls> B ) ⟷ ( A = B ∨ A \<ls> B )" by (rule MMI_orbi1i) have S7: "( A = B ∨ A \<ls> B ) ⟷ ( A \<ls> B ∨ A = B )" by (rule MMI_orcom) from S6 S7 have S8: "( B = A ∨ A \<ls> B ) ⟷ ( A \<ls> B ∨ A = B )" by (rule MMI_bitr) from S4 S8 have S9: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( B \<ls> A ) ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_syl5rbbr) from S1 S9 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_bitrd) qed lemma (in MMIsar0) MMI_eqleltt: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( A \<lsq> B ∧ ¬ ( A \<ls> B ) ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A ) )" by (rule MMI_letri3t) have S2: "( B ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( B \<lsq> A ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_lenltt) from S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( B \<lsq> A ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_ancoms) from S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<lsq> A ) ⟷ ( A \<lsq> B ∧ ¬ ( A \<ls> B ) ) )" by (rule MMI_anbi2d) from S1 S4 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( A \<lsq> B ∧ ¬ ( A \<ls> B ) ) )" by (rule MMI_bitrd) qed lemma (in MMIsar0) MMI_ltlet: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ A \<lsq> B )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_leloet) have S2: "A \<ls> B ⟶ ( A \<ls> B ∨ A = B )" by (rule MMI_orc) from S1 S2 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ A \<lsq> B )" by (rule MMI_syl5bir) qed lemma (in MMIsar0) MMI_leltnet: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ A \<lsq> B ) ⟶ ( A \<ls> B ⟷ ¬ ( A = B ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" by (rule MMI_lttri3t) have S2: "( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) ⟶ ¬ ( A \<ls> B )" by (rule MMI_pm3_26) from S1 S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_syl6bi) from S3 have S4: "( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( A = B ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_adantr) have S5: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_leloet) from S5 have S6: "( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( A \<ls> B ∨ A = B )" by (rule MMI_biimpa) from S6 have S7: "( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( ¬ ( A \<ls> B ) ⟶ A = B )" by (rule MMI_ord) from S4 S7 have S8: "( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( A = B ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_impbid) from S8 have S9: "( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( A \<ls> B ⟷ ¬ ( A = B ) )" by (rule MMI_con2bid) from S9 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ A \<lsq> B ) ⟶ ( A \<ls> B ⟷ ¬ ( A = B ) )" by (rule MMI_3impa) qed lemma (in MMIsar0) MMI_ltlent: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ( A \<lsq> B ∧ ¬ ( A = B ) ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ A \<lsq> B )" by (rule MMI_ltlet) have S2: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( A = B ) )" by (rule MMI_ltnet) from S1 S2 have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ( A \<lsq> B ∧ ¬ ( A = B ) ) )" by (rule MMI_jcad) have S4: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_leloet) have S5: "A \<ls> B ⟶ ( ¬ ( A = B ) ⟶ A \<ls> B )" by (rule MMI_ax_1) have S6: "A = B ⟶ ( ¬ ( A = B ) ⟶ A \<ls> B )" by (rule MMI_pm2_24) from S5 S6 have S7: "( A \<ls> B ∨ A = B ) ⟶ ( ¬ ( A = B ) ⟶ A \<ls> B )" by (rule MMI_jaoi) from S4 S7 have S8: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟶ ( ¬ ( A = B ) ⟶ A \<ls> B ) )" by (rule MMI_syl6bi) from S8 have S9: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ ¬ ( A = B ) ) ⟶ A \<ls> B )" by (rule MMI_imp3a) from S3 S9 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ( A \<lsq> B ∧ ¬ ( A = B ) ) )" by (rule MMI_impbid) qed lemma (in MMIsar0) MMI_lelttrt: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_leloet) from S1 have S2: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_3adant3) have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_axlttrn) from S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_exp3a) have S5: "A = B ⟶ ( A \<ls> C ⟷ B \<ls> C )" by (rule MMI_breq1) from S5 have S6: "A = B ⟶ ( B \<ls> C ⟶ A \<ls> C )" by (rule MMI_biimprd) from S6 have S7: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A = B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_a1i) from S4 S7 have S8: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∨ A = B ) ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_jaod) from S2 S8 have S9: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<lsq> B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_sylbid) from S9 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_imp3a) qed lemma (in MMIsar0) MMI_ltletrt: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<lsq> C ) ⟶ A \<ls> C )" proof - have S1: "( B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_leloet) from S1 have S2: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_3adant1) have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_axlttrn) from S3 have S4: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_exp3a) from S4 have S5: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<ls> C ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_com23) have S6: "B = C ⟶ ( A \<ls> B ⟷ A \<ls> C )" by (rule MMI_breq2) from S6 have S7: "B = C ⟶ ( A \<ls> B ⟶ A \<ls> C )" by (rule MMI_biimpd) from S7 have S8: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B = C ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_a1i) from S5 S8 have S9: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( B \<ls> C ∨ B = C ) ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_jaod) from S2 S9 have S10: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<lsq> C ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_sylbid) from S10 have S11: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ( B \<lsq> C ⟶ A \<ls> C ) )" by (rule MMI_com23) from S11 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<lsq> C ) ⟶ A \<ls> C )" by (rule MMI_imp3a) qed lemma (in MMIsar0) MMI_letrt: shows "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<lsq> C ) ⟶ A \<lsq> C )" proof - have S1: "( B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_leloet) from S1 have S2: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_3adant1) from S2 have S3: "( ( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_adantr) have S4: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_lelttrt) have S5: "( A ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> C ⟶ A \<lsq> C )" by (rule MMI_ltlet) from S5 have S6: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<ls> C ⟶ A \<lsq> C )" by (rule MMI_3adant2) from S4 S6 have S7: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<lsq> C )" by (rule MMI_syld) from S7 have S8: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<lsq> B ⟶ ( B \<ls> C ⟶ A \<lsq> C ) )" by (rule MMI_exp3a) from S8 have S9: "( ( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( B \<ls> C ⟶ A \<lsq> C )" by (rule MMI_imp) have S10: "B = C ⟶ ( A \<lsq> B ⟷ A \<lsq> C )" by (rule MMI_breq2) from S10 have S11: "A \<lsq> B ⟶ ( B = C ⟶ A \<lsq> C )" by (rule MMI_biimpcd) from S11 have S12: "( ( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( B = C ⟶ A \<lsq> C )" by (rule MMI_adantl) from S9 S12 have S13: "( ( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( ( B \<ls> C ∨ B = C ) ⟶ A \<lsq> C )" by (rule MMI_jaod) from S3 S13 have S14: "( ( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ∧ A \<lsq> B ) ⟶ ( B \<lsq> C ⟶ A \<lsq> C )" by (rule MMI_sylbid) from S14 have S15: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( A \<lsq> B ⟶ ( B \<lsq> C ⟶ A \<lsq> C ) )" by (rule MMI_ex) from S15 show "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<lsq> C ) ⟶ A \<lsq> C )" by (rule MMI_imp3a) qed lemma (in MMIsar0) MMI_letrd: assumes A1: "φ ⟶ A ∈ ℝ" and A2: "φ ⟶ B ∈ ℝ" and A3: "φ ⟶ C ∈ ℝ" and A4: "φ ⟶ A \<lsq> B" and A5: "φ ⟶ B \<lsq> C" shows "φ ⟶ A \<lsq> C" proof - from A4 have S1: "φ ⟶ A \<lsq> B". from A5 have S2: "φ ⟶ B \<lsq> C". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<lsq> C ) ⟶ A \<lsq> C )" by (rule MMI_letrt) from A1 have S4: "φ ⟶ A ∈ ℝ". from A2 have S5: "φ ⟶ B ∈ ℝ". from A3 have S6: "φ ⟶ C ∈ ℝ". from S3 S4 S5 S6 have S7: "φ ⟶ ( ( A \<lsq> B ∧ B \<lsq> C ) ⟶ A \<lsq> C )" by (rule MMI_syl3anc) from S1 S2 S7 show "φ ⟶ A \<lsq> C" by (rule MMI_mp2and) qed lemma (in MMIsar0) MMI_lelttrd: assumes A1: "φ ⟶ A ∈ ℝ" and A2: "φ ⟶ B ∈ ℝ" and A3: "φ ⟶ C ∈ ℝ" and A4: "φ ⟶ A \<lsq> B" and A5: "φ ⟶ B \<ls> C" shows "φ ⟶ A \<ls> C" proof - from A4 have S1: "φ ⟶ A \<lsq> B". from A5 have S2: "φ ⟶ B \<ls> C". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_lelttrt) from A1 have S4: "φ ⟶ A ∈ ℝ". from A2 have S5: "φ ⟶ B ∈ ℝ". from A3 have S6: "φ ⟶ C ∈ ℝ". from S3 S4 S5 S6 have S7: "φ ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_syl3anc) from S1 S2 S7 show "φ ⟶ A \<ls> C" by (rule MMI_mp2and) qed (***************251-260********************************) lemma (in MMIsar0) MMI_ltletrd: assumes A1: "φ ⟶ A ∈ ℝ" and A2: "φ ⟶ B ∈ ℝ" and A3: "φ ⟶ C ∈ ℝ" and A4: "φ ⟶ A \<ls> B" and A5: "φ ⟶ B \<lsq> C" shows "φ ⟶ A \<ls> C" proof - from A4 have S1: "φ ⟶ A \<ls> B". from A5 have S2: "φ ⟶ B \<lsq> C". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<lsq> C ) ⟶ A \<ls> C )" by (rule MMI_ltletrt) from A1 have S4: "φ ⟶ A ∈ ℝ". from A2 have S5: "φ ⟶ B ∈ ℝ". from A3 have S6: "φ ⟶ C ∈ ℝ". from S3 S4 S5 S6 have S7: "φ ⟶ ( ( A \<ls> B ∧ B \<lsq> C ) ⟶ A \<ls> C )" by (rule MMI_syl3anc) from S1 S2 S7 show "φ ⟶ A \<ls> C" by (rule MMI_mp2and) qed lemma (in MMIsar0) MMI_lttrd: assumes A1: "φ ⟶ A ∈ ℝ" and A2: "φ ⟶ B ∈ ℝ" and A3: "φ ⟶ C ∈ ℝ" and A4: "φ ⟶ A \<ls> B" and A5: "φ ⟶ B \<ls> C" shows "φ ⟶ A \<ls> C" proof - from A4 have S1: "φ ⟶ A \<ls> B". from A5 have S2: "φ ⟶ B \<ls> C". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_axlttrn) from A1 have S4: "φ ⟶ A ∈ ℝ". from A2 have S5: "φ ⟶ B ∈ ℝ". from A3 have S6: "φ ⟶ C ∈ ℝ". from S3 S4 S5 S6 have S7: "φ ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_syl3anc) from S1 S2 S7 show "φ ⟶ A \<ls> C" by (rule MMI_mp2and) qed lemma (in MMIsar0) MMI_ltnrt: shows "A ∈ ℝ ⟶ ¬ ( A \<ls> A )" proof - have S1: "\<cltrrset> Orders ℝ" by (rule MMI_ltso) have "( \<cltrrset> Orders ℝ ∧ A ∈ ℝ ) ⟶ ¬ ( ⟨A,A⟩ ∈ \<cltrrset> )" by (rule MMI_sonr) then have S2: "( \<cltrrset> Orders ℝ ∧ A ∈ ℝ ) ⟶ ¬ ( A \<ls> A )" using cltrr_def by simp from S1 S2 show "A ∈ ℝ ⟶ ¬ ( A \<ls> A )" by (rule MMI_mpan) qed lemma (in MMIsar0) MMI_leidt: shows "A ∈ ℝ ⟶ A \<lsq> A" proof - have S1: "A = A" by (rule MMI_eqid) from S1 have S2: "¬ ( A \<ls> A ) ⟶ A = A" by (rule MMI_a1i) from S2 have S3: "A \<ls> A ∨ A = A" by (rule MMI_orri) have S4: "( A ∈ ℝ ∧ A ∈ ℝ ) ⟶ ( A \<lsq> A ⟷ ( A \<ls> A ∨ A = A ) )" by (rule MMI_leloet) from S3 S4 have S5: "( A ∈ ℝ ∧ A ∈ ℝ ) ⟶ A \<lsq> A" by (rule MMI_mpbiri) from S5 show "A ∈ ℝ ⟶ A \<lsq> A" by (rule MMI_anidms) qed lemma (in MMIsar0) MMI_ltnsymt: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ¬ ( ( A = B ∨ B \<ls> A ) ) )" by (rule MMI_axlttri) have S2: "¬ ( ( A = B ∨ B \<ls> A ) ) ⟶ ¬ ( B \<ls> A )" by (rule MMI_pm2_46) from S1 S2 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_syl6bi) qed lemma (in MMIsar0) MMI_ltnsym2t: shows "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ¬ ( ( A \<ls> B ∧ B \<ls> A ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_ltnsymt) have S2: "( A \<ls> B ⟶ ¬ ( B \<ls> A ) ) ⟷ ¬ ( ( A \<ls> B ∧ B \<ls> A ) )" by (rule MMI_imnan) from S1 S2 show "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ¬ ( ( A \<ls> B ∧ B \<ls> A ) )" by (rule MMI_sylib) qed lemma (in MMIsar0) MMI_elxr: shows "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" proof - have S1: "ℝ⇧^{*}= ( ℝ ∪ { \<cpnf> , \<cmnf> } )" by (rule MMI_df_xr) from S1 have S2: "A ∈ ℝ⇧^{*}⟷ A ∈ ( ℝ ∪ { \<cpnf> , \<cmnf> } )" by (rule MMI_eleq2i) have S3: "A ∈ ( ℝ ∪ { \<cpnf> , \<cmnf> } ) ⟷ ( A ∈ ℝ ∨ A ∈ { \<cpnf> , \<cmnf> } )" by (rule MMI_elun) have S4: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) from S4 have S5: "\<cpnf> isASet" by (rule MMI_elisseti) have S6: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) from S6 have S7: "\<cmnf> isASet" by (rule MMI_elisseti) from S5 S7 have S8: "A ∈ { \<cpnf> , \<cmnf> } ⟷ ( A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_elpr2) from S8 have S9: "( A ∈ ℝ ∨ A ∈ { \<cpnf> , \<cmnf> } ) ⟷ ( A ∈ ℝ ∨ ( A = \<cpnf> ∨ A = \<cmnf> ) )" by (rule MMI_orbi2i) have S10: "( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ⟷ ( A ∈ ℝ ∨ ( A = \<cpnf> ∨ A = \<cmnf> ) )" by (rule MMI_3orass) from S9 S10 have S11: "( A ∈ ℝ ∨ A ∈ { \<cpnf> , \<cmnf> } ) ⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_bitr4) from S2 S3 S11 show "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_3bitr) qed lemma (in MMIsar0) MMI_pnfnemnf: shows "\<cpnf> ≠ \<cmnf>" proof - have S1: "¬ ( ℂ ∈ ℂ )" by (rule MMI_eirr) have S2: "ℂ isASet" by (rule MMI_axcnex) from S2 have S3: "ℂ ∈ { ℂ }" by (rule MMI_snid) have S4: "ℂ = { ℂ } ⟶ ( ℂ ∈ ℂ ⟷ ℂ ∈ { ℂ } )" by (rule MMI_eleq2) from S3 S4 have S5: "ℂ = { ℂ } ⟶ ℂ ∈ ℂ" by (rule MMI_mpbiri) from S1 S5 have S6: "¬ ( ℂ = { ℂ } )" by (rule MMI_mto) have S7: "\<cpnf> = ℂ" by (rule MMI_df_pnf) have S8: "\<cmnf> = { ℂ }" by (rule MMI_df_mnf) from S7 S8 have S9: "\<cpnf> = \<cmnf> ⟷ ℂ = { ℂ }" by (rule MMI_eqeq12i) from S6 S9 have S10: "¬ ( \<cpnf> = \<cmnf> )" by (rule MMI_mtbir) have S11: "\<cpnf> ≠ \<cmnf> ⟷ ¬ ( \<cpnf> = \<cmnf> )" by (rule MMI_df_ne) from S10 S11 show "\<cpnf> ≠ \<cmnf>" by (rule MMI_mpbir) qed lemma (in MMIsar0) MMI_renepnft: shows "A ∈ ℝ ⟶ A ≠ \<cpnf>" proof - have S1: "\<cpnf> ∉ ℝ" by (rule MMI_pnfnre) have S2: "\<cpnf> ∉ ℝ ⟷ ¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_df_nel) from S1 S2 have S3: "¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_mpbi) have S4: "( A ∈ ℝ ∧ ¬ ( \<cpnf> ∈ ℝ ) ) ⟶ ¬ ( A = \<cpnf> )" by (rule MMI_nelneq) from S3 S4 have S5: "A ∈ ℝ ⟶ ¬ ( A = \<cpnf> )" by (rule MMI_mpan2) have S6: "A ≠ \<cpnf> ⟷ ¬ ( A = \<cpnf> )" by (rule MMI_df_ne) from S5 S6 show "A ∈ ℝ ⟶ A ≠ \<cpnf>" by (rule MMI_sylibr) qed lemma (in MMIsar0) MMI_renemnft: shows "A ∈ ℝ ⟶ A ≠ \<cmnf>" proof - have S1: "\<cmnf> ∉ ℝ" by (rule MMI_minfnre) have S2: "\<cmnf> ∉ ℝ ⟷ ¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_df_nel) from S1 S2 have S3: "¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_mpbi) have S4: "( A ∈ ℝ ∧ ¬ ( \<cmnf> ∈ ℝ ) ) ⟶ ¬ ( A = \<cmnf> )" by (rule MMI_nelneq) from S3 S4 have S5: "A ∈ ℝ ⟶ ¬ ( A = \<cmnf> )" by (rule MMI_mpan2) have S6: "A ≠ \<cmnf> ⟷ ¬ ( A = \<cmnf> )" by (rule MMI_df_ne) from S5 S6 show "A ∈ ℝ ⟶ A ≠ \<cmnf>" by (rule MMI_sylibr) qed (**********************261-270***********************) lemma (in MMIsar0) MMI_renfdisj: shows "( ℝ ∩ { \<cpnf> , \<cmnf> } ) = 0" proof - have S1: "{ \<cpnf> , \<cmnf> } = ( { \<cpnf> } ∪ { \<cmnf> } )" by (rule MMI_df_pr) from S1 have S2: "( ℝ ∩ { \<cpnf> , \<cmnf> } ) = ( ℝ ∩ ( { \<cpnf> } ∪ { \<cmnf> } ) )" by (rule MMI_ineq2i) have S3: "\<cpnf> = \<cpnf>" by (rule MMI_eqid) have S4: "\<cpnf> ∈ ℝ ⟶ \<cpnf> ≠ \<cpnf>" by (rule MMI_renepnft) have S5: "\<cpnf> ≠ \<cpnf> ⟷ ¬ ( \<cpnf> = \<cpnf> )" by (rule MMI_df_ne) from S4 S5 have S6: "\<cpnf> ∈ ℝ ⟶ ¬ ( \<cpnf> = \<cpnf> )" by (rule MMI_sylib) from S3 S6 have S7: "¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_mt2) have S8: "( ℝ ∩ { \<cpnf> } ) = 0 ⟷ ¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_disjsn) from S7 S8 have S9: "( ℝ ∩ { \<cpnf> } ) = 0" by (rule MMI_mpbir) have S10: "\<cmnf> = \<cmnf>" by (rule MMI_eqid) have S11: "\<cmnf> ∈ ℝ ⟶ \<cmnf> ≠ \<cmnf>" by (rule MMI_renemnft) have S12: "\<cmnf> ≠ \<cmnf> ⟷ ¬ ( \<cmnf> = \<cmnf> )" by (rule MMI_df_ne) from S11 S12 have S13: "\<cmnf> ∈ ℝ ⟶ ¬ ( \<cmnf> = \<cmnf> )" by (rule MMI_sylib) from S10 S13 have S14: "¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_mt2) have S15: "( ℝ ∩ { \<cmnf> } ) = 0 ⟷ ¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_disjsn) from S14 S15 have S16: "( ℝ ∩ { \<cmnf> } ) = 0" by (rule MMI_mpbir) from S9 S16 have S17: "( ℝ ∩ { \<cpnf> } ) = 0 ∧ ( ℝ ∩ { \<cmnf> } ) = 0" by (rule MMI_pm3_2i) have S18: "( ( ℝ ∩ { \<cpnf> } ) = 0 ∧ ( ℝ ∩ { \<cmnf> } ) = 0 ) ⟷ ( ℝ ∩ ( { \<cpnf> } ∪ { \<cmnf> } ) ) = 0" by (rule MMI_undisj2) from S17 S18 have S19: "( ℝ ∩ ( { \<cpnf> } ∪ { \<cmnf> } ) ) = 0" by (rule MMI_mpbi) from S2 S19 show "( ℝ ∩ { \<cpnf> , \<cmnf> } ) = 0" by (rule MMI_eqtr) qed lemma (in MMIsar0) MMI_ssxr: shows "( A ⊆ ℝ⇧^{*}⟶ ( A ⊆ ℝ ∨ \<cpnf> ∈ A ∨ \<cmnf> ∈ A ) )" proof - have S1: "( ( A ∩ { \<cpnf> , \<cmnf> } ) = 0 ⟶ ( A ⊆ ( { \<cpnf> , \<cmnf> } ∪ ℝ ) ⟷ A ⊆ ℝ ) )" by (rule MMI_disjssun) have S2: "ℝ⇧^{*}= ( ℝ ∪ { \<cpnf> , \<cmnf> } )" by (rule MMI_df_xr) have S3: "( ℝ ∪ { \<cpnf> , \<cmnf> } ) = ( { \<cpnf> , \<cmnf> } ∪ ℝ )" by (rule MMI_uncom) from S2 S3 have S4: "ℝ⇧^{*}= ( { \<cpnf> , \<cmnf> } ∪ ℝ )" by (rule MMI_eqtr) from S4 have S5: "( A ⊆ ℝ⇧^{*}⟷ A ⊆ ( { \<cpnf> , \<cmnf> } ∪ ℝ ) )" by (rule MMI_sseq2i) from S1 S5 have S6: "( ( A ∩ { \<cpnf> , \<cmnf> } ) = 0 ⟶ ( A ⊆ ℝ⇧^{*}⟷ A ⊆ ℝ ) )" by (rule MMI_syl5bb) from S6 have S7: "( A ⊆ ℝ⇧^{*}⟶ ( ( A ∩ { \<cpnf> , \<cmnf> } ) = 0 ⟶ A ⊆ ℝ ) )" by (rule MMI_biimpcd) have S8: "( A ∩ { \<cpnf> , \<cmnf> } ) = 0 ⟷ ( ∀ x ∈ A . ¬ ( x ∈ { \<cpnf> , \<cmnf> } ) )" by (rule MMI_disj) from S7 S8 have S9: "( A ⊆ ℝ⇧^{*}⟶ ( ( ∀ x ∈ A . ¬ ( x ∈ { \<cpnf> , \<cmnf> } ) ) ⟶ A ⊆ ℝ ) )" by (rule MMI_syl5ibr) from S9 have S10: "( A ⊆ ℝ⇧^{*}⟶ ( ¬ ( A ⊆ ℝ ) ⟶ ¬ ( ( ∀ x ∈ A . ¬ ( x ∈ { \<cpnf> , \<cmnf> } ) ) ) ) )" by (rule MMI_con3d) have S11: "( ∃ x ∈ A . x ∈ { \<cpnf> , \<cmnf> } ) ⟷ ¬ ( ( ∀ x ∈ A . ¬ ( x ∈ { \<cpnf> , \<cmnf> } ) ) )" by (rule MMI_dfrex2) { fix x have S12: "x isASet" by (rule MMI_visset) from S12 have "x ∈ { \<cpnf> , \<cmnf> } ⟷ ( x = \<cpnf> ∨ x = \<cmnf> )" by (rule MMI_elpr) } then have S13: "∀x. x ∈ { \<cpnf> , \<cmnf> } ⟷ ( x = \<cpnf> ∨ x = \<cmnf> )" by simp from S13 have S14: "( ∃ x ∈ A . x ∈ { \<cpnf> , \<cmnf> } ) ⟷ ( ∃ x ∈ A . ( x = \<cpnf> ∨ x = \<cmnf> ) )" by (rule MMI_rexbii) from S11 S14 have S15: "¬ ( ( ∀ x ∈ A . ¬ ( x ∈ { \<cpnf> , \<cmnf> } ) ) ) ⟷ ( ∃ x ∈ A . ( x = \<cpnf> ∨ x = \<cmnf> ) )" by (rule MMI_bitr3) have S16: "( ∃ x ∈ A . ( x = \<cpnf> ∨ x = \<cmnf> ) ) ⟷ ( ( ∃ x ∈ A . x = \<cpnf> ∨ ( ∃ x ∈ A . x = \<cmnf> ) ) )" by (rule MMI_r19_43) have S17: "( ∃ x ∈ A . x = \<cpnf> ) ⟷ ( ∃ x . ( x ∈ A ∧ x = \<cpnf> ) )" by (rule MMI_df_rex) have S18: "( ∃ x . ( x ∈ A ∧ x = \<cpnf> ) ) ⟷ ( ∃ x . ( x = \<cpnf> ∧ x ∈ A ) )" by (rule MMI_exancom) have S19: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) from S19 have S20: "\<cpnf> isASet" by (rule MMI_elisseti) { fix x have "x = \<cpnf> ⟶ ( x ∈ A ⟷ \<cpnf> ∈ A )" by (rule MMI_eleq1) } then have S21: "∀ x. x = \<cpnf> ⟶ ( x ∈ A ⟷ \<cpnf> ∈ A )" by simp from S20 S21 have S22: "( ∃ x . ( x = \<cpnf> ∧ x ∈ A ) ) ⟷ \<cpnf> ∈ A" by (rule MMI_ceqsexv) from S17 S18 S22 have S23: "( ∃ x ∈ A . x = \<cpnf> ) ⟷ \<cpnf> ∈ A" by (rule MMI_3bitr) have S24: "( ∃ x ∈ A . x = \<cmnf> ) ⟷ ( ∃ x . ( x ∈ A ∧ x = \<cmnf> ) )" by (rule MMI_df_rex) have S25: "( ∃ x . ( x ∈ A ∧ x = \<cmnf> ) ) ⟷ ( ∃ x . ( x = \<cmnf> ∧ x ∈ A ) )" by (rule MMI_exancom) have S26: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) from S26 have S27: "\<cmnf> isASet" by (rule MMI_elisseti) { fix x have "x = \<cmnf> ⟶ ( x ∈ A ⟷ \<cmnf> ∈ A )" by (rule MMI_eleq1) } then have S28: "∀x. x = \<cmnf> ⟶ ( x ∈ A ⟷ \<cmnf> ∈ A )" by simp from S27 S28 have S29: "( ∃ x . ( x = \<cmnf> ∧ x ∈ A ) ) ⟷ \<cmnf> ∈ A" by (rule MMI_ceqsexv) from S24 S25 S29 have S30: "( ∃ x ∈ A . x = \<cmnf> ) ⟷ \<cmnf> ∈ A" by (rule MMI_3bitr) from S23 S30 have S31: "( ( ∃ x ∈ A . x = \<cpnf> ∨ ( ∃ x ∈ A . x = \<cmnf> ) ) ) ⟷ ( \<cpnf> ∈ A ∨ \<cmnf> ∈ A )" by auto (* by (rule MMI_orbi12i), but I cuould'n get it to work *) from S15 S16 S31 have S32: "¬ ( ( ∀ x ∈ A . ¬ ( x ∈ { \<cpnf> , \<cmnf> } ) ) ) ⟷ ( \<cpnf> ∈ A ∨ \<cmnf> ∈ A )" by (rule MMI_3bitr) from S10 S32 have S33: "( A ⊆ ℝ⇧^{*}⟶ ( ¬ ( A ⊆ ℝ ) ⟶ ( \<cpnf> ∈ A ∨ \<cmnf> ∈ A ) ) )" by (rule MMI_syl6ib) from S33 have S34: "( A ⊆ ℝ⇧^{*}⟶ ( A ⊆ ℝ ∨ ( \<cpnf> ∈ A ∨ \<cmnf> ∈ A ) ) )" by (rule MMI_orrd) have S35: "( ( A ⊆ ℝ ∨ \<cpnf> ∈ A ∨ \<cmnf> ∈ A ) ⟷ ( A ⊆ ℝ ∨ ( \<cpnf> ∈ A ∨ \<cmnf> ∈ A ) ) )" by (rule MMI_3orass) from S34 S35 show "( A ⊆ ℝ⇧^{*}⟶ ( A ⊆ ℝ ∨ \<cpnf> ∈ A ∨ \<cmnf> ∈ A ) )" by (rule MMI_sylibr) qed lemma (in MMIsar0) MMI_xrltnrt: shows "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> A )" proof - have S1: "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_elxr) have S2: "A ∈ ℝ ⟶ ¬ ( A \<ls> A )" by (rule MMI_ltnrt) have S3: "\<cpnf> ∉ ℝ" by (rule MMI_pnfnre) have S4: "\<cpnf> ∉ ℝ ⟷ ¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_df_nel) from S3 S4 have S5: "¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_mpbi) from S5 have S6: "¬ ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) )" by (rule MMI_intnan) from S6 have S7: "¬ ( ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cpnf> \<lsr> \<cpnf> ) )" by (rule MMI_intnanr) have S8: "\<cpnf> ≠ \<cmnf>" by (rule MMI_pnfnemnf) have S9: "\<cpnf> ≠ \<cmnf> ⟷ ¬ ( \<cpnf> = \<cmnf> )" by (rule MMI_df_ne) from S8 S9 have S10: "¬ ( \<cpnf> = \<cmnf> )" by (rule MMI_mpbi) from S10 have S11: "¬ ( ( \<cpnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) )" by (rule MMI_intnanr) from S7 S11 have S12: "¬ ( ( ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cpnf> \<lsr> \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) )" by (rule MMI_pm3_2ni) from S5 have S13: "¬ ( \<cpnf> ∈ ℝ )" . from S13 have S14: "¬ ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) )" by (rule MMI_intnanr) from S5 have S15: "¬ ( \<cpnf> ∈ ℝ )" . from S15 have S16: "¬ ( ( \<cpnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) )" by (rule MMI_intnan) from S14 S16 have S17: "¬ ( ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) )" by (rule MMI_pm3_2ni) from S12 S17 have S18: "¬ ( ( ( ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cpnf> \<lsr> \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ) )" by (rule MMI_pm3_2ni) have S19: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S20: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S21: "( \<cpnf> ∈ ℝ⇧^{*}∧ \<cpnf> ∈ ℝ⇧^{*}) ⟶ ( \<cpnf> \<ls> \<cpnf> ⟷ ( ( ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cpnf> \<lsr> \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S19 S20 S21 have S22: "\<cpnf> \<ls> \<cpnf> ⟷ ( ( ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cpnf> \<lsr> \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cpnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) )" by (rule MMI_mp2an) from S18 S22 have S23: "¬ ( \<cpnf> \<ls> \<cpnf> )" by (rule MMI_mtbir) have S24: "( A = \<cpnf> ∧ A = \<cpnf> ) ⟶ ( A \<ls> A ⟷ \<cpnf> \<ls> \<cpnf> )" by (rule MMI_breq12) from S24 have S25: "A = \<cpnf> ⟶ ( A \<ls> A ⟷ \<cpnf> \<ls> \<cpnf> )" by (rule MMI_anidms) from S23 S25 have S26: "A = \<cpnf> ⟶ ¬ ( A \<ls> A )" by (rule MMI_mtbiri) have S27: "\<cmnf> ∉ ℝ" by (rule MMI_minfnre) have S28: "\<cmnf> ∉ ℝ ⟷ ¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_df_nel) from S27 S28 have S29: "¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_mpbi) from S29 have S30: "¬ ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> ∈ ℝ ) )" by (rule MMI_intnan) from S30 have S31: "¬ ( ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cmnf> ) )" by (rule MMI_intnanr) have S32: "\<cpnf> ≠ \<cmnf>" by (rule MMI_pnfnemnf) have S33: "\<cpnf> ≠ \<cmnf> ⟷ \<cmnf> ≠ \<cpnf>" by (rule MMI_necom) from S32 S33 have S34: "\<cmnf> ≠ \<cpnf>" by (rule MMI_mpbi) have S35: "\<cmnf> ≠ \<cpnf> ⟷ ¬ ( \<cmnf> = \<cpnf> )" by (rule MMI_df_ne) from S34 S35 have S36: "¬ ( \<cmnf> = \<cpnf> )" by (rule MMI_mpbi) from S36 have S37: "¬ ( ( \<cmnf> = \<cmnf> ∧ \<cmnf> = \<cpnf> ) )" by (rule MMI_intnan) from S31 S37 have S38: "¬ ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cmnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) )" by (rule MMI_pm3_2ni) from S29 have S39: "¬ ( \<cmnf> ∈ ℝ )" . from S39 have S40: "¬ ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> = \<cpnf> ) )" by (rule MMI_intnanr) from S29 have S41: "¬ ( \<cmnf> ∈ ℝ )" . from S41 have S42: "¬ ( ( \<cmnf> = \<cmnf> ∧ \<cmnf> ∈ ℝ ) )" by (rule MMI_intnan) from S40 S42 have S43: "¬ ( ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) )" by (rule MMI_pm3_2ni) from S38 S43 have S44: "¬ ( ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cmnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) ) )" by (rule MMI_pm3_2ni) have S45: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S46: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S47: "( \<cmnf> ∈ ℝ⇧^{*}∧ \<cmnf> ∈ ℝ⇧^{*}) ⟶ ( \<cmnf> \<ls> \<cmnf> ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cmnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S45 S46 S47 have S48: "\<cmnf> \<ls> \<cmnf> ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cmnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) )" by (rule MMI_mp2an) from S44 S48 have S49: "¬ ( \<cmnf> \<ls> \<cmnf> )" by (rule MMI_mtbir) have S50: "( A = \<cmnf> ∧ A = \<cmnf> ) ⟶ ( A \<ls> A ⟷ \<cmnf> \<ls> \<cmnf> )" by (rule MMI_breq12) from S50 have S51: "A = \<cmnf> ⟶ ( A \<ls> A ⟷ \<cmnf> \<ls> \<cmnf> )" by (rule MMI_anidms) from S49 S51 have S52: "A = \<cmnf> ⟶ ¬ ( A \<ls> A )" by (rule MMI_mtbiri) from S2 S26 S52 have S53: "( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ⟶ ¬ ( A \<ls> A )" by (rule MMI_3jaoi) from S1 S53 show "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> A )" by (rule MMI_sylbi) qed lemma (in MMIsar0) MMI_ltpnft: shows "A ∈ ℝ ⟶ A \<ls> \<cpnf>" proof - have S1: "\<cpnf> = \<cpnf>" by (rule MMI_eqid) from S1 have S2: "A ∈ ℝ ⟶ ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> )" by (rule MMI_jctr) have S3: "( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ⟶ ( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) )" by (rule MMI_orc) have S4: "( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ⟶ ( ( ( ( A ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ A \<lsr> \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) )" by (rule MMI_olc) from S2 S3 S4 have S5: "A ∈ ℝ ⟶ ( ( ( ( A ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ A \<lsr> \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) )" by (rule MMI_3syl) have S6: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S7: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S8: "( A ∈ ℝ⇧^{*}∧ \<cpnf> ∈ ℝ⇧^{*}) ⟶ ( A \<ls> \<cpnf> ⟷ ( ( ( ( A ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ A \<lsr> \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S7 S8 have S9: "A ∈ ℝ⇧^{*}⟶ ( A \<ls> \<cpnf> ⟷ ( ( ( ( A ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ A \<lsr> \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ) )" by (rule MMI_mpan2) from S6 S9 have S10: "A ∈ ℝ ⟶ ( A \<ls> \<cpnf> ⟷ ( ( ( ( A ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ A \<lsr> \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ) )" by (rule MMI_syl) from S5 S10 show "A ∈ ℝ ⟶ A \<ls> \<cpnf>" by (rule MMI_mpbird) qed lemma (in MMIsar0) MMI_mnfltt: shows "A ∈ ℝ ⟶ \<cmnf> \<ls> A" proof - have S1: "\<cmnf> = \<cmnf>" by (rule MMI_eqid) from S1 have S2: "A ∈ ℝ ⟶ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ )" by (rule MMI_jctl) have S3: "( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ⟶ ( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) )" by (rule MMI_olc) have S4: "( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ) ⟶ ( ( ( ( \<cmnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cmnf> \<lsr> A ) ∨ ( \<cmnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ) )" by (rule MMI_olc) from S2 S3 S4 have S5: "A ∈ ℝ ⟶ ( ( ( ( \<cmnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cmnf> \<lsr> A ) ∨ ( \<cmnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ) )" by (rule MMI_3syl) have S6: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S7: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S8: "( \<cmnf> ∈ ℝ⇧^{*}∧ A ∈ ℝ⇧^{*}) ⟶ ( \<cmnf> \<ls> A ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cmnf> \<lsr> A ) ∨ ( \<cmnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S7 S8 have S9: "A ∈ ℝ⇧^{*}⟶ ( \<cmnf> \<ls> A ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cmnf> \<lsr> A ) ∨ ( \<cmnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ) ) )" by (rule MMI_mpan) from S6 S9 have S10: "A ∈ ℝ ⟶ ( \<cmnf> \<ls> A ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cmnf> \<lsr> A ) ∨ ( \<cmnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ A ∈ ℝ ) ) ) )" by (rule MMI_syl) from S5 S10 show "A ∈ ℝ ⟶ \<cmnf> \<ls> A" by (rule MMI_mpbird) qed lemma (in MMIsar0) MMI_mnfltpnf: shows "\<cmnf> \<ls> \<cpnf>" proof - have S1: "\<cmnf> = \<cmnf>" by (rule MMI_eqid) have S2: "\<cpnf> = \<cpnf>" by (rule MMI_eqid) have S3: "( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ⟶ ( ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) )" by (rule MMI_olc) from S1 S2 S3 have S4: "( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> )" by (rule MMI_mp2an) have S5: "( ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ⟶ ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) )" by (rule MMI_orc) from S4 S5 have S6: "( ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) )" by (rule MMI_ax_mp) have S7: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S8: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S9: "( \<cmnf> ∈ ℝ⇧^{*}∧ \<cpnf> ∈ ℝ⇧^{*}) ⟶ ( \<cmnf> \<ls> \<cpnf> ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S7 S8 S9 have S10: "\<cmnf> \<ls> \<cpnf> ⟷ ( ( ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> ∈ ℝ ) ∧ \<cmnf> \<lsr> \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> = \<cpnf> ) ) ∨ ( ( \<cmnf> ∈ ℝ ∧ \<cpnf> = \<cpnf> ) ∨ ( \<cmnf> = \<cmnf> ∧ \<cpnf> ∈ ℝ ) ) )" by (rule MMI_mp2an) from S6 S10 show "\<cmnf> \<ls> \<cpnf>" by (rule MMI_mpbir) qed lemma (in MMIsar0) MMI_mnfltxrt: shows "( A ∈ ℝ ∨ A = \<cpnf> ) ⟶ \<cmnf> \<ls> A" proof - have S1: "A ∈ ℝ ⟶ \<cmnf> \<ls> A" by (rule MMI_mnfltt) have S2: "\<cmnf> \<ls> \<cpnf>" by (rule MMI_mnfltpnf) have S3: "A = \<cpnf> ⟶ ( \<cmnf> \<ls> A ⟷ \<cmnf> \<ls> \<cpnf> )" by (rule MMI_breq2) from S2 S3 have S4: "A = \<cpnf> ⟶ \<cmnf> \<ls> A" by (rule MMI_mpbiri) from S1 S4 show "( A ∈ ℝ ∨ A = \<cpnf> ) ⟶ \<cmnf> \<ls> A" by (rule MMI_jaoi) qed lemma (in MMIsar0) MMI_pnfnltt: shows "A ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> A )" proof - have S1: "\<cpnf> ∉ ℝ" by (rule MMI_pnfnre) have S2: "\<cpnf> ∉ ℝ ⟷ ¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_df_nel) from S1 S2 have S3: "¬ ( \<cpnf> ∈ ℝ )" by (rule MMI_mpbi) from S3 have S4: "¬ ( ( \<cpnf> ∈ ℝ ∧ A ∈ ℝ ) )" by (rule MMI_intnanr) from S4 have S5: "¬ ( ( ( \<cpnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cpnf> \<lsr> A ) )" by (rule MMI_intnanr) have S6: "\<cpnf> ≠ \<cmnf>" by (rule MMI_pnfnemnf) have S7: "\<cpnf> ≠ \<cmnf> ⟷ ¬ ( \<cpnf> = \<cmnf> )" by (rule MMI_df_ne) from S6 S7 have S8: "¬ ( \<cpnf> = \<cmnf> )" by (rule MMI_mpbi) from S8 have S9: "¬ ( ( \<cpnf> = \<cmnf> ∧ A = \<cpnf> ) )" by (rule MMI_intnanr) from S5 S9 have S10: "¬ ( ( ( ( \<cpnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cpnf> \<lsr> A ) ∨ ( \<cpnf> = \<cmnf> ∧ A = \<cpnf> ) ) )" by (rule MMI_pm3_2ni) from S3 have S11: "¬ ( \<cpnf> ∈ ℝ )" . from S11 have S12: "¬ ( ( \<cpnf> ∈ ℝ ∧ A = \<cpnf> ) )" by (rule MMI_intnanr) from S8 have S13: "¬ ( \<cpnf> = \<cmnf> )" . from S13 have S14: "¬ ( ( \<cpnf> = \<cmnf> ∧ A ∈ ℝ ) )" by (rule MMI_intnanr) from S12 S14 have S15: "¬ ( ( ( \<cpnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ A ∈ ℝ ) ) )" by (rule MMI_pm3_2ni) from S10 S15 have S16: "¬ ( ( ( ( ( \<cpnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cpnf> \<lsr> A ) ∨ ( \<cpnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cpnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ A ∈ ℝ ) ) ) )" by (rule MMI_pm3_2ni) have S17: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S18: "( \<cpnf> ∈ ℝ⇧^{*}∧ A ∈ ℝ⇧^{*}) ⟶ ( \<cpnf> \<ls> A ⟷ ( ( ( ( \<cpnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cpnf> \<lsr> A ) ∨ ( \<cpnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cpnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ A ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S17 S18 have S19: "A ∈ ℝ⇧^{*}⟶ ( \<cpnf> \<ls> A ⟷ ( ( ( ( \<cpnf> ∈ ℝ ∧ A ∈ ℝ ) ∧ \<cpnf> \<lsr> A ) ∨ ( \<cpnf> = \<cmnf> ∧ A = \<cpnf> ) ) ∨ ( ( \<cpnf> ∈ ℝ ∧ A = \<cpnf> ) ∨ ( \<cpnf> = \<cmnf> ∧ A ∈ ℝ ) ) ) )" by (rule MMI_mpan) from S16 S19 show "A ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> A )" by (rule MMI_mtbiri) qed lemma (in MMIsar0) MMI_nltmnft: shows "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> \<cmnf> )" proof - have S1: "\<cmnf> ∉ ℝ" by (rule MMI_minfnre) have S2: "\<cmnf> ∉ ℝ ⟷ ¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_df_nel) from S1 S2 have S3: "¬ ( \<cmnf> ∈ ℝ )" by (rule MMI_mpbi) from S3 have S4: "¬ ( ( A ∈ ℝ ∧ \<cmnf> ∈ ℝ ) )" by (rule MMI_intnan) from S4 have S5: "¬ ( ( ( A ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ A \<lsr> \<cmnf> ) )" by (rule MMI_intnanr) have S6: "\<cpnf> ≠ \<cmnf>" by (rule MMI_pnfnemnf) have S7: "\<cpnf> ≠ \<cmnf> ⟷ \<cmnf> ≠ \<cpnf>" by (rule MMI_necom) from S6 S7 have S8: "\<cmnf> ≠ \<cpnf>" by (rule MMI_mpbi) have S9: "\<cmnf> ≠ \<cpnf> ⟷ ¬ ( \<cmnf> = \<cpnf> )" by (rule MMI_df_ne) from S8 S9 have S10: "¬ ( \<cmnf> = \<cpnf> )" by (rule MMI_mpbi) from S10 have S11: "¬ ( ( A = \<cmnf> ∧ \<cmnf> = \<cpnf> ) )" by (rule MMI_intnan) from S5 S11 have S12: "¬ ( ( ( ( A ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ A \<lsr> \<cmnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) )" by (rule MMI_pm3_2ni) from S10 have S13: "¬ ( \<cmnf> = \<cpnf> )" . from S13 have S14: "¬ ( ( A ∈ ℝ ∧ \<cmnf> = \<cpnf> ) )" by (rule MMI_intnan) from S3 have S15: "¬ ( \<cmnf> ∈ ℝ )" . from S15 have S16: "¬ ( ( A = \<cmnf> ∧ \<cmnf> ∈ ℝ ) )" by (rule MMI_intnan) from S14 S16 have S17: "¬ ( ( ( A ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) )" by (rule MMI_pm3_2ni) from S12 S17 have S18: "¬ ( ( ( ( ( A ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ A \<lsr> \<cmnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) ) )" by (rule MMI_pm3_2ni) have S19: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S20: "( A ∈ ℝ⇧^{*}∧ \<cmnf> ∈ ℝ⇧^{*}) ⟶ ( A \<ls> \<cmnf> ⟷ ( ( ( ( A ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ A \<lsr> \<cmnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) ) )" by (rule MMI_ltxrt) from S19 S20 have S21: "A ∈ ℝ⇧^{*}⟶ ( A \<ls> \<cmnf> ⟷ ( ( ( ( A ∈ ℝ ∧ \<cmnf> ∈ ℝ ) ∧ A \<lsr> \<cmnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> = \<cpnf> ) ) ∨ ( ( A ∈ ℝ ∧ \<cmnf> = \<cpnf> ) ∨ ( A = \<cmnf> ∧ \<cmnf> ∈ ℝ ) ) ) )" by (rule MMI_mpan2) from S18 S21 show "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_mtbiri) qed lemma (in MMIsar0) MMI_pnfget: shows "A ∈ ℝ⇧^{*}⟶ A \<lsq> \<cpnf>" proof - have S1: "A ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> A )" by (rule MMI_pnfnltt) have S2: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S3: "( A ∈ ℝ⇧^{*}∧ \<cpnf> ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> \<cpnf> ⟷ ¬ ( \<cpnf> \<ls> A ) )" by (rule MMI_xrlenltt) from S2 S3 have S4: "A ∈ ℝ⇧^{*}⟶ ( A \<lsq> \<cpnf> ⟷ ¬ ( \<cpnf> \<ls> A ) )" by (rule MMI_mpan2) from S1 S4 show "A ∈ ℝ⇧^{*}⟶ A \<lsq> \<cpnf>" by (rule MMI_mpbird) qed (***********271-280*********************************) lemma (in MMIsar0) MMI_mnflet: shows "A ∈ ℝ⇧^{*}⟶ \<cmnf> \<lsq> A" proof - have S1: "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_nltmnft) have S2: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S3: "( \<cmnf> ∈ ℝ⇧^{*}∧ A ∈ ℝ⇧^{*}) ⟶ ( \<cmnf> \<lsq> A ⟷ ¬ ( A \<ls> \<cmnf> ) )" by (rule MMI_xrlenltt) from S2 S3 have S4: "A ∈ ℝ⇧^{*}⟶ ( \<cmnf> \<lsq> A ⟷ ¬ ( A \<ls> \<cmnf> ) )" by (rule MMI_mpan) from S1 S4 show "A ∈ ℝ⇧^{*}⟶ \<cmnf> \<lsq> A" by (rule MMI_mpbird) qed lemma (in MMIsar0) MMI_xrltnsymt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_ltnsymt) have S2: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S3: "A ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> A )" by (rule MMI_pnfnltt) from S2 S3 have S4: "A ∈ ℝ ⟶ ¬ ( \<cpnf> \<ls> A )" by (rule MMI_syl) from S4 have S5: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ ¬ ( \<cpnf> \<ls> A )" by (rule MMI_adantr) have S6: "B = \<cpnf> ⟶ ( B \<ls> A ⟷ \<cpnf> \<ls> A )" by (rule MMI_breq1) from S6 have S7: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ ( B \<ls> A ⟷ \<cpnf> \<ls> A )" by (rule MMI_adantl) from S5 S7 have S8: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ ¬ ( B \<ls> A )" by (rule MMI_mtbird) from S8 have S9: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_a1d) from S2 have S10: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" . have S11: "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_nltmnft) from S10 S11 have S12: "A ∈ ℝ ⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_syl) from S12 have S13: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_adantr) have S14: "B = \<cmnf> ⟶ ( A \<ls> B ⟷ A \<ls> \<cmnf> )" by (rule MMI_breq2) from S14 have S15: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟷ A \<ls> \<cmnf> )" by (rule MMI_adantl) from S13 S15 have S16: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ¬ ( A \<ls> B )" by (rule MMI_mtbird) from S16 have S17: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_pm2_21d) from S1 S9 S17 have S18: "( A ∈ ℝ ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_3jaodan) have S19: "B ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> B )" by (rule MMI_pnfnltt) from S19 have S20: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ¬ ( \<cpnf> \<ls> B )" by (rule MMI_adantl) have S21: "A = \<cpnf> ⟶ ( A \<ls> B ⟷ \<cpnf> \<ls> B )" by (rule MMI_breq1) from S21 have S22: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟷ \<cpnf> \<ls> B )" by (rule MMI_adantr) from S20 S22 have S23: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ¬ ( A \<ls> B )" by (rule MMI_mtbird) from S23 have S24: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_pm2_21d) have S25: "B ∈ ℝ⇧^{*}⟷ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> )" by (rule MMI_elxr) from S24 S25 have S26: "( A = \<cpnf> ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_sylan2br) have S27: "B ∈ ℝ ⟶ B ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S28: "B ∈ ℝ⇧^{*}⟶ ¬ ( B \<ls> \<cmnf> )" by (rule MMI_nltmnft) from S27 S28 have S29: "B ∈ ℝ ⟶ ¬ ( B \<ls> \<cmnf> )" by (rule MMI_syl) from S29 have S30: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ ¬ ( B \<ls> \<cmnf> )" by (rule MMI_adantl) have S31: "A = \<cmnf> ⟶ ( B \<ls> A ⟷ B \<ls> \<cmnf> )" by (rule MMI_breq2) from S31 have S32: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ ( B \<ls> A ⟷ B \<ls> \<cmnf> )" by (rule MMI_adantr) from S30 S32 have S33: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ ¬ ( B \<ls> A )" by (rule MMI_mtbird) from S33 have S34: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_a1d) have S35: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S36: "\<cmnf> ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> \<cmnf> )" by (rule MMI_pnfnltt) from S35 S36 have S37: "¬ ( \<cpnf> \<ls> \<cmnf> )" by (rule MMI_ax_mp) have S38: "( B = \<cpnf> ∧ A = \<cmnf> ) ⟶ ( B \<ls> A ⟷ \<cpnf> \<ls> \<cmnf> )" by (rule MMI_breq12) from S37 S38 have S39: "( B = \<cpnf> ∧ A = \<cmnf> ) ⟶ ¬ ( B \<ls> A )" by (rule MMI_mtbiri) from S39 have S40: "( A = \<cmnf> ∧ B = \<cpnf> ) ⟶ ¬ ( B \<ls> A )" by (rule MMI_ancoms) from S40 have S41: "( A = \<cmnf> ∧ B = \<cpnf> ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_a1d) have S42: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S43: "\<cmnf> ∈ ℝ⇧^{*}⟶ ¬ ( \<cmnf> \<ls> \<cmnf> )" by (rule MMI_xrltnrt) from S42 S43 have S44: "¬ ( \<cmnf> \<ls> \<cmnf> )" by (rule MMI_ax_mp) have S45: "( A = \<cmnf> ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟷ \<cmnf> \<ls> \<cmnf> )" by (rule MMI_breq12) from S44 S45 have S46: "( A = \<cmnf> ∧ B = \<cmnf> ) ⟶ ¬ ( A \<ls> B )" by (rule MMI_mtbiri) from S46 have S47: "( A = \<cmnf> ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_pm2_21d) from S34 S41 S47 have S48: "( A = \<cmnf> ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_3jaodan) from S18 S26 S48 have S49: "( ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_3jaoian) have S50: "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_elxr) from S25 have S51: "B ∈ ℝ⇧^{*}⟷ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> )" . from S49 S50 S51 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_syl2anb) qed lemma (in MMIsar0) MMI_xrlttrit: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟷ ¬ ( ( A = B ∨ B \<ls> A ) ) )" proof - have S1: "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> A )" by (rule MMI_xrltnrt) from S1 have S2: "( A ∈ ℝ⇧^{*}∧ A = B ) ⟶ ¬ ( A \<ls> A )" by (rule MMI_adantr) have S3: "A = B ⟶ ( A \<ls> A ⟷ A \<ls> B )" by (rule MMI_breq2) from S3 have S4: "( A ∈ ℝ⇧^{*}∧ A = B ) ⟶ ( A \<ls> A ⟷ A \<ls> B )" by (rule MMI_adantl) from S2 S4 have S5: "( A ∈ ℝ⇧^{*}∧ A = B ) ⟶ ¬ ( A \<ls> B )" by (rule MMI_mtbid) from S5 have S6: "A ∈ ℝ⇧^{*}⟶ ( A = B ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_ex) from S6 have S7: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A = B ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_adantr) have S8: "( B ∈ ℝ⇧^{*}∧ A ∈ ℝ⇧^{*}) ⟶ ( B \<ls> A ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_xrltnsymt) from S8 have S9: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( B \<ls> A ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_ancoms) from S7 S9 have S10: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ( A = B ∨ B \<ls> A ) ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_jaod) have S11: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ¬ ( ( A = B ∨ B \<ls> A ) ) )" by (rule MMI_axlttri) from S11 have S12: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( ( A = B ∨ B \<ls> A ) ) ⟶ A \<ls> B )" by (rule MMI_biimprd) from S12 have S13: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_con1d) have S14: "A ∈ ℝ ⟶ A \<ls> \<cpnf>" by (rule MMI_ltpnft) from S14 have S15: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ A \<ls> \<cpnf>" by (rule MMI_adantr) have S16: "B = \<cpnf> ⟶ ( A \<ls> B ⟷ A \<ls> \<cpnf> )" by (rule MMI_breq2) from S16 have S17: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ ( A \<ls> B ⟷ A \<ls> \<cpnf> )" by (rule MMI_adantl) from S15 S17 have S18: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ A \<ls> B" by (rule MMI_mpbird) from S18 have S19: "( A ∈ ℝ ∧ B = \<cpnf> ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_pm2_21nd) have S20: "A ∈ ℝ ⟶ \<cmnf> \<ls> A" by (rule MMI_mnfltt) from S20 have S21: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ \<cmnf> \<ls> A" by (rule MMI_adantr) have S22: "B = \<cmnf> ⟶ ( B \<ls> A ⟷ \<cmnf> \<ls> A )" by (rule MMI_breq1) from S22 have S23: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( B \<ls> A ⟷ \<cmnf> \<ls> A )" by (rule MMI_adantl) from S21 S23 have S24: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ B \<ls> A" by (rule MMI_mpbird) have S25: "B \<ls> A ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_olc) from S24 S25 have S26: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_syl) from S26 have S27: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_a1d) from S13 S19 S27 have S28: "( A ∈ ℝ ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_3jaodan) have S29: "B ∈ ℝ ⟶ B \<ls> \<cpnf>" by (rule MMI_ltpnft) from S29 have S30: "( A = \<cpnf> ∧ B ∈ ℝ ) ⟶ B \<ls> \<cpnf>" by (rule MMI_adantl) have S31: "A = \<cpnf> ⟶ ( B \<ls> A ⟷ B \<ls> \<cpnf> )" by (rule MMI_breq2) from S31 have S32: "( A = \<cpnf> ∧ B ∈ ℝ ) ⟶ ( B \<ls> A ⟷ B \<ls> \<cpnf> )" by (rule MMI_adantr) from S30 S32 have S33: "( A = \<cpnf> ∧ B ∈ ℝ ) ⟶ B \<ls> A" by (rule MMI_mpbird) from S25 have S34: "B \<ls> A ⟶ ( A = B ∨ B \<ls> A )" . from S33 S34 have S35: "( A = \<cpnf> ∧ B ∈ ℝ ) ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_syl) from S35 have S36: "( A = \<cpnf> ∧ B ∈ ℝ ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_a1d) have S37: "( A = \<cpnf> ∧ B = \<cpnf> ) ⟶ A = B" by (rule MMI_eqtr3t) have S38: "A = B ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_orc) from S37 S38 have S39: "( A = \<cpnf> ∧ B = \<cpnf> ) ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_syl) from S39 have S40: "( A = \<cpnf> ∧ B = \<cpnf> ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_a1d) have S41: "\<cmnf> \<ls> \<cpnf>" by (rule MMI_mnfltpnf) have S42: "( B = \<cmnf> ∧ A = \<cpnf> ) ⟶ ( B \<ls> A ⟷ \<cmnf> \<ls> \<cpnf> )" by (rule MMI_breq12) from S41 S42 have S43: "( B = \<cmnf> ∧ A = \<cpnf> ) ⟶ B \<ls> A" by (rule MMI_mpbiri) from S43 have S44: "( A = \<cpnf> ∧ B = \<cmnf> ) ⟶ B \<ls> A" by (rule MMI_ancoms) from S25 have S45: "B \<ls> A ⟶ ( A = B ∨ B \<ls> A )" . from S44 S45 have S46: "( A = \<cpnf> ∧ B = \<cmnf> ) ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_syl) from S46 have S47: "( A = \<cpnf> ∧ B = \<cmnf> ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_a1d) from S36 S40 S47 have S48: "( A = \<cpnf> ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_3jaodan) have S49: "B ∈ ℝ ⟶ \<cmnf> \<ls> B" by (rule MMI_mnfltt) from S49 have S50: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ \<cmnf> \<ls> B" by (rule MMI_adantl) have S51: "A = \<cmnf> ⟶ ( A \<ls> B ⟷ \<cmnf> \<ls> B )" by (rule MMI_breq1) from S51 have S52: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ \<cmnf> \<ls> B )" by (rule MMI_adantr) from S50 S52 have S53: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ A \<ls> B" by (rule MMI_mpbird) from S53 have S54: "( A = \<cmnf> ∧ B ∈ ℝ ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_pm2_21nd) have S55: "\<cmnf> \<ls> \<cpnf>" by (rule MMI_mnfltpnf) have S56: "( A = \<cmnf> ∧ B = \<cpnf> ) ⟶ ( A \<ls> B ⟷ \<cmnf> \<ls> \<cpnf> )" by (rule MMI_breq12) from S55 S56 have S57: "( A = \<cmnf> ∧ B = \<cpnf> ) ⟶ A \<ls> B" by (rule MMI_mpbiri) from S57 have S58: "( A = \<cmnf> ∧ B = \<cpnf> ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_pm2_21nd) have S59: "( A = \<cmnf> ∧ B = \<cmnf> ) ⟶ A = B" by (rule MMI_eqtr3t) from S38 have S60: "A = B ⟶ ( A = B ∨ B \<ls> A )" . from S59 S60 have S61: "( A = \<cmnf> ∧ B = \<cmnf> ) ⟶ ( A = B ∨ B \<ls> A )" by (rule MMI_syl) from S61 have S62: "( A = \<cmnf> ∧ B = \<cmnf> ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_a1d) from S54 S58 S62 have S63: "( A = \<cmnf> ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_3jaodan) from S28 S48 S63 have S64: "( ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_3jaoian) have S65: "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_elxr) have S66: "B ∈ ℝ⇧^{*}⟷ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> )" by (rule MMI_elxr) from S64 S65 S66 have S67: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ¬ ( A \<ls> B ) ⟶ ( A = B ∨ B \<ls> A ) )" by (rule MMI_syl2anb) from S10 S67 have S68: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ( A = B ∨ B \<ls> A ) ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_impbid) from S68 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟷ ¬ ( ( A = B ∨ B \<ls> A ) ) )" by (rule MMI_con2bid) qed lemma (in MMIsar0) MMI_xrlttrt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" proof - have S1: "( A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_axlttrn) from S1 have S2: "( ( A ∈ ℝ ∧ B ∈ ℝ ) ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3expa) from S2 have S3: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ B ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_an1rs) have S4: "C ∈ ℝ ⟶ C ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S5: "C ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> C )" by (rule MMI_pnfnltt) from S4 S5 have S6: "C ∈ ℝ ⟶ ¬ ( \<cpnf> \<ls> C )" by (rule MMI_syl) from S6 have S7: "( C ∈ ℝ ∧ B = \<cpnf> ) ⟶ ¬ ( \<cpnf> \<ls> C )" by (rule MMI_adantr) have S8: "B = \<cpnf> ⟶ ( B \<ls> C ⟷ \<cpnf> \<ls> C )" by (rule MMI_breq1) from S8 have S9: "( C ∈ ℝ ∧ B = \<cpnf> ) ⟶ ( B \<ls> C ⟷ \<cpnf> \<ls> C )" by (rule MMI_adantl) from S7 S9 have S10: "( C ∈ ℝ ∧ B = \<cpnf> ) ⟶ ¬ ( B \<ls> C )" by (rule MMI_mtbird) from S10 have S11: "( C ∈ ℝ ∧ B = \<cpnf> ) ⟶ ( B \<ls> C ⟶ A \<ls> C )" by (rule MMI_pm2_21d) from S11 have S12: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ B = \<cpnf> ) ⟶ ( B \<ls> C ⟶ A \<ls> C )" by (rule MMI_adantll) from S12 have S13: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ B = \<cpnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantld) have S14: "A ∈ ℝ ⟶ A ∈ ℝ⇧^{*}" by (rule MMI_rexrt) have S15: "A ∈ ℝ⇧^{*}⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_nltmnft) from S14 S15 have S16: "A ∈ ℝ ⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_syl) from S16 have S17: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ¬ ( A \<ls> \<cmnf> )" by (rule MMI_adantr) have S18: "B = \<cmnf> ⟶ ( A \<ls> B ⟷ A \<ls> \<cmnf> )" by (rule MMI_breq2) from S18 have S19: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟷ A \<ls> \<cmnf> )" by (rule MMI_adantl) from S17 S19 have S20: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ¬ ( A \<ls> B )" by (rule MMI_mtbird) from S20 have S21: "( A ∈ ℝ ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟶ A \<ls> C )" by (rule MMI_pm2_21d) from S21 have S22: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ B = \<cmnf> ) ⟶ ( A \<ls> B ⟶ A \<ls> C )" by (rule MMI_adantlr) from S22 have S23: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ B = \<cmnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantrd) from S3 S13 S23 have S24: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3jaodan) have S25: "B ∈ ℝ⇧^{*}⟷ ( B ∈ ℝ ∨ B = \<cpnf> ∨ B = \<cmnf> )" by (rule MMI_elxr) from S24 S25 have S26: "( ( A ∈ ℝ ∧ C ∈ ℝ ) ∧ B ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_sylan2b) from S26 have S27: "( ( A ∈ ℝ ∧ B ∈ ℝ⇧^{*}) ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_an1rs) have S28: "A ∈ ℝ ⟶ A \<ls> \<cpnf>" by (rule MMI_ltpnft) from S28 have S29: "( A ∈ ℝ ∧ C = \<cpnf> ) ⟶ A \<ls> \<cpnf>" by (rule MMI_adantr) have S30: "C = \<cpnf> ⟶ ( A \<ls> C ⟷ A \<ls> \<cpnf> )" by (rule MMI_breq2) from S30 have S31: "( A ∈ ℝ ∧ C = \<cpnf> ) ⟶ ( A \<ls> C ⟷ A \<ls> \<cpnf> )" by (rule MMI_adantl) from S29 S31 have S32: "( A ∈ ℝ ∧ C = \<cpnf> ) ⟶ A \<ls> C" by (rule MMI_mpbird) from S32 have S33: "( ( A ∈ ℝ ∧ B ∈ ℝ⇧^{*}) ∧ C = \<cpnf> ) ⟶ A \<ls> C" by (rule MMI_adantlr) from S33 have S34: "( ( A ∈ ℝ ∧ B ∈ ℝ⇧^{*}) ∧ C = \<cpnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_a1d) have S35: "B ∈ ℝ⇧^{*}⟶ ¬ ( B \<ls> \<cmnf> )" by (rule MMI_nltmnft) from S35 have S36: "( B ∈ ℝ⇧^{*}∧ C = \<cmnf> ) ⟶ ¬ ( B \<ls> \<cmnf> )" by (rule MMI_adantr) have S37: "C = \<cmnf> ⟶ ( B \<ls> C ⟷ B \<ls> \<cmnf> )" by (rule MMI_breq2) from S37 have S38: "( B ∈ ℝ⇧^{*}∧ C = \<cmnf> ) ⟶ ( B \<ls> C ⟷ B \<ls> \<cmnf> )" by (rule MMI_adantl) from S36 S38 have S39: "( B ∈ ℝ⇧^{*}∧ C = \<cmnf> ) ⟶ ¬ ( B \<ls> C )" by (rule MMI_mtbird) from S39 have S40: "( B ∈ ℝ⇧^{*}∧ C = \<cmnf> ) ⟶ ( B \<ls> C ⟶ A \<ls> C )" by (rule MMI_pm2_21d) from S40 have S41: "( B ∈ ℝ⇧^{*}∧ C = \<cmnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantld) from S41 have S42: "( ( A ∈ ℝ ∧ B ∈ ℝ⇧^{*}) ∧ C = \<cmnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantll) from S27 S34 S42 have S43: "( ( A ∈ ℝ ∧ B ∈ ℝ⇧^{*}) ∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3jaodan) from S43 have S44: "( A ∈ ℝ ∧ ( B ∈ ℝ⇧^{*}∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_anasss) have S45: "B ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> B )" by (rule MMI_pnfnltt) from S45 have S46: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ¬ ( \<cpnf> \<ls> B )" by (rule MMI_adantl) have S47: "A = \<cpnf> ⟶ ( A \<ls> B ⟷ \<cpnf> \<ls> B )" by (rule MMI_breq1) from S47 have S48: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟷ \<cpnf> \<ls> B )" by (rule MMI_adantr) from S46 S48 have S49: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ¬ ( A \<ls> B )" by (rule MMI_mtbird) from S49 have S50: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ A \<ls> C )" by (rule MMI_pm2_21d) from S50 have S51: "( A = \<cpnf> ∧ B ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantrd) from S51 have S52: "( A = \<cpnf> ∧ ( B ∈ ℝ⇧^{*}∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantrr) have S53: "C ∈ ℝ ⟶ \<cmnf> \<ls> C" by (rule MMI_mnfltt) from S53 have S54: "( A = \<cmnf> ∧ C ∈ ℝ ) ⟶ \<cmnf> \<ls> C" by (rule MMI_adantl) have S55: "A = \<cmnf> ⟶ ( A \<ls> C ⟷ \<cmnf> \<ls> C )" by (rule MMI_breq1) from S55 have S56: "( A = \<cmnf> ∧ C ∈ ℝ ) ⟶ ( A \<ls> C ⟷ \<cmnf> \<ls> C )" by (rule MMI_adantr) from S54 S56 have S57: "( A = \<cmnf> ∧ C ∈ ℝ ) ⟶ A \<ls> C" by (rule MMI_mpbird) from S57 have S58: "( A = \<cmnf> ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_a1d) from S58 have S59: "( ( A = \<cmnf> ∧ B ∈ ℝ⇧^{*}) ∧ C ∈ ℝ ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantlr) have S60: "\<cmnf> \<ls> \<cpnf>" by (rule MMI_mnfltpnf) have S61: "( A = \<cmnf> ∧ C = \<cpnf> ) ⟶ ( A \<ls> C ⟷ \<cmnf> \<ls> \<cpnf> )" by (rule MMI_breq12) from S60 S61 have S62: "( A = \<cmnf> ∧ C = \<cpnf> ) ⟶ A \<ls> C" by (rule MMI_mpbiri) from S62 have S63: "( A = \<cmnf> ∧ C = \<cpnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_a1d) from S63 have S64: "( ( A = \<cmnf> ∧ B ∈ ℝ⇧^{*}) ∧ C = \<cpnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantlr) from S41 have S65: "( B ∈ ℝ⇧^{*}∧ C = \<cmnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" . from S65 have S66: "( ( A = \<cmnf> ∧ B ∈ ℝ⇧^{*}) ∧ C = \<cmnf> ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_adantll) from S59 S64 S66 have S67: "( ( A = \<cmnf> ∧ B ∈ ℝ⇧^{*}) ∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3jaodan) from S67 have S68: "( A = \<cmnf> ∧ ( B ∈ ℝ⇧^{*}∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_anasss) from S44 S52 S68 have S69: "( ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ∧ ( B ∈ ℝ⇧^{*}∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3jaoian) from S69 have S70: "( ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ∧ B ∈ ℝ⇧^{*}∧ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> ) ) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_3impb) have S71: "C ∈ ℝ⇧^{*}⟷ ( C ∈ ℝ ∨ C = \<cpnf> ∨ C = \<cmnf> )" by (rule MMI_elxr) from S70 S71 have S72: "( ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_syl3an3b) have S73: "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_elxr) from S72 S73 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_syl3an1b) qed lemma (in MMIsar0) MMI_xrltso: shows "\<cltrrset> Orders ℝ⇧^{*}" proof - { fix x y z have S1: "( x ∈ ℝ⇧^{*}∧ y ∈ ℝ⇧^{*}) ⟶ ( x \<ls> y ⟷ ¬ ( ( x = y ∨ y \<ls> x ) ) )" by (rule MMI_xrlttrit) from S1 have S2: "( x ∈ ℝ⇧^{*}∧ y ∈ ℝ⇧^{*}∧ z ∈ ℝ⇧^{*}) ⟶ ( x \<ls> y ⟷ ¬ ( ( x = y ∨ y \<ls> x ) ) )" by (rule MMI_3adant3) have S3: "( x ∈ ℝ⇧^{*}∧ y ∈ ℝ⇧^{*}∧ z ∈ ℝ⇧^{*}) ⟶ ( ( x \<ls> y ∧ y \<ls> z ) ⟶ x \<ls> z )" by (rule MMI_xrlttrt) from S2 S3 have S4: "( x ∈ ℝ⇧^{*}∧ y ∈ ℝ⇧^{*}∧ z ∈ ℝ⇧^{*}) ⟶ ( ( x \<ls> y ⟷ ¬ ( ( x = y ∨ y \<ls> x ) ) ) ∧ ( ( x \<ls> y ∧ y \<ls> z ) ⟶ x \<ls> z ) )" by (rule MMI_jca) then have "x ∈ ℝ⇧^{*}∧ y ∈ ℝ⇧^{*}∧ z ∈ ℝ⇧^{*}⟶ ( ( ⟨x,y⟩ ∈ \<cltrrset> ⟷ ¬ ( ( x = y ∨ ⟨y, x⟩ ∈ \<cltrrset> ) ) ) ∧ ( ( ⟨x, y⟩ ∈ \<cltrrset> ∧ ⟨y, z⟩ ∈ \<cltrrset> ) ⟶ ⟨x, z⟩ ∈ \<cltrrset> ) )" using cltrr_def by simp } then have "∀x y z. ( x ∈ ℝ⇧^{*}∧ y ∈ ℝ⇧^{*}∧ z ∈ ℝ⇧^{*}) ⟶ ( ( ⟨x,y⟩ ∈ \<cltrrset> ⟷ ¬ ( ( x = y ∨ ⟨y, x⟩ ∈ \<cltrrset> ) ) ) ∧ ( ( ⟨x, y⟩ ∈ \<cltrrset> ∧ ⟨y, z⟩ ∈ \<cltrrset> ) ⟶ ⟨x, z⟩ ∈ \<cltrrset> ) )" by auto thus "\<cltrrset> Orders ℝ⇧^{*}" by (rule MMI_so) qed lemma (in MMIsar0) MMI_xrlttri3t: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" proof - have S1: "\<cltrrset> Orders ℝ⇧^{*}" by (rule MMI_xrltso) have "( \<cltrrset> Orders ℝ⇧^{*}∧ ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ) ⟶ ( A = B ⟷ ( ¬ ( ⟨A,B⟩ ∈ \<cltrrset> ) ∧ ¬ ( ⟨B, A⟩ ∈ \<cltrrset> ) ) )" by (rule MMI_sotrieq2) then have S2: "( \<cltrrset> Orders ℝ⇧^{*}∧ ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" using cltrr_def by simp from S1 S2 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" by (rule MMI_mpan) qed lemma (in MMIsar0) MMI_xrleloet: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" proof - have S1: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_xrlenltt) have S2: "( B ∈ ℝ⇧^{*}∧ A ∈ ℝ⇧^{*}) ⟶ ( B \<ls> A ⟷ ¬ ( ( B = A ∨ A \<ls> B ) ) )" by (rule MMI_xrlttrit) from S2 have S3: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( B \<ls> A ⟷ ¬ ( ( B = A ∨ A \<ls> B ) ) )" by (rule MMI_ancoms) from S3 have S4: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ( B = A ∨ A \<ls> B ) ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_con2bid) have S5: "B = A ⟷ A = B" by (rule MMI_eqcom) from S5 have S6: "( B = A ∨ A \<ls> B ) ⟷ ( A = B ∨ A \<ls> B )" by (rule MMI_orbi1i) have S7: "( A = B ∨ A \<ls> B ) ⟷ ( A \<ls> B ∨ A = B )" by (rule MMI_orcom) from S6 S7 have S8: "( B = A ∨ A \<ls> B ) ⟷ ( A \<ls> B ∨ A = B )" by (rule MMI_bitr) from S4 S8 have S9: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ¬ ( B \<ls> A ) ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_syl5rbbr) from S1 S9 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_bitrd) qed lemma (in MMIsar0) MMI_xrleltnet: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ A \<lsq> B ) ⟶ ( A \<ls> B ⟷ ¬ ( A = B ) )" proof - have S1: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" by (rule MMI_xrlttri3t) have S2: "( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) ⟶ ¬ ( A \<ls> B )" by (rule MMI_pm3_26) from S1 S2 have S3: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A = B ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_syl6bi) from S3 have S4: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( A = B ⟶ ¬ ( A \<ls> B ) )" by (rule MMI_adantr) have S5: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_xrleloet) from S5 have S6: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( A \<ls> B ∨ A = B )" by (rule MMI_biimpa) from S6 have S7: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( ¬ ( A \<ls> B ) ⟶ A = B )" by (rule MMI_ord) from S4 S7 have S8: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( A = B ⟷ ¬ ( A \<ls> B ) )" by (rule MMI_impbid) from S8 have S9: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( A \<ls> B ⟷ ¬ ( A = B ) )" by (rule MMI_con2bid) from S9 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ A \<lsq> B ) ⟶ ( A \<ls> B ⟷ ¬ ( A = B ) )" by (rule MMI_3impa) qed lemma (in MMIsar0) MMI_xrltlet: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ A \<lsq> B )" proof - have S1: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_xrleloet) have S2: "A \<ls> B ⟶ ( A \<ls> B ∨ A = B )" by (rule MMI_orc) from S1 S2 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ A \<lsq> B )" by (rule MMI_syl5bir) qed lemma (in MMIsar0) MMI_xrlelttrt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" proof - have S1: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_xrleloet) from S1 have S2: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_3adant3) have S3: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_xrlttrt) from S3 have S4: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_exp3a) have S5: "A = B ⟶ ( A \<ls> C ⟷ B \<ls> C )" by (rule MMI_breq1) from S5 have S6: "A = B ⟶ ( B \<ls> C ⟶ A \<ls> C )" by (rule MMI_biimprd) from S6 have S7: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A = B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_a1i) from S4 S7 have S8: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∨ A = B ) ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_jaod) from S2 S8 have S9: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_sylbid) from S9 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_imp3a) qed (**************** 281-290 ***********************) lemma (in MMIsar0) MMI_xrltletrt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<lsq> C ) ⟶ A \<ls> C )" proof - have S1: "( B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_xrleloet) from S1 have S2: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_3adant1) have S3: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_xrlttrt) from S3 have S4: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ( B \<ls> C ⟶ A \<ls> C ) )" by (rule MMI_exp3a) from S4 have S5: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B \<ls> C ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_com23) have S6: "B = C ⟶ ( A \<ls> B ⟷ A \<ls> C )" by (rule MMI_breq2) from S6 have S7: "B = C ⟶ ( A \<ls> B ⟶ A \<ls> C )" by (rule MMI_biimpd) from S7 have S8: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B = C ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_a1i) from S5 S8 have S9: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( B \<ls> C ∨ B = C ) ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_jaod) from S2 S9 have S10: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B \<lsq> C ⟶ ( A \<ls> B ⟶ A \<ls> C ) )" by (rule MMI_sylbid) from S10 have S11: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ( B \<lsq> C ⟶ A \<ls> C ) )" by (rule MMI_com23) from S11 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∧ B \<lsq> C ) ⟶ A \<ls> C )" by (rule MMI_imp3a) qed lemma (in MMIsar0) MMI_xrletrt: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<lsq> C ) ⟶ A \<lsq> C )" proof - have S1: "( B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_xrleloet) from S1 have S2: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_3adant1) from S2 have S3: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( B \<lsq> C ⟷ ( B \<ls> C ∨ B = C ) )" by (rule MMI_adantr) have S4: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<ls> C )" by (rule MMI_xrlelttrt) have S5: "( A ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<ls> C ⟶ A \<lsq> C )" by (rule MMI_xrltlet) from S5 have S6: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<ls> C ⟶ A \<lsq> C )" by (rule MMI_3adant2) from S4 S6 have S7: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<ls> C ) ⟶ A \<lsq> C )" by (rule MMI_syld) from S7 have S8: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟶ ( B \<ls> C ⟶ A \<lsq> C ) )" by (rule MMI_exp3a) from S8 have S9: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( B \<ls> C ⟶ A \<lsq> C )" by (rule MMI_imp) have S10: "B = C ⟶ ( A \<lsq> B ⟷ A \<lsq> C )" by (rule MMI_breq2) from S10 have S11: "A \<lsq> B ⟶ ( B = C ⟶ A \<lsq> C )" by (rule MMI_biimpcd) from S11 have S12: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( B = C ⟶ A \<lsq> C )" by (rule MMI_adantl) from S9 S12 have S13: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( ( B \<ls> C ∨ B = C ) ⟶ A \<lsq> C )" by (rule MMI_jaod) from S3 S13 have S14: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ∧ A \<lsq> B ) ⟶ ( B \<lsq> C ⟶ A \<lsq> C )" by (rule MMI_sylbid) from S14 have S15: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> B ⟶ ( B \<lsq> C ⟶ A \<lsq> C ) )" by (rule MMI_ex) from S15 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ C ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<lsq> C ) ⟶ A \<lsq> C )" by (rule MMI_imp3a) qed lemma (in MMIsar0) MMI_xrltnet: shows "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ¬ ( A = B ) )" proof - have S1: "\<cltrrset> Orders ℝ⇧^{*}" by (rule MMI_xrltso) have "( \<cltrrset> Orders ℝ⇧^{*}∧ ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ) ⟶ ( A = B ⟷ ¬ ( ( ⟨A, B⟩ ∈ \<cltrrset> ∨ ⟨B,A⟩ ∈ \<cltrrset> ) ) )" by (rule MMI_sotrieq) then have S2: "( \<cltrrset> Orders ℝ⇧^{*}∧ ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ) ⟶ ( A = B ⟷ ¬ ( ( A \<ls> B ∨ B \<ls> A ) ) )" using cltrr_def by simp from S1 S2 have S3: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A = B ⟷ ¬ ( ( A \<ls> B ∨ B \<ls> A ) ) )" by (rule MMI_mpan) from S3 have S4: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ( A \<ls> B ∨ B \<ls> A ) ⟷ ¬ ( A = B ) )" by (rule MMI_con2bid) have S5: "A \<ls> B ⟶ ( A \<ls> B ∨ B \<ls> A )" by (rule MMI_orc) from S4 S5 show "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( A \<ls> B ⟶ ¬ ( A = B ) )" by (rule MMI_syl5bi) qed lemma (in MMIsar0) MMI_nltpnftt: shows "A ∈ ℝ⇧^{*}⟶ ( A = \<cpnf> ⟷ ¬ ( A \<ls> \<cpnf> ) )" proof - have S1: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S2: "\<cpnf> ∈ ℝ⇧^{*}⟶ ¬ ( \<cpnf> \<ls> \<cpnf> )" by (rule MMI_xrltnrt) from S1 S2 have S3: "¬ ( \<cpnf> \<ls> \<cpnf> )" by (rule MMI_ax_mp) have S4: "A = \<cpnf> ⟶ ( A \<ls> \<cpnf> ⟷ \<cpnf> \<ls> \<cpnf> )" by (rule MMI_breq1) from S3 S4 have S5: "A = \<cpnf> ⟶ ¬ ( A \<ls> \<cpnf> )" by (rule MMI_mtbiri) from S5 have S6: "A ∈ ℝ⇧^{*}⟶ ( A = \<cpnf> ⟶ ¬ ( A \<ls> \<cpnf> ) )" by (rule MMI_a1i) have S7: "A ∈ ℝ⇧^{*}⟶ A \<lsq> \<cpnf>" by (rule MMI_pnfget) have S8: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S9: "( A ∈ ℝ⇧^{*}∧ \<cpnf> ∈ ℝ⇧^{*}) ⟶ ( A \<lsq> \<cpnf> ⟷ ( A \<ls> \<cpnf> ∨ A = \<cpnf> ) )" by (rule MMI_xrleloet) from S8 S9 have S10: "A ∈ ℝ⇧^{*}⟶ ( A \<lsq> \<cpnf> ⟷ ( A \<ls> \<cpnf> ∨ A = \<cpnf> ) )" by (rule MMI_mpan2) from S7 S10 have S11: "A ∈ ℝ⇧^{*}⟶ ( A \<ls> \<cpnf> ∨ A = \<cpnf> )" by (rule MMI_mpbid) from S11 have S12: "A ∈ ℝ⇧^{*}⟶ ( ¬ ( A \<ls> \<cpnf> ) ⟶ A = \<cpnf> )" by (rule MMI_ord) from S6 S12 show "A ∈ ℝ⇧^{*}⟶ ( A = \<cpnf> ⟷ ¬ ( A \<ls> \<cpnf> ) )" by (rule MMI_impbid) qed lemma (in MMIsar0) MMI_ngtmnftt: shows "A ∈ ℝ⇧^{*}⟶ ( A = \<cmnf> ⟷ ¬ ( \<cmnf> \<ls> A ) )" proof - have S1: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S2: "\<cmnf> ∈ ℝ⇧^{*}⟶ ¬ ( \<cmnf> \<ls> \<cmnf> )" by (rule MMI_xrltnrt) from S1 S2 have S3: "¬ ( \<cmnf> \<ls> \<cmnf> )" by (rule MMI_ax_mp) have S4: "A = \<cmnf> ⟶ ( \<cmnf> \<ls> A ⟷ \<cmnf> \<ls> \<cmnf> )" by (rule MMI_breq2) from S3 S4 have S5: "A = \<cmnf> ⟶ ¬ ( \<cmnf> \<ls> A )" by (rule MMI_mtbiri) from S5 have S6: "A ∈ ℝ⇧^{*}⟶ ( A = \<cmnf> ⟶ ¬ ( \<cmnf> \<ls> A ) )" by (rule MMI_a1i) have S7: "A ∈ ℝ⇧^{*}⟶ \<cmnf> \<lsq> A" by (rule MMI_mnflet) have S8: "\<cmnf> ∈ ℝ⇧^{*}" by (rule MMI_mnfxr) have S9: "( \<cmnf> ∈ ℝ⇧^{*}∧ A ∈ ℝ⇧^{*}) ⟶ ( \<cmnf> \<lsq> A ⟷ ( \<cmnf> \<ls> A ∨ \<cmnf> = A ) )" by (rule MMI_xrleloet) from S8 S9 have S10: "A ∈ ℝ⇧^{*}⟶ ( \<cmnf> \<lsq> A ⟷ ( \<cmnf> \<ls> A ∨ \<cmnf> = A ) )" by (rule MMI_mpan) from S7 S10 have S11: "A ∈ ℝ⇧^{*}⟶ ( \<cmnf> \<ls> A ∨ \<cmnf> = A )" by (rule MMI_mpbid) from S11 have S12: "A ∈ ℝ⇧^{*}⟶ ( ¬ ( \<cmnf> \<ls> A ) ⟶ \<cmnf> = A )" by (rule MMI_ord) have S13: "\<cmnf> = A ⟷ A = \<cmnf>" by (rule MMI_eqcom) from S12 S13 have S14: "A ∈ ℝ⇧^{*}⟶ ( ¬ ( \<cmnf> \<ls> A ) ⟶ A = \<cmnf> )" by (rule MMI_syl6ib) from S6 S14 show "A ∈ ℝ⇧^{*}⟶ ( A = \<cmnf> ⟷ ¬ ( \<cmnf> \<ls> A ) )" by (rule MMI_impbid) qed lemma (in MMIsar0) MMI_xrrebndt: shows "A ∈ ℝ⇧^{*}⟶ ( A ∈ ℝ ⟷ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) )" proof - have S1: "A ∈ ℝ ⟶ \<cmnf> \<ls> A" by (rule MMI_mnfltt) have S2: "A ∈ ℝ ⟶ A \<ls> \<cpnf>" by (rule MMI_ltpnft) from S1 S2 have S3: "A ∈ ℝ ⟶ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> )" by (rule MMI_jca) from S3 have S4: "A ∈ ℝ⇧^{*}⟶ ( A ∈ ℝ ⟶ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) )" by (rule MMI_a1i) have S5: "A ∈ ℝ⇧^{*}⟶ ( A = \<cpnf> ⟷ ¬ ( A \<ls> \<cpnf> ) )" by (rule MMI_nltpnftt) have S6: "A ∈ ℝ⇧^{*}⟶ ( A = \<cmnf> ⟷ ¬ ( \<cmnf> \<ls> A ) )" by (rule MMI_ngtmnftt) from S5 S6 have S7: "A ∈ ℝ⇧^{*}⟶ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ⟷ ( ¬ ( A \<ls> \<cpnf>) ∨ ¬ ( \<cmnf> \<ls> A ) ) )" by (rule MMI_orbi12d) have S8: "¬ ( ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) ) ⟷ ( ¬ ( \<cmnf> \<ls> A ) ∨ ¬ ( A \<ls> \<cpnf> ) )" by (rule MMI_ianor) have S9: "( ¬ ( \<cmnf> \<ls> A ) ∨ ¬ ( A \<ls> \<cpnf> ) ) ⟷ ( ¬ ( A \<ls> \<cpnf> ) ∨ ¬ ( \<cmnf> \<ls> A ) )" by (rule MMI_orcom) from S8 S9 have S10: "( ¬ ( A \<ls> \<cpnf> ) ∨ ¬ ( \<cmnf> \<ls> A ) ) ⟷ ¬ ( ( \<cmnf> \<ls> A ) ∧ A \<ls> \<cpnf> )" by (rule MMI_bitr2) from S7 S10 have S11: "A ∈ ℝ⇧^{*}⟶ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ⟷ ¬ ( ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) ) )" by (rule MMI_syl6bb) from S11 have S12: "A ∈ ℝ⇧^{*}⟶ ( ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) ⟷ ¬ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ) )" by (rule MMI_con2bid) have S13: "A ∈ ℝ⇧^{*}⟷ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_elxr) from S13 have S14: "A ∈ ℝ⇧^{*}⟶ ( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> )" by (rule MMI_biimp) have S15: "( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ⟷ ( A ∈ ℝ ∨ ( A = \<cpnf> ∨ A = \<cmnf> ) )" by (rule MMI_3orass) have S16: "( A ∈ ℝ ∨ ( A = \<cpnf> ∨ A = \<cmnf> ) ) ⟷ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ∨ A ∈ ℝ )" by (rule MMI_orcom) from S15 S16 have S17: "( A ∈ ℝ ∨ A = \<cpnf> ∨ A = \<cmnf> ) ⟷ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ∨ A ∈ ℝ )" by (rule MMI_bitr) from S14 S17 have S18: "A ∈ ℝ⇧^{*}⟶ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ∨ A ∈ ℝ )" by (rule MMI_sylib) from S18 have S19: "A ∈ ℝ⇧^{*}⟶ ( ¬ ( ( A = \<cpnf> ∨ A = \<cmnf> ) ) ⟶ A ∈ ℝ )" by (rule MMI_ord) from S12 S19 have S20: "A ∈ ℝ⇧^{*}⟶ ( ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) ⟶ A ∈ ℝ )" by (rule MMI_sylbid) from S4 S20 show "A ∈ ℝ⇧^{*}⟶ ( A ∈ ℝ ⟷ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) )" by (rule MMI_impbid) qed lemma (in MMIsar0) MMI_xrret: shows "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ ( \<cmnf> \<ls> A ∧ A \<lsq> B ) ) ⟶ A ∈ ℝ" proof - have S1: "( \<cmnf> \<ls> A ∧ A \<lsq> B ) ⟶ \<cmnf> \<ls> A" by (rule MMI_pm3_26) from S1 have S2: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ ( \<cmnf> \<ls> A ∧ A \<lsq> B ) ) ⟶ \<cmnf> \<ls> A" by (rule MMI_adantl) have S3: "B ∈ ℝ ⟶ B \<ls> \<cpnf>" by (rule MMI_ltpnft) from S3 have S4: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ⟶ B \<ls> \<cpnf>" by (rule MMI_adantl) have S5: "\<cpnf> ∈ ℝ⇧^{*}" by (rule MMI_pnfxr) have S6: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}∧ \<cpnf> ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<ls> \<cpnf> ) ⟶ A \<ls> \<cpnf> )" by (rule MMI_xrlelttrt) from S5 S6 have S7: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ⇧^{*}) ⟶ ( ( A \<lsq> B ∧ B \<ls> \<cpnf> ) ⟶ A \<ls> \<cpnf> )" by (rule MMI_mp3an3) have S8: "B ∈ ℝ ⟶ B ∈ ℝ⇧^{*}" by (rule MMI_rexrt) from S7 S8 have S9: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ⟶ ( ( A \<lsq> B ∧ B \<ls> \<cpnf> ) ⟶ A \<ls> \<cpnf> )" by (rule MMI_sylan2) from S4 S9 have S10: "( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟶ A \<ls> \<cpnf> )" by (rule MMI_mpan2d) from S10 have S11: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ A \<lsq> B ) ⟶ A \<ls> \<cpnf>" by (rule MMI_imp) from S11 have S12: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ ( \<cmnf> \<ls> A ∧ A \<lsq> B ) ) ⟶ A \<ls> \<cpnf>" by (rule MMI_adantrl) from S2 S12 have S13: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ ( \<cmnf> \<ls> A ∧ A \<lsq> B ) ) ⟶ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> )" by (rule MMI_jca) have S14: "A ∈ ℝ⇧^{*}⟶ ( A ∈ ℝ ⟷ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) )" by (rule MMI_xrrebndt) from S14 have S15: "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ ( \<cmnf> \<ls> A ∧ A \<lsq> B ) ) ⟶ ( A ∈ ℝ ⟷ ( \<cmnf> \<ls> A ∧ A \<ls> \<cpnf> ) )" by (rule MMI_ad2antrr) from S13 S15 show "( ( A ∈ ℝ⇧^{*}∧ B ∈ ℝ ) ∧ ( \<cmnf> \<ls> A ∧ A \<lsq> B ) ) ⟶ A ∈ ℝ" by (rule MMI_mpbird) qed lemma (in MMIsar0) MMI_eqlet: shows "( A ∈ ℝ ∧ A = B ) ⟶ A \<lsq> B" proof - have S1: "A = B ⟶ ( A \<lsq> A ⟷ A \<lsq> B )" by (rule MMI_breq2) from S1 have S2: "( A \<lsq> A ∧ A = B ) ⟶ A \<lsq> B" by (rule MMI_biimpac) have S3: "A ∈ ℝ ⟶ A \<lsq> A" by (rule MMI_leidt) from S2 S3 show "( A ∈ ℝ ∧ A = B ) ⟶ A \<lsq> B" by (rule MMI_sylan) qed lemma (in MMIsar0) MMI_lttri2: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "¬ ( A = B ) ⟷ ( A \<ls> B ∨ B \<ls> A )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( ¬ ( A = B ) ⟷ ( A \<ls> B ∨ B \<ls> A ) )" by (rule MMI_lttri2t) from S1 S2 S3 show "¬ ( A = B ) ⟷ ( A \<ls> B ∨ B \<ls> A )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_lttri3: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) ) )" by (rule MMI_lttri3t) from S1 S2 S3 show "A = B ⟷ ( ¬ ( A \<ls> B ) ∧ ¬ ( B \<ls> A ) )" by (rule MMI_mp2an) qed (*****************290-300*****************************) lemma (in MMIsar0) MMI_letri3: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A ) )" by (rule MMI_letri3t) from S1 S2 S3 show "A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_leloe: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<lsq> B ⟷ ( A \<ls> B ∨ A = B )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ( A \<ls> B ∨ A = B ) )" by (rule MMI_leloet) from S1 S2 S3 show "A \<lsq> B ⟷ ( A \<ls> B ∨ A = B )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_ltlen: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<ls> B ⟷ ( A \<lsq> B ∧ ¬ ( A = B ) )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟷ ( A \<lsq> B ∧ ¬ ( A = B ) ) )" by (rule MMI_ltlent) from S1 S2 S3 show "A \<ls> B ⟷ ( A \<lsq> B ∧ ¬ ( A = B ) )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_ltnsym: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<ls> B ⟶ ¬ ( B \<ls> A )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( B \<ls> A ) )" by (rule MMI_ltnsymt) from S1 S2 S3 show "A \<ls> B ⟶ ¬ ( B \<ls> A )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_lenlt: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<lsq> B ⟷ ¬ ( B \<ls> A )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<lsq> B ⟷ ¬ ( B \<ls> A ) )" by (rule MMI_lenltt) from S1 S2 S3 show "A \<lsq> B ⟷ ¬ ( B \<ls> A )" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_ltnle: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<ls> B ⟷ ¬ ( B \<lsq> A )" proof - from A2 have S1: "B ∈ ℝ". from A1 have S2: "A ∈ ℝ". from S1 S2 have S3: "B \<lsq> A ⟷ ¬ ( A \<ls> B )" by (rule MMI_lenlt) from S3 show "A \<ls> B ⟷ ¬ ( B \<lsq> A )" by (rule MMI_con2bii) qed lemma (in MMIsar0) MMI_ltle: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<ls> B ⟶ A \<lsq> B" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ A \<lsq> B )" by (rule MMI_ltlet) from S1 S2 S3 show "A \<ls> B ⟶ A \<lsq> B" by (rule MMI_mp2an) qed lemma (in MMIsar0) MMI_ltlei: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" and A3: "A \<ls> B" shows "A \<lsq> B" proof - from A3 have S1: "A \<ls> B". from A1 have S2: "A ∈ ℝ". from A2 have S3: "B ∈ ℝ". from S2 S3 have S4: "A \<ls> B ⟶ A \<lsq> B" by (rule MMI_ltle) from S1 S4 show "A \<lsq> B" by (rule MMI_ax_mp) qed lemma (in MMIsar0) MMI_eqle: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A = B ⟶ A \<lsq> B" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". from S1 S2 have S3: "A = B ⟷ ( A \<lsq> B ∧ B \<lsq> A )" by (rule MMI_letri3) from S3 show "A = B ⟶ A \<lsq> B" by (rule MMI_pm3_26bd) qed lemma (in MMIsar0) MMI_ltne: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A \<ls> B ⟶ ¬ ( A = B )" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". have S3: "( A ∈ ℝ ∧ B ∈ ℝ ) ⟶ ( A \<ls> B ⟶ ¬ ( A = B ) )" by (rule MMI_ltnet) from S1 S2 S3 show "A \<ls> B ⟶ ¬ ( A = B )" by (rule MMI_mp2an) qed (*********** 301, 302 ******************************) lemma (in MMIsar0) MMI_letri: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" shows "A\<lsq>B ∨ B\<lsq>A" proof - from A2 have S1: "B ∈ ℝ". from A1 have S2: "A ∈ ℝ". from S1 S2 have S3: "B\<ls>A ⟷ ¬(A\<lsq>B)" by (rule MMI_ltnle) from A2 have S4: "B ∈ ℝ". from A1 have S5: "A ∈ ℝ". from S4 S5 have S6: "B\<ls>A ⟶ B\<lsq>A" by (rule MMI_ltle) from S3 S6 have S7: "¬(A\<lsq>B) ⟶ B\<lsq>A" by (rule MMI_sylbir) from S7 show "A\<lsq>B ∨ B\<lsq>A" by (rule MMI_orri) qed lemma (in MMIsar0) MMI_lttr: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" and A3: "C ∈ ℝ" shows "A\<ls>B ∧ B\<ls>C ⟶ A\<ls>C" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". from A3 have S3: "C ∈ ℝ". have S4: "A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ⟶ A\<ls>B ∧ B\<ls>C ⟶ A\<ls>C" by (rule MMI_axlttrn) from S1 S2 S3 S4 show "A\<ls>B ∧ B\<ls>C ⟶ A\<ls>C" by (rule MMI_mp3an) qed (********* 303 - 305 **********************************) lemma (in MMIsar0) MMI_lelttr: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" and A3: "C ∈ ℝ" shows "A\<lsq>B ∧ B\<ls>C ⟶ A\<ls>C" proof - from A1 have S1: "A ∈ ℝ". from A2 have S2: "B ∈ ℝ". from A3 have S3: "C ∈ ℝ". have S4: "A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ⟶ A\<lsq>B ∧ B\<ls>C ⟶ A\<ls>C" by (rule MMI_lelttrt) from S1 S2 S3 S4 show "A\<lsq>B ∧ B\<ls>C ⟶ A\<ls>C" by (rule MMI_mp3an) qed lemma (in MMIsar0) MMI_ltletr: assumes A1: "A ∈ ℝ" and A2: "B ∈ ℝ" and A3: "C ∈ ℝ" shows "A\<ls>B ∧ B\<lsq>C ⟶ A\<ls>C" proof - from A1 have S1: "A ∈ ℝ". from A2 have