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

Theorem unexb 7764
Description: Existence of union is equivalent to existence of its components. (Contributed by NM, 11-Jun-1998.)
Assertion
Ref Expression
unexb ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ∪ 𝐵) ∈ V)

Proof of Theorem unexb
StepHypRef Expression
1 unexg 7761 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V)
2 ssun1 4176 . . . 4 𝐴 ⊆ (𝐴 ∪ 𝐵)
3 ssexg 5280 . . . 4 ((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ V) → 𝐴 ∈ V)
42, 3mpan 703 . . 3 ((𝐴 ∪ 𝐵) ∈ V → 𝐴 ∈ V)
5 ssun2 4177 . . . 4 𝐵 ⊆ (𝐴 ∪ 𝐵)
6 ssexg 5280 . . . 4 ((𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ∈ V) → 𝐵 ∈ V)
75, 6mpan 703 . . 3 ((𝐴 ∪ 𝐵) ∈ V → 𝐵 ∈ V)
84, 7jca 521 . 2 ((𝐴 ∪ 𝐵) ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V))
91, 8impbii 212 1 ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴 ∪ 𝐵) ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∪ cun 4149
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091  df-un 4151  df-sn 4585  df-pr 4587  df-uni 4867
This theorem is used by:  sucexb  7819  fodomr  9151  fsuppun  9383  fsuppunbi  9385  djuexb  9994  bj-tagex  37993
  Copyright terms: Public domain W3C validator