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

Theorem r1ord3g 7448
Description: Ordering relation for the cumulative hierarchy of sets. Part of Theorem 3.3(i) of [BellMachover] p. 478. (Contributed by NM, 22-Sep-2003.)
Assertion
Ref Expression
r1ord3g  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  C_  B  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )

Proof of Theorem r1ord3g
StepHypRef Expression
1 r1funlim 7435 . . . . . 6  |-  ( Fun 
R1  /\  Lim  dom  R1 )
21simpri 450 . . . . 5  |-  Lim  dom  R1
3 limord 4452 . . . . 5  |-  ( Lim 
dom  R1  ->  Ord  dom  R1 )
4 ordsson 4582 . . . . 5  |-  ( Ord 
dom  R1  ->  dom  R1  C_  On )
52, 3, 4mp2b 11 . . . 4  |-  dom  R1  C_  On
65sseli 3179 . . 3  |-  ( A  e.  dom  R1  ->  A  e.  On )
75sseli 3179 . . 3  |-  ( B  e.  dom  R1  ->  B  e.  On )
8 onsseleq 4434 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  C_  B  <->  ( A  e.  B  \/  A  =  B )
) )
96, 7, 8syl2an 465 . 2  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  C_  B 
<->  ( A  e.  B  \/  A  =  B
) ) )
10 r1ordg 7447 . . . . 5  |-  ( B  e.  dom  R1  ->  ( A  e.  B  -> 
( R1 `  A
)  e.  ( R1
`  B ) ) )
1110adantl 454 . . . 4  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  e.  B  ->  ( R1 `  A )  e.  ( R1 `  B ) ) )
12 r1tr 7445 . . . . 5  |-  Tr  ( R1 `  B )
13 trss 4125 . . . . 5  |-  ( Tr  ( R1 `  B
)  ->  ( ( R1 `  A )  e.  ( R1 `  B
)  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
1412, 13ax-mp 10 . . . 4  |-  ( ( R1 `  A )  e.  ( R1 `  B )  ->  ( R1 `  A )  C_  ( R1 `  B ) )
1511, 14syl6 31 . . 3  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  e.  B  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
16 fveq2 5487 . . . . 5  |-  ( A  =  B  ->  ( R1 `  A )  =  ( R1 `  B
) )
17 eqimss 3233 . . . . 5  |-  ( ( R1 `  A )  =  ( R1 `  B )  ->  ( R1 `  A )  C_  ( R1 `  B ) )
1816, 17syl 17 . . . 4  |-  ( A  =  B  ->  ( R1 `  A )  C_  ( R1 `  B ) )
1918a1i 12 . . 3  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  =  B  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
2015, 19jaod 371 . 2  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( ( A  e.  B  \/  A  =  B )  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
219, 20sylbid 208 1  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  C_  B  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178    \/ wo 359    /\ wa 360    = wceq 1625    e. wcel 1687    C_ wss 3155   Tr wtr 4116   Ord word 4392   Oncon0 4393   Lim wlim 4394   dom cdm 4690   Fun wfun 5217   ` cfv 5223   R1cr1 7431
This theorem is referenced by:  r1ord3  7451  r1val1  7455  rankr1ag  7471  unwf  7479  rankelb  7493  rankonidlem  7497
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1638  ax-8 1646  ax-13 1689  ax-14 1691  ax-6 1706  ax-7 1711  ax-11 1718  ax-12 1870  ax-ext 2267  ax-sep 4144  ax-nul 4152  ax-pow 4189  ax-pr 4215  ax-un 4513
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 937  df-3an 938  df-tru 1312  df-ex 1531  df-nf 1534  df-sb 1633  df-eu 2150  df-mo 2151  df-clab 2273  df-cleq 2279  df-clel 2282  df-nfc 2411  df-ne 2451  df-ral 2551  df-rex 2552  df-reu 2553  df-rab 2555  df-v 2793  df-sbc 2995  df-csb 3085  df-dif 3158  df-un 3160  df-in 3162  df-ss 3169  df-pss 3171  df-nul 3459  df-if 3569  df-pw 3630  df-sn 3649  df-pr 3650  df-tp 3651  df-op 3652  df-uni 3831  df-iun 3910  df-br 4027  df-opab 4081  df-mpt 4082  df-tr 4117  df-eprel 4306  df-id 4310  df-po 4315  df-so 4316  df-fr 4353  df-we 4355  df-ord 4396  df-on 4397  df-lim 4398  df-suc 4399  df-om 4658  df-xp 4696  df-rel 4697  df-cnv 4698  df-co 4699  df-dm 4700  df-rn 4701  df-res 4702  df-ima 4703  df-fun 5225  df-fn 5226  df-f 5227  df-f1 5228  df-fo 5229  df-f1o 5230  df-fv 5231  df-recs 6385  df-rdg 6420  df-r1 7433
  Copyright terms: Public domain W3C validator