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

Theorem uniin 4393
 Description: The class union of the intersection of two classes. Exercise 4.12(n) of [Mendelson] p. 235. See uniinqs 7714 for a condition where equality holds. (Contributed by NM, 4-Dec-2003.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
uniin (𝐴𝐵) ⊆ ( 𝐴 𝐵)

Proof of Theorem uniin
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.40 1785 . . . 4 (∃𝑦((𝑥𝑦𝑦𝐴) ∧ (𝑥𝑦𝑦𝐵)) → (∃𝑦(𝑥𝑦𝑦𝐴) ∧ ∃𝑦(𝑥𝑦𝑦𝐵)))
2 elin 3758 . . . . . . 7 (𝑦 ∈ (𝐴𝐵) ↔ (𝑦𝐴𝑦𝐵))
32anbi2i 726 . . . . . 6 ((𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ (𝑥𝑦 ∧ (𝑦𝐴𝑦𝐵)))
4 anandi 867 . . . . . 6 ((𝑥𝑦 ∧ (𝑦𝐴𝑦𝐵)) ↔ ((𝑥𝑦𝑦𝐴) ∧ (𝑥𝑦𝑦𝐵)))
53, 4bitri 263 . . . . 5 ((𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ ((𝑥𝑦𝑦𝐴) ∧ (𝑥𝑦𝑦𝐵)))
65exbii 1764 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ ∃𝑦((𝑥𝑦𝑦𝐴) ∧ (𝑥𝑦𝑦𝐵)))
7 eluni 4375 . . . . 5 (𝑥 𝐴 ↔ ∃𝑦(𝑥𝑦𝑦𝐴))
8 eluni 4375 . . . . 5 (𝑥 𝐵 ↔ ∃𝑦(𝑥𝑦𝑦𝐵))
97, 8anbi12i 729 . . . 4 ((𝑥 𝐴𝑥 𝐵) ↔ (∃𝑦(𝑥𝑦𝑦𝐴) ∧ ∃𝑦(𝑥𝑦𝑦𝐵)))
101, 6, 93imtr4i 280 . . 3 (∃𝑦(𝑥𝑦𝑦 ∈ (𝐴𝐵)) → (𝑥 𝐴𝑥 𝐵))
11 eluni 4375 . . 3 (𝑥 (𝐴𝐵) ↔ ∃𝑦(𝑥𝑦𝑦 ∈ (𝐴𝐵)))
12 elin 3758 . . 3 (𝑥 ∈ ( 𝐴 𝐵) ↔ (𝑥 𝐴𝑥 𝐵))
1310, 11, 123imtr4i 280 . 2 (𝑥 (𝐴𝐵) → 𝑥 ∈ ( 𝐴 𝐵))
1413ssriv 3572 1 (𝐴𝐵) ⊆ ( 𝐴 𝐵)
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 383  ∃wex 1695   ∈ wcel 1977   ∩ cin 3539   ⊆ wss 3540  ∪ cuni 4372 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-v 3175  df-in 3547  df-ss 3554  df-uni 4373 This theorem is referenced by:  uniinqs  7714  psss  17037  tgval  20570  mapdunirnN  35957
 Copyright terms: Public domain W3C validator