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

Theorem pwwf 8216
Description: A power set is well-founded iff the base set is. (Contributed by Mario Carneiro, 8-Jun-2013.) (Revised by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
pwwf  |-  ( A  e.  U. ( R1
" On )  <->  ~P A  e.  U. ( R1 " On ) )

Proof of Theorem pwwf
StepHypRef Expression
1 r1rankidb 8213 . . . . . . 7  |-  ( A  e.  U. ( R1
" On )  ->  A  C_  ( R1 `  ( rank `  A )
) )
2 sspwb 4686 . . . . . . 7  |-  ( A 
C_  ( R1 `  ( rank `  A )
)  <->  ~P A  C_  ~P ( R1 `  ( rank `  A ) ) )
31, 2sylib 196 . . . . . 6  |-  ( A  e.  U. ( R1
" On )  ->  ~P A  C_  ~P ( R1 `  ( rank `  A
) ) )
4 rankdmr1 8210 . . . . . . 7  |-  ( rank `  A )  e.  dom  R1
5 r1sucg 8178 . . . . . . 7  |-  ( (
rank `  A )  e.  dom  R1  ->  ( R1 `  suc  ( rank `  A ) )  =  ~P ( R1 `  ( rank `  A )
) )
64, 5ax-mp 5 . . . . . 6  |-  ( R1
`  suc  ( rank `  A ) )  =  ~P ( R1 `  ( rank `  A )
)
73, 6syl6sseqr 3536 . . . . 5  |-  ( A  e.  U. ( R1
" On )  ->  ~P A  C_  ( R1
`  suc  ( rank `  A ) ) )
8 fvex 5858 . . . . . 6  |-  ( R1
`  suc  ( rank `  A ) )  e. 
_V
98elpw2 4601 . . . . 5  |-  ( ~P A  e.  ~P ( R1 `  suc  ( rank `  A ) )  <->  ~P A  C_  ( R1 `  suc  ( rank `  A )
) )
107, 9sylibr 212 . . . 4  |-  ( A  e.  U. ( R1
" On )  ->  ~P A  e.  ~P ( R1 `  suc  ( rank `  A ) ) )
11 r1funlim 8175 . . . . . . . 8  |-  ( Fun 
R1  /\  Lim  dom  R1 )
1211simpri 460 . . . . . . 7  |-  Lim  dom  R1
13 limsuc 6657 . . . . . . 7  |-  ( Lim 
dom  R1  ->  ( (
rank `  A )  e.  dom  R1  <->  suc  ( rank `  A )  e.  dom  R1 ) )
1412, 13ax-mp 5 . . . . . 6  |-  ( (
rank `  A )  e.  dom  R1  <->  suc  ( rank `  A )  e.  dom  R1 )
154, 14mpbi 208 . . . . 5  |-  suc  ( rank `  A )  e. 
dom  R1
16 r1sucg 8178 . . . . 5  |-  ( suc  ( rank `  A
)  e.  dom  R1  ->  ( R1 `  suc  suc  ( rank `  A
) )  =  ~P ( R1 `  suc  ( rank `  A ) ) )
1715, 16ax-mp 5 . . . 4  |-  ( R1
`  suc  suc  ( rank `  A ) )  =  ~P ( R1 `  suc  ( rank `  A
) )
1810, 17syl6eleqr 2553 . . 3  |-  ( A  e.  U. ( R1
" On )  ->  ~P A  e.  ( R1 `  suc  suc  ( rank `  A ) ) )
19 r1elwf 8205 . . 3  |-  ( ~P A  e.  ( R1
`  suc  suc  ( rank `  A ) )  ->  ~P A  e.  U. ( R1 " On ) )
2018, 19syl 16 . 2  |-  ( A  e.  U. ( R1
" On )  ->  ~P A  e.  U. ( R1 " On ) )
21 r1elssi 8214 . . 3  |-  ( ~P A  e.  U. ( R1 " On )  ->  ~P A  C_  U. ( R1 " On ) )
22 elex 3115 . . . . 5  |-  ( ~P A  e.  U. ( R1 " On )  ->  ~P A  e.  _V )
23 pwexb 6584 . . . . 5  |-  ( A  e.  _V  <->  ~P A  e.  _V )
2422, 23sylibr 212 . . . 4  |-  ( ~P A  e.  U. ( R1 " On )  ->  A  e.  _V )
25 pwidg 4012 . . . 4  |-  ( A  e.  _V  ->  A  e.  ~P A )
2624, 25syl 16 . . 3  |-  ( ~P A  e.  U. ( R1 " On )  ->  A  e.  ~P A
)
2721, 26sseldd 3490 . 2  |-  ( ~P A  e.  U. ( R1 " On )  ->  A  e.  U. ( R1 " On ) )
2820, 27impbii 188 1  |-  ( A  e.  U. ( R1
" On )  <->  ~P A  e.  U. ( R1 " On ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    = wceq 1398    e. wcel 1823   _Vcvv 3106    C_ wss 3461   ~Pcpw 3999   U.cuni 4235   Oncon0 4867   Lim wlim 4868   suc csuc 4869   dom cdm 4988   "cima 4991   Fun wfun 5564   ` cfv 5570   R1cr1 8171   rankcrnk 8172
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-tp 4021  df-op 4023  df-uni 4236  df-int 4272  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-tr 4533  df-eprel 4780  df-id 4784  df-po 4789  df-so 4790  df-fr 4827  df-we 4829  df-ord 4870  df-on 4871  df-lim 4872  df-suc 4873  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-om 6674  df-recs 7034  df-rdg 7068  df-r1 8173  df-rank 8174
This theorem is referenced by:  snwf  8218  uniwf  8228  rankpwi  8232  r1pw  8254  r1pwcl  8256  dfac12r  8517  wfgru  9183
  Copyright terms: Public domain W3C validator