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

Theorem dfpr2 4576
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 4560 . 2 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2 elun 4122 . . . 4 (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}))
3 velsn 4573 . . . . 5 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
4 velsn 4573 . . . . 5 (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
53, 4orbi12i 908 . . . 4 ((𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴𝑥 = 𝐵))
62, 5bitri 276 . . 3 (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 = 𝐴𝑥 = 𝐵))
76abbi2i 2950 . 2 ({𝐴} ∪ {𝐵}) = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
81, 7eqtri 2841 1 {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
Colors of variables: wff setvar class
Syntax hints:  wo 841   = wceq 1528  wcel 2105  {cab 2796  cun 3931  {csn 4557  {cpr 4559
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-v 3494  df-un 3938  df-sn 4558  df-pr 4560
This theorem is referenced by:  dfsn2ALT  4577  elprg  4578  nfpr  4620  pwpw0  4738  pwsn  4822  pwsnALT  4823  zfpair  5312  grothprimlem  10243  nb3grprlem1  27089
  Copyright terms: Public domain W3C validator