Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pwwf | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
pwwf | ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r1rankidb 9493 | . . . . . . 7 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴))) | |
2 | 1 | sspwd 4545 | . . . . . 6 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ 𝒫 (𝑅1‘(rank‘𝐴))) |
3 | rankdmr1 9490 | . . . . . . 7 ⊢ (rank‘𝐴) ∈ dom 𝑅1 | |
4 | r1sucg 9458 | . . . . . . 7 ⊢ ((rank‘𝐴) ∈ dom 𝑅1 → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴))) | |
5 | 3, 4 | ax-mp 5 | . . . . . 6 ⊢ (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)) |
6 | 2, 5 | sseqtrrdi 3968 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴))) |
7 | fvex 6769 | . . . . . 6 ⊢ (𝑅1‘suc (rank‘𝐴)) ∈ V | |
8 | 7 | elpw2 5264 | . . . . 5 ⊢ (𝒫 𝐴 ∈ 𝒫 (𝑅1‘suc (rank‘𝐴)) ↔ 𝒫 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴))) |
9 | 6, 8 | sylibr 233 | . . . 4 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ 𝒫 (𝑅1‘suc (rank‘𝐴))) |
10 | r1funlim 9455 | . . . . . . . 8 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
11 | 10 | simpri 485 | . . . . . . 7 ⊢ Lim dom 𝑅1 |
12 | limsuc 7671 | . . . . . . 7 ⊢ (Lim dom 𝑅1 → ((rank‘𝐴) ∈ dom 𝑅1 ↔ suc (rank‘𝐴) ∈ dom 𝑅1)) | |
13 | 11, 12 | ax-mp 5 | . . . . . 6 ⊢ ((rank‘𝐴) ∈ dom 𝑅1 ↔ suc (rank‘𝐴) ∈ dom 𝑅1) |
14 | 3, 13 | mpbi 229 | . . . . 5 ⊢ suc (rank‘𝐴) ∈ dom 𝑅1 |
15 | r1sucg 9458 | . . . . 5 ⊢ (suc (rank‘𝐴) ∈ dom 𝑅1 → (𝑅1‘suc suc (rank‘𝐴)) = 𝒫 (𝑅1‘suc (rank‘𝐴))) | |
16 | 14, 15 | ax-mp 5 | . . . 4 ⊢ (𝑅1‘suc suc (rank‘𝐴)) = 𝒫 (𝑅1‘suc (rank‘𝐴)) |
17 | 9, 16 | eleqtrrdi 2850 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴))) |
18 | r1elwf 9485 | . . 3 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴)) → 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) | |
19 | 17, 18 | syl 17 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) |
20 | r1elssi 9494 | . . 3 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ ∪ (𝑅1 “ On)) | |
21 | pwexr 7593 | . . . 4 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ V) | |
22 | pwidg 4552 | . . . 4 ⊢ (𝐴 ∈ V → 𝐴 ∈ 𝒫 𝐴) | |
23 | 21, 22 | syl 17 | . . 3 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ 𝒫 𝐴) |
24 | 20, 23 | sseldd 3918 | . 2 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
25 | 19, 24 | impbii 208 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ⊆ wss 3883 𝒫 cpw 4530 ∪ cuni 4836 dom cdm 5580 “ cima 5583 Oncon0 6251 Lim wlim 6252 suc csuc 6253 Fun wfun 6412 ‘cfv 6418 𝑅1cr1 9451 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-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
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: snwf 9498 uniwf 9508 rankpwi 9512 r1pw 9534 r1pwcl 9536 dfac12r 9833 wfgru 10503 |
Copyright terms: Public domain | W3C validator |