Theorem pwexr 7766

Description: Converse of the Axiom of Power Sets. Note that it does not require ax-pow 5338. (Contributed by NM, 11-Nov-2003.)

Assertion

Ref	Expression
pwexr	⊢ (𝒫 𝐴 ∈ 𝑉 → 𝐴 ∈ V)

Proof of Theorem pwexr

Step	Hyp	Ref	Expression
1		unipw 5433	. 2 ⊢ ∪ 𝒫 𝐴 = 𝐴
2		uniexg 7744	. 2 ⊢ (𝒫 𝐴 ∈ 𝑉 → ∪ 𝒫 𝐴 ∈ V)
3	1, 2	eqeltrrid 2870	1 ⊢ (𝒫 𝐴 ∈ 𝑉 → 𝐴 ∈ V)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146  Vcvv 3457  𝒫 cpw 4564  ∪ cuni 4874

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 2737  ax-sep 5259  ax-pr 5406  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-un 3911  df-ss 3923  df-pw 4566  df-sn 4592  df-pr 4594  df-uni 4875

This theorem is used by:  pwexb  7767  pwuninelOLD  8274  pwwf  9782  r1pw  9820  isfin3  10291  dis2ndc  23646  numufl  24101  bj-discrmoore  37786