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

Theorem dfpr2 3790
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 3781 . 2  |-  { A ,  B }  =  ( { A }  u.  { B } )
2 elun 3448 . . . 4  |-  ( x  e.  ( { A }  u.  { B } )  <->  ( x  e.  { A }  \/  x  e.  { B } ) )
3 elsn 3789 . . . . 5  |-  ( x  e.  { A }  <->  x  =  A )
4 elsn 3789 . . . . 5  |-  ( x  e.  { B }  <->  x  =  B )
53, 4orbi12i 508 . . . 4  |-  ( ( x  e.  { A }  \/  x  e.  { B } )  <->  ( x  =  A  \/  x  =  B ) )
62, 5bitri 241 . . 3  |-  ( x  e.  ( { A }  u.  { B } )  <->  ( x  =  A  \/  x  =  B ) )
76abbi2i 2515 . 2  |-  ( { A }  u.  { B } )  =  {
x  |  ( x  =  A  \/  x  =  B ) }
81, 7eqtri 2424 1  |-  { A ,  B }  =  {
x  |  ( x  =  A  \/  x  =  B ) }
Colors of variables: wff set class
Syntax hints:    \/ wo 358    = wceq 1649    e. wcel 1721   {cab 2390    u. cun 3278   {csn 3774   {cpr 3775
This theorem is referenced by:  elprg  3791  nfpr  3815  pwpw0  3906  pwsn  3969  pwsnALT  3970  zfpair  4361  grothprimlem  8664  nb3graprlem1  21413
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-v 2918  df-un 3285  df-sn 3780  df-pr 3781
  Copyright terms: Public domain W3C validator