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

Theorem dfpr2 3669
Description: Alternate definition of unordered pair. Definition 5.1 of [TakeutiZaring] p. 15. (Contributed by NM, 24-Apr-1994.)
Assertion
Ref Expression
dfpr2  |-  { A ,  B }  =  {
x  |  ( x  =  A  \/  x  =  B ) }
Distinct variable groups:    x, A    x, B

Proof of Theorem dfpr2
StepHypRef Expression
1 df-pr 3660 . 2  |-  { A ,  B }  =  ( { A }  u.  { B } )
2 elun 3329 . . . 4  |-  ( x  e.  ( { A }  u.  { B } )  <->  ( x  e.  { A }  \/  x  e.  { B } ) )
3 elsn 3668 . . . . 5  |-  ( x  e.  { A }  <->  x  =  A )
4 elsn 3668 . . . . 5  |-  ( x  e.  { B }  <->  x  =  B )
53, 4orbi12i 507 . . . 4  |-  ( ( x  e.  { A }  \/  x  e.  { B } )  <->  ( x  =  A  \/  x  =  B ) )
62, 5bitri 240 . . 3  |-  ( x  e.  ( { A }  u.  { B } )  <->  ( x  =  A  \/  x  =  B ) )
76abbi2i 2407 . 2  |-  ( { A }  u.  { B } )  =  {
x  |  ( x  =  A  \/  x  =  B ) }
81, 7eqtri 2316 1  |-  { A ,  B }  =  {
x  |  ( x  =  A  \/  x  =  B ) }
Colors of variables: wff set class
Syntax hints:    \/ wo 357    = wceq 1632    e. wcel 1696   {cab 2282    u. cun 3163   {csn 3653   {cpr 3654
This theorem is referenced by:  elprg  3670  nfpr  3693  pwpw0  3779  pwsn  3837  pwsnALT  3838  zfpair  4228  grothprimlem  8471  nb3graprlem1  28287
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-v 2803  df-un 3170  df-sn 3659  df-pr 3660
  Copyright terms: Public domain W3C validator