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

Theorem r1elwf 8219
Description: Any member of the cumulative hierarchy is well-founded. (Contributed by Mario Carneiro, 28-May-2013.) (Revised by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
r1elwf  |-  ( A  e.  ( R1 `  B )  ->  A  e.  U. ( R1 " On ) )

Proof of Theorem r1elwf
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 r1funlim 8189 . . . . . 6  |-  ( Fun 
R1  /\  Lim  dom  R1 )
21simpri 463 . . . . 5  |-  Lim  dom  R1
3 limord 5444 . . . . 5  |-  ( Lim 
dom  R1  ->  Ord  dom  R1 )
4 ordsson 6574 . . . . 5  |-  ( Ord 
dom  R1  ->  dom  R1  C_  On )
52, 3, 4mp2b 10 . . . 4  |-  dom  R1  C_  On
6 elfvdm 5851 . . . 4  |-  ( A  e.  ( R1 `  B )  ->  B  e.  dom  R1 )
75, 6sseldi 3405 . . 3  |-  ( A  e.  ( R1 `  B )  ->  B  e.  On )
8 r1tr 8199 . . . . . 6  |-  Tr  ( R1 `  B )
9 trss 4470 . . . . . 6  |-  ( Tr  ( R1 `  B
)  ->  ( A  e.  ( R1 `  B
)  ->  A  C_  ( R1 `  B ) ) )
108, 9ax-mp 5 . . . . 5  |-  ( A  e.  ( R1 `  B )  ->  A  C_  ( R1 `  B
) )
11 elpwg 3932 . . . . 5  |-  ( A  e.  ( R1 `  B )  ->  ( A  e.  ~P ( R1 `  B )  <->  A  C_  ( R1 `  B ) ) )
1210, 11mpbird 235 . . . 4  |-  ( A  e.  ( R1 `  B )  ->  A  e.  ~P ( R1 `  B ) )
13 r1sucg 8192 . . . . 5  |-  ( B  e.  dom  R1  ->  ( R1 `  suc  B
)  =  ~P ( R1 `  B ) )
146, 13syl 17 . . . 4  |-  ( A  e.  ( R1 `  B )  ->  ( R1 `  suc  B )  =  ~P ( R1
`  B ) )
1512, 14eleqtrrd 2509 . . 3  |-  ( A  e.  ( R1 `  B )  ->  A  e.  ( R1 `  suc  B ) )
16 suceq 5450 . . . . . 6  |-  ( x  =  B  ->  suc  x  =  suc  B )
1716fveq2d 5829 . . . . 5  |-  ( x  =  B  ->  ( R1 `  suc  x )  =  ( R1 `  suc  B ) )
1817eleq2d 2491 . . . 4  |-  ( x  =  B  ->  ( A  e.  ( R1 ` 
suc  x )  <->  A  e.  ( R1 `  suc  B
) ) )
1918rspcev 3125 . . 3  |-  ( ( B  e.  On  /\  A  e.  ( R1 ` 
suc  B ) )  ->  E. x  e.  On  A  e.  ( R1 ` 
suc  x ) )
207, 15, 19syl2anc 665 . 2  |-  ( A  e.  ( R1 `  B )  ->  E. x  e.  On  A  e.  ( R1 `  suc  x
) )
21 rankwflemb 8216 . 2  |-  ( A  e.  U. ( R1
" On )  <->  E. x  e.  On  A  e.  ( R1 `  suc  x
) )
2220, 21sylibr 215 1  |-  ( A  e.  ( R1 `  B )  ->  A  e.  U. ( R1 " On ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1437    e. wcel 1872   E.wrex 2715    C_ wss 3379   ~Pcpw 3924   U.cuni 4162   Tr wtr 4461   dom cdm 4796   "cima 4799   Ord word 5384   Oncon0 5385   Lim wlim 5386   suc csuc 5387   Fun wfun 5538   ` cfv 5544   R1cr1 8185
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-8 1874  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2063  ax-ext 2408  ax-sep 4489  ax-nul 4498  ax-pow 4545  ax-pr 4603  ax-un 6541
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2280  df-mo 2281  df-clab 2415  df-cleq 2421  df-clel 2424  df-nfc 2558  df-ne 2601  df-ral 2719  df-rex 2720  df-reu 2721  df-rab 2723  df-v 3024  df-sbc 3243  df-csb 3339  df-dif 3382  df-un 3384  df-in 3386  df-ss 3393  df-pss 3395  df-nul 3705  df-if 3855  df-pw 3926  df-sn 3942  df-pr 3944  df-tp 3946  df-op 3948  df-uni 4163  df-iun 4244  df-br 4367  df-opab 4426  df-mpt 4427  df-tr 4462  df-eprel 4707  df-id 4711  df-po 4717  df-so 4718  df-fr 4755  df-we 4757  df-xp 4802  df-rel 4803  df-cnv 4804  df-co 4805  df-dm 4806  df-rn 4807  df-res 4808  df-ima 4809  df-pred 5342  df-ord 5388  df-on 5389  df-lim 5390  df-suc 5391  df-iota 5508  df-fun 5546  df-fn 5547  df-f 5548  df-f1 5549  df-fo 5550  df-f1o 5551  df-fv 5552  df-om 6651  df-wrecs 6983  df-recs 7045  df-rdg 7083  df-r1 8187
This theorem is referenced by:  rankr1ai  8221  pwwf  8230  sswf  8231  unwf  8233  uniwf  8242  rankonidlem  8251  r1pw  8268  r1pwcl  8270  rankr1id  8285  tcrank  8307  dfac12lem2  8525  r1limwun  9112  r1wunlim  9113  inatsk  9154
  Copyright terms: Public domain W3C validator