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

Theorem dfpr2 3417
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 3405 . 2  |-  { A ,  B }  =  ( { A }  u.  { B } )
2 elun 3113 . . . 4  |-  ( x  e.  ( { A }  u.  { B } )  <->  ( x  e.  { A }  \/  x  e.  { B } ) )
3 velsn 3415 . . . . 5  |-  ( x  e.  { A }  <->  x  =  A )
4 velsn 3415 . . . . 5  |-  ( x  e.  { B }  <->  x  =  B )
53, 4orbi12i 713 . . . 4  |-  ( ( x  e.  { A }  \/  x  e.  { B } )  <->  ( x  =  A  \/  x  =  B ) )
62, 5bitri 182 . . 3  |-  ( x  e.  ( { A }  u.  { B } )  <->  ( x  =  A  \/  x  =  B ) )
76abbi2i 2193 . 2  |-  ( { A }  u.  { B } )  =  {
x  |  ( x  =  A  \/  x  =  B ) }
81, 7eqtri 2101 1  |-  { A ,  B }  =  {
x  |  ( x  =  A  \/  x  =  B ) }
Colors of variables: wff set class
Syntax hints:    \/ wo 661    = wceq 1284    e. wcel 1433   {cab 2067    u. cun 2971   {csn 3398   {cpr 3399
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405
This theorem is referenced by:  elprg  3418  nfpr  3442  pwsnss  3595  minmax  10112
  Copyright terms: Public domain W3C validator