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

Theorem r1ord3g 7451
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 7438 . . . . . 6  |-  ( Fun 
R1  /\  Lim  dom  R1 )
21simpri 448 . . . . 5  |-  Lim  dom  R1
3 limord 4451 . . . . 5  |-  ( Lim 
dom  R1  ->  Ord  dom  R1 )
4 ordsson 4581 . . . . 5  |-  ( Ord 
dom  R1  ->  dom  R1  C_  On )
52, 3, 4mp2b 9 . . . 4  |-  dom  R1  C_  On
65sseli 3176 . . 3  |-  ( A  e.  dom  R1  ->  A  e.  On )
75sseli 3176 . . 3  |-  ( B  e.  dom  R1  ->  B  e.  On )
8 onsseleq 4433 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  C_  B  <->  ( A  e.  B  \/  A  =  B )
) )
96, 7, 8syl2an 463 . 2  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  C_  B 
<->  ( A  e.  B  \/  A  =  B
) ) )
10 r1ordg 7450 . . . . 5  |-  ( B  e.  dom  R1  ->  ( A  e.  B  -> 
( R1 `  A
)  e.  ( R1
`  B ) ) )
1110adantl 452 . . . 4  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  e.  B  ->  ( R1 `  A )  e.  ( R1 `  B ) ) )
12 r1tr 7448 . . . . 5  |-  Tr  ( R1 `  B )
13 trss 4122 . . . . 5  |-  ( Tr  ( R1 `  B
)  ->  ( ( R1 `  A )  e.  ( R1 `  B
)  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
1412, 13ax-mp 8 . . . 4  |-  ( ( R1 `  A )  e.  ( R1 `  B )  ->  ( R1 `  A )  C_  ( R1 `  B ) )
1511, 14syl6 29 . . 3  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  e.  B  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
16 fveq2 5525 . . . . 5  |-  ( A  =  B  ->  ( R1 `  A )  =  ( R1 `  B
) )
17 eqimss 3230 . . . . 5  |-  ( ( R1 `  A )  =  ( R1 `  B )  ->  ( R1 `  A )  C_  ( R1 `  B ) )
1816, 17syl 15 . . . 4  |-  ( A  =  B  ->  ( R1 `  A )  C_  ( R1 `  B ) )
1918a1i 10 . . 3  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( A  =  B  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
2015, 19jaod 369 . 2  |-  ( ( A  e.  dom  R1  /\  B  e.  dom  R1 )  ->  ( ( A  e.  B  \/  A  =  B )  ->  ( R1 `  A )  C_  ( R1 `  B ) ) )
219, 20sylbid 206 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 4    <-> wb 176    \/ wo 357    /\ wa 358    = wceq 1623    e. wcel 1684    C_ wss 3152   Tr wtr 4113   Ord word 4391   Oncon0 4392   Lim wlim 4393   dom cdm 4689   Fun wfun 5249   ` cfv 5255   R1cr1 7434
This theorem is referenced by:  r1ord3  7454  r1val1  7458  rankr1ag  7474  unwf  7482  rankelb  7496  rankonidlem  7500
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-recs 6388  df-rdg 6423  df-r1 7436
  Copyright terms: Public domain W3C validator