MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  omord2 Structured version   Unicode version

Theorem omord2 7092
Description: Ordering property of ordinal multiplication. (Contributed by NM, 25-Dec-2004.)
Assertion
Ref Expression
omord2  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( A  e.  B  <->  ( C  .o  A )  e.  ( C  .o  B ) ) )

Proof of Theorem omord2
StepHypRef Expression
1 omordi 7091 . . 3  |-  ( ( ( B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( A  e.  B  ->  ( C  .o  A )  e.  ( C  .o  B ) ) )
213adantl1 1144 . 2  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( A  e.  B  ->  ( C  .o  A )  e.  ( C  .o  B ) ) )
3 oveq2 6184 . . . . . 6  |-  ( A  =  B  ->  ( C  .o  A )  =  ( C  .o  B
) )
43a1i 11 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( A  =  B  ->  ( C  .o  A )  =  ( C  .o  B ) ) )
5 omordi 7091 . . . . . 6  |-  ( ( ( A  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( B  e.  A  ->  ( C  .o  B )  e.  ( C  .o  A ) ) )
653adantl2 1145 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( B  e.  A  ->  ( C  .o  B )  e.  ( C  .o  A ) ) )
74, 6orim12d 834 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( ( A  =  B  \/  B  e.  A )  ->  (
( C  .o  A
)  =  ( C  .o  B )  \/  ( C  .o  B
)  e.  ( C  .o  A ) ) ) )
87con3d 133 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( -.  (
( C  .o  A
)  =  ( C  .o  B )  \/  ( C  .o  B
)  e.  ( C  .o  A ) )  ->  -.  ( A  =  B  \/  B  e.  A ) ) )
9 omcl 7062 . . . . . . . 8  |-  ( ( C  e.  On  /\  A  e.  On )  ->  ( C  .o  A
)  e.  On )
10 omcl 7062 . . . . . . . 8  |-  ( ( C  e.  On  /\  B  e.  On )  ->  ( C  .o  B
)  e.  On )
11 eloni 4813 . . . . . . . . 9  |-  ( ( C  .o  A )  e.  On  ->  Ord  ( C  .o  A
) )
12 eloni 4813 . . . . . . . . 9  |-  ( ( C  .o  B )  e.  On  ->  Ord  ( C  .o  B
) )
13 ordtri2 4838 . . . . . . . . 9  |-  ( ( Ord  ( C  .o  A )  /\  Ord  ( C  .o  B
) )  ->  (
( C  .o  A
)  e.  ( C  .o  B )  <->  -.  (
( C  .o  A
)  =  ( C  .o  B )  \/  ( C  .o  B
)  e.  ( C  .o  A ) ) ) )
1411, 12, 13syl2an 477 . . . . . . . 8  |-  ( ( ( C  .o  A
)  e.  On  /\  ( C  .o  B
)  e.  On )  ->  ( ( C  .o  A )  e.  ( C  .o  B
)  <->  -.  ( ( C  .o  A )  =  ( C  .o  B
)  \/  ( C  .o  B )  e.  ( C  .o  A
) ) ) )
159, 10, 14syl2an 477 . . . . . . 7  |-  ( ( ( C  e.  On  /\  A  e.  On )  /\  ( C  e.  On  /\  B  e.  On ) )  -> 
( ( C  .o  A )  e.  ( C  .o  B )  <->  -.  ( ( C  .o  A )  =  ( C  .o  B )  \/  ( C  .o  B )  e.  ( C  .o  A ) ) ) )
1615anandis 826 . . . . . 6  |-  ( ( C  e.  On  /\  ( A  e.  On  /\  B  e.  On ) )  ->  ( ( C  .o  A )  e.  ( C  .o  B
)  <->  -.  ( ( C  .o  A )  =  ( C  .o  B
)  \/  ( C  .o  B )  e.  ( C  .o  A
) ) ) )
1716ancoms 453 . . . . 5  |-  ( ( ( A  e.  On  /\  B  e.  On )  /\  C  e.  On )  ->  ( ( C  .o  A )  e.  ( C  .o  B
)  <->  -.  ( ( C  .o  A )  =  ( C  .o  B
)  \/  ( C  .o  B )  e.  ( C  .o  A
) ) ) )
18173impa 1183 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  (
( C  .o  A
)  e.  ( C  .o  B )  <->  -.  (
( C  .o  A
)  =  ( C  .o  B )  \/  ( C  .o  B
)  e.  ( C  .o  A ) ) ) )
1918adantr 465 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( ( C  .o  A )  e.  ( C  .o  B
)  <->  -.  ( ( C  .o  A )  =  ( C  .o  B
)  \/  ( C  .o  B )  e.  ( C  .o  A
) ) ) )
20 eloni 4813 . . . . . 6  |-  ( A  e.  On  ->  Ord  A )
21 eloni 4813 . . . . . 6  |-  ( B  e.  On  ->  Ord  B )
22 ordtri2 4838 . . . . . 6  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  e.  B  <->  -.  ( A  =  B  \/  B  e.  A ) ) )
2320, 21, 22syl2an 477 . . . . 5  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  e.  B  <->  -.  ( A  =  B  \/  B  e.  A
) ) )
24233adant3 1008 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( A  e.  B  <->  -.  ( A  =  B  \/  B  e.  A )
) )
2524adantr 465 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( A  e.  B  <->  -.  ( A  =  B  \/  B  e.  A ) ) )
268, 19, 253imtr4d 268 . 2  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( ( C  .o  A )  e.  ( C  .o  B
)  ->  A  e.  B ) )
272, 26impbid 191 1  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  (/)  e.  C )  ->  ( A  e.  B  <->  ( C  .o  A )  e.  ( C  .o  B ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    /\ w3a 965    = wceq 1370    e. wcel 1757   (/)c0 3721   Ord word 4802   Oncon0 4803  (class class class)co 6176    .o comu 7004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1709  ax-7 1729  ax-8 1759  ax-9 1761  ax-10 1776  ax-11 1781  ax-12 1793  ax-13 1944  ax-ext 2429  ax-rep 4487  ax-sep 4497  ax-nul 4505  ax-pow 4554  ax-pr 4615  ax-un 6458
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1702  df-eu 2263  df-mo 2264  df-clab 2436  df-cleq 2442  df-clel 2445  df-nfc 2598  df-ne 2643  df-ral 2797  df-rex 2798  df-reu 2799  df-rab 2801  df-v 3056  df-sbc 3271  df-csb 3373  df-dif 3415  df-un 3417  df-in 3419  df-ss 3426  df-pss 3428  df-nul 3722  df-if 3876  df-pw 3946  df-sn 3962  df-pr 3964  df-tp 3966  df-op 3968  df-uni 4176  df-iun 4257  df-br 4377  df-opab 4435  df-mpt 4436  df-tr 4470  df-eprel 4716  df-id 4720  df-po 4725  df-so 4726  df-fr 4763  df-we 4765  df-ord 4806  df-on 4807  df-lim 4808  df-suc 4809  df-xp 4930  df-rel 4931  df-cnv 4932  df-co 4933  df-dm 4934  df-rn 4935  df-res 4936  df-ima 4937  df-iota 5465  df-fun 5504  df-fn 5505  df-f 5506  df-f1 5507  df-fo 5508  df-f1o 5509  df-fv 5510  df-ov 6179  df-oprab 6180  df-mpt2 6181  df-om 6563  df-recs 6918  df-rdg 6952  df-oadd 7010  df-omul 7011
This theorem is referenced by:  omord  7093  omword  7095  oeeui  7127  omabs  7172  omxpenlem  7498  cantnflt  7967  cantnfltOLD  7997  cnfcom  8020  cnfcomOLD  8028
  Copyright terms: Public domain W3C validator