Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfpr2 GIF version

Theorem dfpr2 3550
 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 3538 . 2 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2 elun 3221 . . . 4 (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}))
3 velsn 3548 . . . . 5 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
4 velsn 3548 . . . . 5 (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
53, 4orbi12i 754 . . . 4 ((𝑥 ∈ {𝐴} ∨ 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴𝑥 = 𝐵))
62, 5bitri 183 . . 3 (𝑥 ∈ ({𝐴} ∪ {𝐵}) ↔ (𝑥 = 𝐴𝑥 = 𝐵))
76abbi2i 2255 . 2 ({𝐴} ∪ {𝐵}) = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
81, 7eqtri 2161 1 {𝐴, 𝐵} = {𝑥 ∣ (𝑥 = 𝐴𝑥 = 𝐵)}
 Colors of variables: wff set class Syntax hints:   ∨ wo 698   = wceq 1332   ∈ wcel 1481  {cab 2126   ∪ cun 3073  {csn 3531  {cpr 3532 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3079  df-sn 3537  df-pr 3538 This theorem is referenced by:  elprg  3551  nfpr  3580  pwsnss  3737  minmax  11032  xrminmax  11065
 Copyright terms: Public domain W3C validator