| 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 4874. (Contributed by NM, 17-Nov-2008.) (Proof shortened by Mario Carneiro, 23-Dec-2016.) |
| Ref | Expression |
|---|---|
| pwne | ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ≠ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pwnss 5327 | . 2 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝒫 𝐴 ⊆ 𝐴) | |
| 2 | eqimss 3998 | . . 3 ⊢ (𝒫 𝐴 = 𝐴 → 𝒫 𝐴 ⊆ 𝐴) | |
| 3 | 2 | necon3bi 2987 | . 2 ⊢ (¬ 𝒫 𝐴 ⊆ 𝐴 → 𝒫 𝐴 ≠ 𝐴) |
| 4 | 1, 3 | syl 18 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ≠ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∈ wcel 2146 ≠ wne 2961 ⊆ wss 3908 𝒫 cpw 4567 |
| 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-ext 2738 ax-sep 5262 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-rab 3420 df-v 3460 df-in 3915 df-ss 3925 df-pw 4569 |
| This theorem is used by: pnfnemnf 11282 |
| Copyright terms: Public domain | W3C validator |