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

Theorem opeqpr 4396
Description: Equivalence for an ordered pair equal to an unordered pair. (Contributed by NM, 3-Jun-2008.)
Hypotheses
Ref Expression
opeqpr.1  |-  A  e. 
_V
opeqpr.2  |-  B  e. 
_V
opeqpr.3  |-  C  e. 
_V
opeqpr.4  |-  D  e. 
_V
Assertion
Ref Expression
opeqpr  |-  ( <. A ,  B >.  =  { C ,  D } 
<->  ( ( C  =  { A }  /\  D  =  { A ,  B } )  \/  ( C  =  { A ,  B }  /\  D  =  { A } ) ) )

Proof of Theorem opeqpr
StepHypRef Expression
1 eqcom 2391 . 2  |-  ( <. A ,  B >.  =  { C ,  D } 
<->  { C ,  D }  =  <. A ,  B >. )
2 opeqpr.1 . . . 4  |-  A  e. 
_V
3 opeqpr.2 . . . 4  |-  B  e. 
_V
42, 3dfop 3927 . . 3  |-  <. A ,  B >.  =  { { A } ,  { A ,  B } }
54eqeq2i 2399 . 2  |-  ( { C ,  D }  =  <. A ,  B >.  <->  { C ,  D }  =  { { A } ,  { A ,  B } } )
6 opeqpr.3 . . 3  |-  C  e. 
_V
7 opeqpr.4 . . 3  |-  D  e. 
_V
8 snex 4348 . . 3  |-  { A }  e.  _V
9 prex 4349 . . 3  |-  { A ,  B }  e.  _V
106, 7, 8, 9preq12b 3918 . 2  |-  ( { C ,  D }  =  { { A } ,  { A ,  B } }  <->  ( ( C  =  { A }  /\  D  =  { A ,  B }
)  \/  ( C  =  { A ,  B }  /\  D  =  { A } ) ) )
111, 5, 103bitri 263 1  |-  ( <. A ,  B >.  =  { C ,  D } 
<->  ( ( C  =  { A }  /\  D  =  { A ,  B } )  \/  ( C  =  { A ,  B }  /\  D  =  { A } ) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    \/ wo 358    /\ wa 359    = wceq 1649    e. wcel 1717   _Vcvv 2901   {csn 3759   {cpr 3760   <.cop 3762
This theorem is referenced by:  relop  4965
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 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370  ax-sep 4273  ax-nul 4281  ax-pr 4346
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ne 2554  df-v 2903  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-sn 3765  df-pr 3766  df-op 3768
  Copyright terms: Public domain W3C validator