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

Theorem bndrank 8044
Description: Any class whose elements have bounded rank is a set. Proposition 9.19 of [TakeutiZaring] p. 80. (Contributed by NM, 13-Oct-2003.)
Assertion
Ref Expression
bndrank  |-  ( E. x  e.  On  A. y  e.  A  ( rank `  y )  C_  x  ->  A  e.  _V )
Distinct variable group:    x, y, A

Proof of Theorem bndrank
StepHypRef Expression
1 rankon 7998 . . . . . . . 8  |-  ( rank `  y )  e.  On
21onordi 4819 . . . . . . 7  |-  Ord  ( rank `  y )
3 eloni 4725 . . . . . . 7  |-  ( x  e.  On  ->  Ord  x )
4 ordsucsssuc 6433 . . . . . . 7  |-  ( ( Ord  ( rank `  y
)  /\  Ord  x )  ->  ( ( rank `  y )  C_  x  <->  suc  ( rank `  y
)  C_  suc  x ) )
52, 3, 4sylancr 658 . . . . . 6  |-  ( x  e.  On  ->  (
( rank `  y )  C_  x  <->  suc  ( rank `  y
)  C_  suc  x ) )
61onsuci 6448 . . . . . . 7  |-  suc  ( rank `  y )  e.  On
7 suceloni 6423 . . . . . . 7  |-  ( x  e.  On  ->  suc  x  e.  On )
8 r1ord3 7985 . . . . . . 7  |-  ( ( suc  ( rank `  y
)  e.  On  /\  suc  x  e.  On )  ->  ( suc  ( rank `  y )  C_  suc  x  ->  ( R1 ` 
suc  ( rank `  y
) )  C_  ( R1 `  suc  x ) ) )
96, 7, 8sylancr 658 . . . . . 6  |-  ( x  e.  On  ->  ( suc  ( rank `  y
)  C_  suc  x  -> 
( R1 `  suc  ( rank `  y )
)  C_  ( R1 ` 
suc  x ) ) )
105, 9sylbid 215 . . . . 5  |-  ( x  e.  On  ->  (
( rank `  y )  C_  x  ->  ( R1 ` 
suc  ( rank `  y
) )  C_  ( R1 `  suc  x ) ) )
11 vex 2973 . . . . . 6  |-  y  e. 
_V
1211rankid 8036 . . . . 5  |-  y  e.  ( R1 `  suc  ( rank `  y )
)
13 ssel 3347 . . . . 5  |-  ( ( R1 `  suc  ( rank `  y ) ) 
C_  ( R1 `  suc  x )  ->  (
y  e.  ( R1
`  suc  ( rank `  y ) )  -> 
y  e.  ( R1
`  suc  x )
) )
1410, 12, 13syl6mpi 62 . . . 4  |-  ( x  e.  On  ->  (
( rank `  y )  C_  x  ->  y  e.  ( R1 `  suc  x
) ) )
1514ralimdv 2793 . . 3  |-  ( x  e.  On  ->  ( A. y  e.  A  ( rank `  y )  C_  x  ->  A. y  e.  A  y  e.  ( R1 `  suc  x
) ) )
16 dfss3 3343 . . . 4  |-  ( A 
C_  ( R1 `  suc  x )  <->  A. y  e.  A  y  e.  ( R1 `  suc  x
) )
17 fvex 5698 . . . . 5  |-  ( R1
`  suc  x )  e.  _V
1817ssex 4433 . . . 4  |-  ( A 
C_  ( R1 `  suc  x )  ->  A  e.  _V )
1916, 18sylbir 213 . . 3  |-  ( A. y  e.  A  y  e.  ( R1 `  suc  x )  ->  A  e.  _V )
2015, 19syl6 33 . 2  |-  ( x  e.  On  ->  ( A. y  e.  A  ( rank `  y )  C_  x  ->  A  e.  _V ) )
2120rexlimiv 2833 1  |-  ( E. x  e.  On  A. y  e.  A  ( rank `  y )  C_  x  ->  A  e.  _V )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    e. wcel 1761   A.wral 2713   E.wrex 2714   _Vcvv 2970    C_ wss 3325   Ord word 4714   Oncon0 4715   suc csuc 4717   ` cfv 5415   R1cr1 7965   rankcrnk 7966
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-8 1763  ax-9 1765  ax-10 1780  ax-11 1785  ax-12 1797  ax-13 1948  ax-ext 2422  ax-rep 4400  ax-sep 4410  ax-nul 4418  ax-pow 4467  ax-pr 4528  ax-un 6371  ax-reg 7803  ax-inf2 7843
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 961  df-3an 962  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-eu 2261  df-mo 2262  df-clab 2428  df-cleq 2434  df-clel 2437  df-nfc 2566  df-ne 2606  df-ral 2718  df-rex 2719  df-reu 2720  df-rab 2722  df-v 2972  df-sbc 3184  df-csb 3286  df-dif 3328  df-un 3330  df-in 3332  df-ss 3339  df-pss 3341  df-nul 3635  df-if 3789  df-pw 3859  df-sn 3875  df-pr 3877  df-tp 3879  df-op 3881  df-uni 4089  df-int 4126  df-iun 4170  df-br 4290  df-opab 4348  df-mpt 4349  df-tr 4383  df-eprel 4628  df-id 4632  df-po 4637  df-so 4638  df-fr 4675  df-we 4677  df-ord 4718  df-on 4719  df-lim 4720  df-suc 4721  df-xp 4842  df-rel 4843  df-cnv 4844  df-co 4845  df-dm 4846  df-rn 4847  df-res 4848  df-ima 4849  df-iota 5378  df-fun 5417  df-fn 5418  df-f 5419  df-f1 5420  df-fo 5421  df-f1o 5422  df-fv 5423  df-om 6476  df-recs 6828  df-rdg 6862  df-r1 7967  df-rank 7968
This theorem is referenced by:  unbndrank  8045  scottex  8088
  Copyright terms: Public domain W3C validator