![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pwne | Structured version Visualization version GIF version |
Description: No set equals its power set. The sethood antecedent is necessary; compare pwv 4899. (Contributed by NM, 17-Nov-2008.) (Proof shortened by Mario Carneiro, 23-Dec-2016.) |
Ref | Expression |
---|---|
pwne | ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ≠ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pwnss 5343 | . 2 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝒫 𝐴 ⊆ 𝐴) | |
2 | eqimss 4037 | . . 3 ⊢ (𝒫 𝐴 = 𝐴 → 𝒫 𝐴 ⊆ 𝐴) | |
3 | 2 | necon3bi 2967 | . 2 ⊢ (¬ 𝒫 𝐴 ⊆ 𝐴 → 𝒫 𝐴 ≠ 𝐴) |
4 | 1, 3 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ≠ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∈ wcel 2106 ≠ wne 2940 ⊆ wss 3945 𝒫 cpw 4597 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 ax-sep 5293 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-ne 2941 df-rab 3433 df-v 3476 df-in 3952 df-ss 3962 df-pw 4599 |
This theorem is referenced by: pnfnemnf 11253 |
Copyright terms: Public domain | W3C validator |