ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oawordi Unicode version

Theorem oawordi 6567
Description: Weak ordering property of ordinal addition. (Contributed by Jim Kingdon, 27-Jul-2019.)
Assertion
Ref Expression
oawordi  |-  ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  ->  ( A  C_  B  ->  ( C  +o  A )  C_  ( C  +o  B
) ) )

Proof of Theorem oawordi
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 oafnex 6542 . . . . 5  |-  ( x  e.  _V  |->  suc  x
)  Fn  _V
21a1i 9 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( x  e. 
_V  |->  suc  x )  Fn  _V )
3 simpl3 1005 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  C  e.  On )
4 simpl1 1003 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  A  e.  On )
5 simpl2 1004 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  B  e.  On )
6 simpr 110 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  A  C_  B
)
72, 3, 4, 5, 6rdgss 6481 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( rec (
( x  e.  _V  |->  suc  x ) ,  C
) `  A )  C_  ( rec ( ( x  e.  _V  |->  suc  x ) ,  C
) `  B )
)
83, 4jca 306 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( C  e.  On  /\  A  e.  On ) )
9 oav 6552 . . . 4  |-  ( ( C  e.  On  /\  A  e.  On )  ->  ( C  +o  A
)  =  ( rec ( ( x  e. 
_V  |->  suc  x ) ,  C ) `  A
) )
108, 9syl 14 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( C  +o  A )  =  ( rec ( ( x  e.  _V  |->  suc  x
) ,  C ) `
 A ) )
113, 5jca 306 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( C  e.  On  /\  B  e.  On ) )
12 oav 6552 . . . 4  |-  ( ( C  e.  On  /\  B  e.  On )  ->  ( C  +o  B
)  =  ( rec ( ( x  e. 
_V  |->  suc  x ) ,  C ) `  B
) )
1311, 12syl 14 . . 3  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( C  +o  B )  =  ( rec ( ( x  e.  _V  |->  suc  x
) ,  C ) `
 B ) )
147, 10, 133sstr4d 3242 . 2  |-  ( ( ( A  e.  On  /\  B  e.  On  /\  C  e.  On )  /\  A  C_  B )  ->  ( C  +o  A )  C_  ( C  +o  B ) )
1514ex 115 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:    -> wi 4    /\ wa 104    /\ w3a 981    = wceq 1373    e. wcel 2177   _Vcvv 2773    C_ wss 3170    |-> cmpt 4112   Oncon0 4417   suc csuc 4419    Fn wfn 5274   ` cfv 5279  (class class class)co 5956   reccrdg 6467    +o coa 6511
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4166  ax-sep 4169  ax-pow 4225  ax-pr 4260  ax-un 4487  ax-setind 4592
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3622  df-sn 3643  df-pr 3644  df-op 3646  df-uni 3856  df-iun 3934  df-br 4051  df-opab 4113  df-mpt 4114  df-tr 4150  df-id 4347  df-iord 4420  df-on 4422  df-suc 4425  df-xp 4688  df-rel 4689  df-cnv 4690  df-co 4691  df-dm 4692  df-rn 4693  df-res 4694  df-ima 4695  df-iota 5240  df-fun 5281  df-fn 5282  df-f 5283  df-f1 5284  df-fo 5285  df-f1o 5286  df-fv 5287  df-ov 5959  df-oprab 5960  df-mpo 5961  df-recs 6403  df-irdg 6468  df-oadd 6518
This theorem is referenced by:  oaword1  6569
  Copyright terms: Public domain W3C validator