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

Theorem ranklim 9533
Description: The rank of a set belongs to a limit ordinal iff the rank of its power set does. (Contributed by NM, 18-Sep-2006.)
Assertion
Ref Expression
ranklim (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ (rank‘𝒫 𝐴) ∈ 𝐵))

Proof of Theorem ranklim
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 limsuc 7671 . . . 4 (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
21adantl 481 . . 3 ((𝐴 ∈ V ∧ Lim 𝐵) → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
3 pweq 4546 . . . . . . . 8 (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴)
43fveq2d 6760 . . . . . . 7 (𝑥 = 𝐴 → (rank‘𝒫 𝑥) = (rank‘𝒫 𝐴))
5 fveq2 6756 . . . . . . . 8 (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
6 suceq 6316 . . . . . . . 8 ((rank‘𝑥) = (rank‘𝐴) → suc (rank‘𝑥) = suc (rank‘𝐴))
75, 6syl 17 . . . . . . 7 (𝑥 = 𝐴 → suc (rank‘𝑥) = suc (rank‘𝐴))
84, 7eqeq12d 2754 . . . . . 6 (𝑥 = 𝐴 → ((rank‘𝒫 𝑥) = suc (rank‘𝑥) ↔ (rank‘𝒫 𝐴) = suc (rank‘𝐴)))
9 vex 3426 . . . . . . 7 𝑥 ∈ V
109rankpw 9532 . . . . . 6 (rank‘𝒫 𝑥) = suc (rank‘𝑥)
118, 10vtoclg 3495 . . . . 5 (𝐴 ∈ V → (rank‘𝒫 𝐴) = suc (rank‘𝐴))
1211eleq1d 2823 . . . 4 (𝐴 ∈ V → ((rank‘𝒫 𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
1312adantr 480 . . 3 ((𝐴 ∈ V ∧ Lim 𝐵) → ((rank‘𝒫 𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ 𝐵))
142, 13bitr4d 281 . 2 ((𝐴 ∈ V ∧ Lim 𝐵) → ((rank‘𝐴) ∈ 𝐵 ↔ (rank‘𝒫 𝐴) ∈ 𝐵))
15 fvprc 6748 . . . . 5 𝐴 ∈ V → (rank‘𝐴) = ∅)
16 pwexb 7594 . . . . . 6 (𝐴 ∈ V ↔ 𝒫 𝐴 ∈ V)
17 fvprc 6748 . . . . . 6 (¬ 𝒫 𝐴 ∈ V → (rank‘𝒫 𝐴) = ∅)
1816, 17sylnbi 329 . . . . 5 𝐴 ∈ V → (rank‘𝒫 𝐴) = ∅)
1915, 18eqtr4d 2781 . . . 4 𝐴 ∈ V → (rank‘𝐴) = (rank‘𝒫 𝐴))
2019eleq1d 2823 . . 3 𝐴 ∈ V → ((rank‘𝐴) ∈ 𝐵 ↔ (rank‘𝒫 𝐴) ∈ 𝐵))
2120adantr 480 . 2 ((¬ 𝐴 ∈ V ∧ Lim 𝐵) → ((rank‘𝐴) ∈ 𝐵 ↔ (rank‘𝒫 𝐴) ∈ 𝐵))
2214, 21pm2.61ian 808 1 (Lim 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ (rank‘𝒫 𝐴) ∈ 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  Vcvv 3422  c0 4253  𝒫 cpw 4530  Lim wlim 6252  suc csuc 6253  cfv 6418  rankcrnk 9452
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-reg 9281  ax-inf2 9329
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-r1 9453  df-rank 9454
This theorem is referenced by:  rankxplim  9568
  Copyright terms: Public domain W3C validator