![]() |
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 9217 | . . . . . . 7 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴))) | |
2 | 1 | sspwd 4512 | . . . . . 6 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ 𝒫 (𝑅1‘(rank‘𝐴))) |
3 | rankdmr1 9214 | . . . . . . 7 ⊢ (rank‘𝐴) ∈ dom 𝑅1 | |
4 | r1sucg 9182 | . . . . . . 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 3966 | . . . . 5 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴))) |
7 | fvex 6658 | . . . . . 6 ⊢ (𝑅1‘suc (rank‘𝐴)) ∈ V | |
8 | 7 | elpw2 5212 | . . . . 5 ⊢ (𝒫 𝐴 ∈ 𝒫 (𝑅1‘suc (rank‘𝐴)) ↔ 𝒫 𝐴 ⊆ (𝑅1‘suc (rank‘𝐴))) |
9 | 6, 8 | sylibr 237 | . . . 4 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ 𝒫 (𝑅1‘suc (rank‘𝐴))) |
10 | r1funlim 9179 | . . . . . . . 8 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1) | |
11 | 10 | simpri 489 | . . . . . . 7 ⊢ Lim dom 𝑅1 |
12 | limsuc 7544 | . . . . . . 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 233 | . . . . 5 ⊢ suc (rank‘𝐴) ∈ dom 𝑅1 |
15 | r1sucg 9182 | . . . . 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 2901 | . . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴))) |
18 | r1elwf 9209 | . . 3 ⊢ (𝒫 𝐴 ∈ (𝑅1‘suc suc (rank‘𝐴)) → 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) | |
19 | 17, 18 | syl 17 | . 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) |
20 | r1elssi 9218 | . . 3 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝒫 𝐴 ⊆ ∪ (𝑅1 “ On)) | |
21 | pwexr 7467 | . . . 4 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ V) | |
22 | pwidg 4519 | . . . 4 ⊢ (𝐴 ∈ V → 𝐴 ∈ 𝒫 𝐴) | |
23 | 21, 22 | syl 17 | . . 3 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ 𝒫 𝐴) |
24 | 20, 23 | sseldd 3916 | . 2 ⊢ (𝒫 𝐴 ∈ ∪ (𝑅1 “ On) → 𝐴 ∈ ∪ (𝑅1 “ On)) |
25 | 19, 24 | impbii 212 | 1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ 𝒫 𝐴 ∈ ∪ (𝑅1 “ On)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ⊆ wss 3881 𝒫 cpw 4497 ∪ cuni 4800 dom cdm 5519 “ cima 5522 Oncon0 6159 Lim wlim 6160 suc csuc 6161 Fun wfun 6318 ‘cfv 6324 𝑅1cr1 9175 rankcrnk 9176 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-r1 9177 df-rank 9178 |
This theorem is referenced by: snwf 9222 uniwf 9232 rankpwi 9236 r1pw 9258 r1pwcl 9260 dfac12r 9557 wfgru 10227 |
Copyright terms: Public domain | W3C validator |