Theorem oawordi 6472

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.

Step	Hyp	Ref	Expression
1		oafnex 6447	. . . . 5 |- ( x e. _V |-> suc x ) Fn _V
2	1	a1i 9	. . . 4 |- ( ( ( A e. On /\ B e. On /\ C e. On ) /\ A C_ B ) -> ( x e. _V |-> suc x ) Fn _V )
3		simpl3 1002	. . . 4 |- ( ( ( A e. On /\ B e. On /\ C e. On ) /\ A C_ B ) -> C e. On )
4		simpl1 1000	. . . 4 |- ( ( ( A e. On /\ B e. On /\ C e. On ) /\ A C_ B ) -> A e. On )
5		simpl2 1001	. . . 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 )
7	2, 3, 4, 5, 6	rdgss 6386	. . 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 ) )
8	3, 4	jca 306	. . . 4 |- ( ( ( A e. On /\ B e. On /\ C e. On ) /\ A C_ B ) -> ( C e. On /\ A e. On ) )
9		oav 6457	. . . 4 |- ( ( C e. On /\ A e. On ) -> ( C +o A ) = ( rec ( ( x e. _V |-> suc x ) , C ) ` A ) )
10	8, 9	syl 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 ) )
11	3, 5	jca 306	. . . 4 |- ( ( ( A e. On /\ B e. On /\ C e. On ) /\ A C_ B ) -> ( C e. On /\ B e. On ) )
12		oav 6457	. . . 4 |- ( ( C e. On /\ B e. On ) -> ( C +o B ) = ( rec ( ( x e. _V |-> suc x ) , C ) ` B ) )
13	11, 12	syl 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 ) )
14	7, 10, 13	3sstr4d 3202	. 2 |- ( ( ( A e. On /\ B e. On /\ C e. On ) /\ A C_ B ) -> ( C +o A ) C_ ( C +o B ) )
15	14	ex 115	1 |- ( ( A e. On /\ B e. On /\ C e. On ) -> ( A C_ B -> ( C +o A ) C_ ( C +o B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 978   = wceq 1353   e. wcel 2148   _Vcvv 2739   C_ wss 3131   |-> cmpt 4066   Oncon0 4365   suc csuc 4367   Fn wfn 5213   ` cfv 5218  (class class class)co 5877   reccrdg 6372   +o coa 6416

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-recs 6308  df-irdg 6373  df-oadd 6423

This theorem is referenced by:  oaword1  6474