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

Theorem unipr 4636
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 1972 . . . 4 (∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
2 vex 3390 . . . . . . . 8 𝑦 ∈ V
32elpr 4387 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴𝑦 = 𝐵))
43anbi2i 611 . . . . . 6 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ (𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)))
5 andi 1021 . . . . . 6 ((𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
64, 5bitri 266 . . . . 5 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
76exbii 1933 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
8 unipr.1 . . . . . . 7 𝐴 ∈ V
98clel3 3532 . . . . . 6 (𝑥𝐴 ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
10 exancom 1947 . . . . . 6 (∃𝑦(𝑦 = 𝐴𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
119, 10bitri 266 . . . . 5 (𝑥𝐴 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
12 unipr.2 . . . . . . 7 𝐵 ∈ V
1312clel3 3532 . . . . . 6 (𝑥𝐵 ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
14 exancom 1947 . . . . . 6 (∃𝑦(𝑦 = 𝐵𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1513, 14bitri 266 . . . . 5 (𝑥𝐵 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1611, 15orbi12i 929 . . . 4 ((𝑥𝐴𝑥𝐵) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
171, 7, 163bitr4ri 295 . . 3 ((𝑥𝐴𝑥𝐵) ↔ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}))
1817abbii 2919 . 2 {𝑥 ∣ (𝑥𝐴𝑥𝐵)} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
19 df-un 3768 . 2 (𝐴𝐵) = {𝑥 ∣ (𝑥𝐴𝑥𝐵)}
20 df-uni 4624 . 2 {𝐴, 𝐵} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
2118, 19, 203eqtr4ri 2835 1 {𝐴, 𝐵} = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wa 384  wo 865   = wceq 1637  wex 1859  wcel 2155  {cab 2788  Vcvv 3387  cun 3761  {cpr 4366   cuni 4623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2067  ax-7 2103  ax-9 2164  ax-10 2184  ax-11 2200  ax-12 2213  ax-13 2419  ax-ext 2781
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2060  df-clab 2789  df-cleq 2795  df-clel 2798  df-nfc 2933  df-v 3389  df-un 3768  df-sn 4365  df-pr 4367  df-uni 4624
This theorem is referenced by:  uniprg  4637  unisnOLD  4640  uniintsn  4699  uniop  5164  unex  7180  rankxplim  8983  mrcun  16481  indistps  21023  indistps2  21024  leordtval2  21224  ex-uni  27608  fouriersw  40921
  Copyright terms: Public domain W3C validator