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

Theorem uniprOLD 4869
Description: Obsolete version of unipr 4868 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 1884 . . . 4 (∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
2 vex 3445 . . . . . . . 8 𝑦 ∈ V
32elpr 4594 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴𝑦 = 𝐵))
43anbi2i 623 . . . . . 6 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ (𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)))
5 andi 1005 . . . . . 6 ((𝑥𝑦 ∧ (𝑦 = 𝐴𝑦 = 𝐵)) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
64, 5bitri 274 . . . . 5 ((𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
76exbii 1849 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}) ↔ ∃𝑦((𝑥𝑦𝑦 = 𝐴) ∨ (𝑥𝑦𝑦 = 𝐵)))
8 unipr.1 . . . . . . 7 𝐴 ∈ V
98clel3 3602 . . . . . 6 (𝑥𝐴 ↔ ∃𝑦(𝑦 = 𝐴𝑥𝑦))
10 exancom 1863 . . . . . 6 (∃𝑦(𝑦 = 𝐴𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
119, 10bitri 274 . . . . 5 (𝑥𝐴 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐴))
12 unipr.2 . . . . . . 7 𝐵 ∈ V
1312clel3 3602 . . . . . 6 (𝑥𝐵 ↔ ∃𝑦(𝑦 = 𝐵𝑥𝑦))
14 exancom 1863 . . . . . 6 (∃𝑦(𝑦 = 𝐵𝑥𝑦) ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1513, 14bitri 274 . . . . 5 (𝑥𝐵 ↔ ∃𝑦(𝑥𝑦𝑦 = 𝐵))
1611, 15orbi12i 912 . . . 4 ((𝑥𝐴𝑥𝐵) ↔ (∃𝑦(𝑥𝑦𝑦 = 𝐴) ∨ ∃𝑦(𝑥𝑦𝑦 = 𝐵)))
171, 7, 163bitr4ri 303 . . 3 ((𝑥𝐴𝑥𝐵) ↔ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵}))
1817abbii 2807 . 2 {𝑥 ∣ (𝑥𝐴𝑥𝐵)} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
19 df-un 3902 . 2 (𝐴𝐵) = {𝑥 ∣ (𝑥𝐴𝑥𝐵)}
20 df-uni 4851 . 2 {𝐴, 𝐵} = {𝑥 ∣ ∃𝑦(𝑥𝑦𝑦 ∈ {𝐴, 𝐵})}
2118, 19, 203eqtr4ri 2776 1 {𝐴, 𝐵} = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  wa 396  wo 844   = wceq 1540  wex 1780  wcel 2105  {cab 2714  Vcvv 3441  cun 3895  {cpr 4573   cuni 4850
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2708
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1543  df-ex 1781  df-sb 2067  df-clab 2715  df-cleq 2729  df-clel 2815  df-v 3443  df-un 3902  df-sn 4572  df-pr 4574  df-uni 4851
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator