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

Theorem oaword 6784
Description: Weak ordering property of ordinal addition. (Contributed by NM, 6-Dec-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
oaword  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( A  C_  B  <->  ( C  +o  A )  C_  ( C  +o  B ) ) )

Proof of Theorem oaword
StepHypRef Expression
1 oaord 6782 . . . 4  |-  ( ( B  e.  On  /\  A  e.  On  /\  C  e.  On )  ->  ( B  e.  A  <->  ( C  +o  B )  e.  ( C  +o  A ) ) )
213com12 1157 . . 3  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( B  e.  A  <->  ( C  +o  B )  e.  ( C  +o  A ) ) )
32notbid 286 . 2  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( -.  B  e.  A  <->  -.  ( C  +o  B
)  e.  ( C  +o  A ) ) )
4 ontri1 4607 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  C_  B  <->  -.  B  e.  A ) )
543adant3 977 . 2  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( A  C_  B  <->  -.  B  e.  A ) )
6 oacl 6771 . . . . 5  |-  ( ( C  e.  On  /\  A  e.  On )  ->  ( C  +o  A
)  e.  On )
76ancoms 440 . . . 4  |-  ( ( A  e.  On  /\  C  e.  On )  ->  ( C  +o  A
)  e.  On )
873adant2 976 . . 3  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( C  +o  A )  e.  On )
9 oacl 6771 . . . . 5  |-  ( ( C  e.  On  /\  B  e.  On )  ->  ( C  +o  B
)  e.  On )
109ancoms 440 . . . 4  |-  ( ( B  e.  On  /\  C  e.  On )  ->  ( C  +o  B
)  e.  On )
11103adant1 975 . . 3  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( C  +o  B )  e.  On )
12 ontri1 4607 . . 3  |-  ( ( ( C  +o  A
)  e.  On  /\  ( C  +o  B
)  e.  On )  ->  ( ( C  +o  A )  C_  ( C  +o  B
)  <->  -.  ( C  +o  B )  e.  ( C  +o  A ) ) )
138, 11, 12syl2anc 643 . 2  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  (
( C  +o  A
)  C_  ( C  +o  B )  <->  -.  ( C  +o  B )  e.  ( C  +o  A
) ) )
143, 5, 133bitr4d 277 1  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( A  C_  B  <->  ( C  +o  A )  C_  ( C  +o  B ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ w3a 936    e. wcel 1725    C_ wss 3312   Oncon0 4573  (class class class)co 6073    +o coa 6713
This theorem is referenced by:  oaword1  6787  oaass  6796  omwordri  6807  omlimcl  6813  oaabs2  6880
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-rep 4312  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-reu 2704  df-rab 2706  df-v 2950  df-sbc 3154  df-csb 3244  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-pss 3328  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-tp 3814  df-op 3815  df-uni 4008  df-iun 4087  df-br 4205  df-opab 4259  df-mpt 4260  df-tr 4295  df-eprel 4486  df-id 4490  df-po 4495  df-so 4496  df-fr 4533  df-we 4535  df-ord 4576  df-on 4577  df-lim 4578  df-suc 4579  df-om 4838  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-iota 5410  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-fv 5454  df-ov 6076  df-oprab 6077  df-mpt2 6078  df-recs 6625  df-rdg 6660  df-oadd 6720
  Copyright terms: Public domain W3C validator