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

Theorem dfpr2 4137
Description: Alternate definition of unordered pair. Definition 5.1 of [TakeutiZaring] p. 15. (Contributed by NM, 24-Apr-1994.)
Assertion
Ref Expression
dfpr2 {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dfpr2
StepHypRef Expression
1 df-pr 4122 . 2 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2 elun 3709 . . . 4 (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}))
3 velsn 4135 . . . . 5 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
4 velsn 4135 . . . . 5 (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
53, 4orbi12i 541 . . . 4 ((𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴𝑥 = 𝐵))
62, 5bitri 262 . . 3 (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 = 𝐴𝑥 = 𝐵))
76abbi2i 2719 . 2 ({𝐴} ∪ {𝐵}) = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
81, 7eqtri 2626 1 {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
Colors of variables: wff setvar class
Syntax hints:  wo 381   = wceq 1474  wcel 1975  {cab 2590  cun 3532  {csn 4119  {cpr 4121
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2227  ax-ext 2584
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-clab 2591  df-cleq 2597  df-clel 2600  df-nfc 2734  df-v 3169  df-un 3539  df-sn 4120  df-pr 4122
This theorem is referenced by:  elprg  4138  nfpr  4173  pwpw0  4278  pwsn  4355  pwsnALT  4356  zfpair  4821  grothprimlem  9506  nb3graprlem1  25741  nb3grprlem1  40605
  Copyright terms: Public domain W3C validator