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

Theorem uniprOLD 4928
Description: Obsolete version of unipr 4927 as of 1-Sep-2024. (Contributed by NM, 23-Aug-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
unipr.1 𝐴 ∈ V
unipr.2 𝐵 ∈ V
Assertion
Ref Expression
uniprOLD {𝐴, 𝐵} = (𝐴𝐵)

Proof of Theorem uniprOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.43 1886 . . . 4 (∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
2 vex 3479 . . . . . . . 8 𝑦 ∈ V
32elpr 4652 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴𝑦 = 𝐵))
43anbi2i 624 . . . . . 6 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ (𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)))
5 andi 1007 . . . . . 6 ((𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
64, 5bitri 275 . . . . 5 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
76exbii 1851 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
8 unipr.1 . . . . . . 7 𝐴 ∈ V
98clel3 3652 . . . . . 6 (𝑥𝐴 ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
10 exancom 1865 . . . . . 6 (∃𝑦(𝑦 = 𝐴𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
119, 10bitri 275 . . . . 5 (𝑥𝐴 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
12 unipr.2 . . . . . . 7 𝐵 ∈ V
1312clel3 3652 . . . . . 6 (𝑥𝐵 ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
14 exancom 1865 . . . . . 6 (∃𝑦(𝑦 = 𝐵𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1513, 14bitri 275 . . . . 5 (𝑥𝐵 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1611, 15orbi12i 914 . . . 4 ((𝑥𝐴𝑥𝐵) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
171, 7, 163bitr4ri 304 . . 3 ((𝑥𝐴𝑥𝐵) ↔ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}))
1817abbii 2803 . 2 {𝑥 ∣ (𝑥𝐴𝑥𝐵)} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
19 df-un 3954 . 2 (𝐴𝐵) = {𝑥 ∣ (𝑥𝐴𝑥𝐵)}
20 df-uni 4910 . 2 {𝐴, 𝐵} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
2118, 19, 203eqtr4ri 2772 1 {𝐴, 𝐵} = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wa 397  wo 846   = wceq 1542  wex 1782  wcel 2107  {cab 2710  Vcvv 3475  cun 3947  {cpr 4631   cuni 4909
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-v 3477  df-un 3954  df-sn 4630  df-pr 4632  df-uni 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator