| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pwexg | GIF version | ||
| Description: Power set axiom expressed in class notation, with the sethood requirement as an antecedent. (Contributed by NM, 30-Oct-2003.) |
| Ref | Expression |
|---|---|
| pwexg | ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pweq 3655 | . . 3 ⊢ (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴) | |
| 2 | 1 | eleq1d 2300 | . 2 ⊢ (𝑥 = 𝐴 → (𝒫 𝑥 ∈ V ↔ 𝒫 𝐴 ∈ V)) |
| 3 | vpwex 4269 | . 2 ⊢ 𝒫 𝑥 ∈ V | |
| 4 | 2, 3 | vtoclg 2864 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 Vcvv 2802 𝒫 cpw 3652 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-in 3206 df-ss 3213 df-pw 3654 |
| This theorem is referenced by: pwexd 4271 abssexg 4272 pwex 4273 snexg 4274 pwel 4310 uniexb 4570 xpexg 4840 fabexg 5524 mapex 6823 pmvalg 6828 fopwdom 7022 ssenen 7037 restid2 13336 toponsspwpwg 14752 tgdom 14802 distop 14815 epttop 14820 cldval 14829 ntrfval 14830 clsfval 14831 neifval 14870 neif 14871 neival 14873 |
| Copyright terms: Public domain | W3C validator |