MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pwne Structured version   Visualization version   GIF version

Theorem pwne 5321
Description: No set equals its power set. The sethood antecedent is necessary; compare pwv 4578. (Contributed by NM, 17-Nov-2008.) (Proof shortened by Mario Carneiro, 23-Dec-2016.)
Assertion
Ref Expression
pwne (𝐴 ∈ 𝑉 → 𝒫 𝐴 ≠ 𝐴)

Proof of Theorem pwne
StepHypRef Expression
1 pwnss 5320 . 2 (𝐴 ∈ 𝑉 → ¬ 𝒫 𝐴 ⊆ 𝐴)
2 eqimss 3971 . . 3 (𝒫 𝐴 = 𝐴 → 𝒫 𝐴 ⊆ 𝐴)
32necon3bi 2985 . 2 (¬ 𝒫 𝐴 ⊆ 𝐴 → 𝒫 𝐴 ≠ 𝐴)
41, 3syl 18 1 (𝐴 ∈ 𝑉 → 𝒫 𝐴 ≠ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∈ wcel 2147   ≠ wne 2959   ⊆ wss 3900  𝒫 cpw 4560
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-pw 4562
This theorem is used by:  pnfnemnf  11403
  Copyright terms: Public domain W3C validator