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

Theorem uniexr 7777
Description: Converse of the Axiom of Union. Note that it does not require ax-un 7751. (Contributed by NM, 11-Nov-2003.)
Assertion
Ref Expression
uniexr (∪ 𝐴 ∈ 𝑉 → 𝐴 ∈ V)

Proof of Theorem uniexr
StepHypRef Expression
1 pwuni 4906 . 2 𝐴 ⊆ 𝒫 ∪ 𝐴
2 pwexg 5340 . 2 (∪ 𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ V)
3 ssexg 5281 . 2 ((𝐴 ⊆ 𝒫 ∪ 𝐴 ∧ 𝒫 ∪ 𝐴 ∈ V) → 𝐴 ∈ V)
41, 2, 3sylancr 599 1 (∪ 𝐴 ∈ 𝑉 → 𝐴 ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867
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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pow 5327
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 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-in 3906  df-ss 3916  df-pw 4559  df-uni 4868
This theorem is used by:  uniexb  7778  ssonprc  7801  ac5num  10115  bj-restv  38016  bj-mooreset  38023  ipoglb0  50101
  Copyright terms: Public domain W3C validator