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

Theorem r1pw 9824
Description: A stronger property of 𝑅1 than rankpw 9822. The latter merely proves that 𝑅1 of the successor is a power set, but here we prove that if 𝐴 is in the cumulative hierarchy, then 𝒫 𝐴 is in the cumulative hierarchy of the successor. (Contributed by Raph Levien, 29-May-2004.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
r1pw (𝐵 ∈ On → (𝐴 ∈ (𝑅1𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))

Proof of Theorem r1pw
StepHypRef Expression
1 rankpwi 9802 . . . . . 6 (𝐴 (𝑅1 “ On) → (rank‘𝒫 𝐴) = suc (rank‘𝐴))
21eleq1d 2850 . . . . 5 (𝐴 (𝑅1 “ On) → ((rank‘𝒫 𝐴) ∈ suc 𝐵 ↔ suc (rank‘𝐴) ∈ suc 𝐵))
3 eloni 6374 . . . . . . 7 (𝐵 ∈ On → Ord 𝐵)
4 ordsucelsuc 7824 . . . . . . 7 (Ord 𝐵 → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ suc 𝐵))
53, 4syl 18 . . . . . 6 (𝐵 ∈ On → ((rank‘𝐴) ∈ 𝐵 ↔ suc (rank‘𝐴) ∈ suc 𝐵))
65bicomd 226 . . . . 5 (𝐵 ∈ On → (suc (rank‘𝐴) ∈ suc 𝐵 ↔ (rank‘𝐴) ∈ 𝐵))
72, 6sylan9bb 519 . . . 4 ((𝐴 (𝑅1 “ On) ∧ 𝐵 ∈ On) → ((rank‘𝒫 𝐴) ∈ suc 𝐵 ↔ (rank‘𝐴) ∈ 𝐵))
8 pwwf 9786 . . . . . 6 (𝐴 (𝑅1 “ On) ↔ 𝒫 𝐴 (𝑅1 “ On))
98biimpi 219 . . . . 5 (𝐴 (𝑅1 “ On) → 𝒫 𝐴 (𝑅1 “ On))
10 onsuc 7815 . . . . . 6 (𝐵 ∈ On → suc 𝐵 ∈ On)
11 r1fnon 9746 . . . . . . 7 𝑅1 Fn On
1211fndmi 6643 . . . . . 6 dom 𝑅1 = On
1310, 12eleqtrrdi 2876 . . . . 5 (𝐵 ∈ On → suc 𝐵 ∈ dom 𝑅1)
14 rankr1ag 9781 . . . . 5 ((𝒫 𝐴 (𝑅1 “ On) ∧ suc 𝐵 ∈ dom 𝑅1) → (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝐴) ∈ suc 𝐵))
159, 13, 14syl2an 608 . . . 4 ((𝐴 (𝑅1 “ On) ∧ 𝐵 ∈ On) → (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) ↔ (rank‘𝒫 𝐴) ∈ suc 𝐵))
1612eleq2i 2857 . . . . 5 (𝐵 ∈ dom 𝑅1𝐵 ∈ On)
17 rankr1ag 9781 . . . . 5 ((𝐴 (𝑅1 “ On) ∧ 𝐵 ∈ dom 𝑅1) → (𝐴 ∈ (𝑅1𝐵) ↔ (rank‘𝐴) ∈ 𝐵))
1816, 17sylan2br 607 . . . 4 ((𝐴 (𝑅1 “ On) ∧ 𝐵 ∈ On) → (𝐴 ∈ (𝑅1𝐵) ↔ (rank‘𝐴) ∈ 𝐵))
197, 15, 183bitr4rd 315 . . 3 ((𝐴 (𝑅1 “ On) ∧ 𝐵 ∈ On) → (𝐴 ∈ (𝑅1𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))
2019ex 418 . 2 (𝐴 (𝑅1 “ On) → (𝐵 ∈ On → (𝐴 ∈ (𝑅1𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))))
21 r1elwf 9775 . . . 4 (𝐴 ∈ (𝑅1𝐵) → 𝐴 (𝑅1 “ On))
22 r1elwf 9775 . . . . . 6 (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 (𝑅1 “ On))
23 r1elssi 9784 . . . . . 6 (𝒫 𝐴 (𝑅1 “ On) → 𝒫 𝐴 (𝑅1 “ On))
2422, 23syl 18 . . . . 5 (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝒫 𝐴 (𝑅1 “ On))
25 ssid 3960 . . . . . 6 𝐴𝐴
26 pwexr 7770 . . . . . . 7 (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ V)
27 elpwg 4567 . . . . . . 7 (𝐴 ∈ V → (𝐴 ∈ 𝒫 𝐴𝐴𝐴))
2826, 27syl 18 . . . . . 6 (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → (𝐴 ∈ 𝒫 𝐴𝐴𝐴))
2925, 28mpbiri 261 . . . . 5 (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 ∈ 𝒫 𝐴)
3024, 29sseldd 3939 . . . 4 (𝒫 𝐴 ∈ (𝑅1‘suc 𝐵) → 𝐴 (𝑅1 “ On))
3121, 30pm5.21ni 380 . . 3 𝐴 (𝑅1 “ On) → (𝐴 ∈ (𝑅1𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))
3231a1d 26 . 2 𝐴 (𝑅1 “ On) → (𝐵 ∈ On → (𝐴 ∈ (𝑅1𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵))))
3320, 32pm2.61i 184 1 (𝐵 ∈ On → (𝐴 ∈ (𝑅1𝐵) ↔ 𝒫 𝐴 ∈ (𝑅1‘suc 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wcel 2146  Vcvv 3457  wss 3906  𝒫 cpw 4564   cuni 4874  dom cdm 5663  cima 5666  Ord word 6363  Oncon0 6364  suc csuc 6366  cfv 6540  𝑅1cr1 9741  rankcrnk 9742
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-r1 9743  df-rank 9744
This theorem is used by:  inatsk  10778
  Copyright terms: Public domain W3C validator