Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  rankpwi Structured version   Visualization version   GIF version

Theorem rankpwi 9244
 Description: The rank of a power set. Part of Exercise 30 of [Enderton] p. 207. (Contributed by Mario Carneiro, 3-Jun-2013.)
Assertion
Ref Expression
rankpwi (𝐴 (𝑅1 “ On) → (rank‘𝒫 𝐴) = suc (rank‘𝐴))

Proof of Theorem rankpwi
StepHypRef Expression
1 rankidn 9243 . . . 4 (𝐴 (𝑅1 “ On) → ¬ 𝐴 ∈ (𝑅1‘(rank‘𝐴)))
2 rankon 9216 . . . . . . 7 (rank‘𝐴) ∈ On
3 r1suc 9191 . . . . . . 7 ((rank‘𝐴) ∈ On → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
42, 3ax-mp 5 . . . . . 6 (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴))
54eleq2i 2902 . . . . 5 (𝒫 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) ↔ 𝒫 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
6 elpwi 4549 . . . . . 6 (𝒫 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) → 𝒫 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
7 pwidg 4554 . . . . . 6 (𝐴 (𝑅1 “ On) → 𝐴 ∈ 𝒫 𝐴)
8 ssel 3959 . . . . . 6 (𝒫 𝐴 ⊆ (𝑅1‘(rank‘𝐴)) → (𝐴 ∈ 𝒫 𝐴𝐴 ∈ (𝑅1‘(rank‘𝐴))))
96, 7, 8syl2imc 41 . . . . 5 (𝐴 (𝑅1 “ On) → (𝒫 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
105, 9syl5bi 244 . . . 4 (𝐴 (𝑅1 “ On) → (𝒫 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) → 𝐴 ∈ (𝑅1‘(rank‘𝐴))))
111, 10mtod 200 . . 3 (𝐴 (𝑅1 “ On) → ¬ 𝒫 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
12 r1rankidb 9225 . . . . . . 7 (𝐴 (𝑅1 “ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
13 sspwb 5332 . . . . . . 7 (𝐴 ⊆ (𝑅1‘(rank‘𝐴)) ↔ 𝒫 𝐴 ⊆ 𝒫 (𝑅1‘(rank‘𝐴)))
1412, 13sylib 220 . . . . . 6 (𝐴 (𝑅1 “ On) → 𝒫 𝐴 ⊆ 𝒫 (𝑅1‘(rank‘𝐴)))
1514, 4sseqtrrdi 4016 . . . . 5 (𝐴 (𝑅1 “ On) → 𝒫 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴)))
16 fvex 6676 . . . . . 6 (𝑅1‘suc (rank‘𝐴)) ∈ V
1716elpw2 5239 . . . . 5 (𝒫 𝐴 ∈ 𝒫 (𝑅1‘suc (rank‘𝐴)) ↔ 𝒫 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴)))
1815, 17sylibr 236 . . . 4 (𝐴 (𝑅1 “ On) → 𝒫 𝐴 ∈ 𝒫 (𝑅1‘suc (rank‘𝐴)))
192onsuci 7545 . . . . 5 suc (rank‘𝐴) ∈ On
20 r1suc 9191 . . . . 5 (suc (rank‘𝐴) ∈ On → (𝑅1‘suc suc (rank‘𝐴)) = 𝒫 (𝑅1‘suc (rank‘𝐴)))
2119, 20ax-mp 5 . . . 4 (𝑅1‘suc suc (rank‘𝐴)) = 𝒫 (𝑅1‘suc (rank‘𝐴))
2218, 21eleqtrrdi 2922 . . 3 (𝐴 (𝑅1 “ On) → 𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴)))
23 pwwf 9228 . . . 4 (𝐴 (𝑅1 “ On) ↔ 𝒫 𝐴 (𝑅1 “ On))
24 rankr1c 9242 . . . 4 (𝒫 𝐴 (𝑅1 “ On) → (suc (rank‘𝐴) = (rank‘𝒫 𝐴) ↔ (¬ 𝒫 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) ∧ 𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴)))))
2523, 24sylbi 219 . . 3 (𝐴 (𝑅1 “ On) → (suc (rank‘𝐴) = (rank‘𝒫 𝐴) ↔ (¬ 𝒫 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)) ∧ 𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴)))))
2611, 22, 25mpbir2and 711 . 2 (𝐴 (𝑅1 “ On) → suc (rank‘𝐴) = (rank‘𝒫 𝐴))
2726eqcomd 2825 1 (𝐴 (𝑅1 “ On) → (rank‘𝒫 𝐴) = suc (rank‘𝐴))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1530   ∈ wcel 2107   ⊆ wss 3934  𝒫 cpw 4537  ∪ cuni 4830   “ cima 5551  Oncon0 6184  suc csuc 6186  ‘cfv 6348  𝑅1cr1 9183  rankcrnk 9184 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-int 4868  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-om 7573  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-r1 9185  df-rank 9186 This theorem is referenced by:  rankpw  9264  r1pw  9266  r1pwcl  9268
 Copyright terms: Public domain W3C validator