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

Theorem unipr 4385
 Description: The union of a pair is the union of its members. Proposition 5.7 of [TakeutiZaring] p. 16. (Contributed by NM, 23-Aug-1993.)
Hypotheses
Ref Expression
unipr.1 𝐴 ∈ V
unipr.2 𝐵 ∈ V
Assertion
Ref Expression
unipr {𝐴, 𝐵} = (𝐴𝐵)

Proof of Theorem unipr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.43 1799 . . . 4 (∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
2 vex 3176 . . . . . . . 8 𝑦 ∈ V
32elpr 4146 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴𝑦 = 𝐵))
43anbi2i 726 . . . . . 6 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ (𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)))
5 andi 907 . . . . . 6 ((𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
64, 5bitri 263 . . . . 5 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
76exbii 1764 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
8 unipr.1 . . . . . . 7 𝐴 ∈ V
98clel3 3311 . . . . . 6 (𝑥𝐴 ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
10 exancom 1774 . . . . . 6 (∃𝑦(𝑦 = 𝐴𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
119, 10bitri 263 . . . . 5 (𝑥𝐴 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
12 unipr.2 . . . . . . 7 𝐵 ∈ V
1312clel3 3311 . . . . . 6 (𝑥𝐵 ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
14 exancom 1774 . . . . . 6 (∃𝑦(𝑦 = 𝐵𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1513, 14bitri 263 . . . . 5 (𝑥𝐵 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1611, 15orbi12i 542 . . . 4 ((𝑥𝐴𝑥𝐵) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
171, 7, 163bitr4ri 292 . . 3 ((𝑥𝐴𝑥𝐵) ↔ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}))
1817abbii 2726 . 2 {𝑥 ∣ (𝑥𝐴𝑥𝐵)} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
19 df-un 3545 . 2 (𝐴𝐵) = {𝑥 ∣ (𝑥𝐴𝑥𝐵)}
20 df-uni 4373 . 2 {𝐴, 𝐵} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
2118, 19, 203eqtr4ri 2643 1 {𝐴, 𝐵} = (𝐴𝐵)
 Colors of variables: wff setvar class Syntax hints:   ∨ wo 382   ∧ wa 383   = wceq 1475  ∃wex 1695   ∈ wcel 1977  {cab 2596  Vcvv 3173   ∪ cun 3538  {cpr 4127  ∪ 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-un 3545  df-sn 4126  df-pr 4128  df-uni 4373 This theorem is referenced by:  uniprg  4386  unisn  4387  uniintsn  4449  uniop  4902  unex  6854  rankxplim  8625  mrcun  16105  indistps  20625  indistps2  20626  leordtval2  20826  ex-uni  26675  fouriersw  39124
 Copyright terms: Public domain W3C validator