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

Theorem opthreg 6846
Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Regularity ax-reg 6833 (via the preleq 6845 step). See df-op 3303 for a description of other ordered pair representations. Exercise 34 of [Enderton] p. 207. (Contributed by NM, 16-Oct-1996.)
Hypotheses
Ref Expression
preleq.1  |-  A  e. 
_V
preleq.2  |-  B  e. 
_V
preleq.3  |-  C  e. 
_V
preleq.4  |-  D  e. 
_V
Assertion
Ref Expression
opthreg  |-  ( { A ,  { A ,  B } }  =  { C ,  { C ,  D } }  <->  ( A  =  C  /\  B  =  D ) )

Proof of Theorem opthreg
StepHypRef Expression
1 preleq.1 . . . . 5  |-  A  e. 
_V
21prid1 3383 . . . 4  |-  A  e. 
{ A ,  B }
3 preleq.3 . . . . 5  |-  C  e. 
_V
43prid1 3383 . . . 4  |-  C  e. 
{ C ,  D }
5 prex 3816 . . . . 5  |-  { A ,  B }  e.  _V
6 prex 3816 . . . . 5  |-  { C ,  D }  e.  _V
71, 5, 3, 6preleq 6845 . . . 4  |-  ( ( ( A  e.  { A ,  B }  /\  C  e.  { C ,  D } )  /\  { A ,  { A ,  B } }  =  { C ,  { C ,  D } } )  ->  ( A  =  C  /\  { A ,  B }  =  { C ,  D }
) )
82, 4, 7mpanl12 658 . . 3  |-  ( { A ,  { A ,  B } }  =  { C ,  { C ,  D } }  ->  ( A  =  C  /\  { A ,  B }  =  { C ,  D } ) )
9 preq1 3355 . . . . . 6  |-  ( A  =  C  ->  { A ,  B }  =  { C ,  B }
)
109eqeq1d 2108 . . . . 5  |-  ( A  =  C  ->  ( { A ,  B }  =  { C ,  D } 
<->  { C ,  B }  =  { C ,  D } ) )
11 preleq.2 . . . . . 6  |-  B  e. 
_V
12 preleq.4 . . . . . 6  |-  D  e. 
_V
1311, 12preqr2 3432 . . . . 5  |-  ( { C ,  B }  =  { C ,  D }  ->  B  =  D )
1410, 13syl6bi 217 . . . 4  |-  ( A  =  C  ->  ( { A ,  B }  =  { C ,  D }  ->  B  =  D ) )
1514imdistani 666 . . 3  |-  ( ( A  =  C  /\  { A ,  B }  =  { C ,  D } )  ->  ( A  =  C  /\  B  =  D )
)
168, 15syl 15 . 2  |-  ( { A ,  { A ,  B } }  =  { C ,  { C ,  D } }  ->  ( A  =  C  /\  B  =  D )
)
17 preq1 3355 . . . 4  |-  ( A  =  C  ->  { A ,  { A ,  B } }  =  { C ,  { A ,  B } } )
1817adantr 446 . . 3  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  { A ,  B } }  =  { C ,  { A ,  B } } )
19 preq12 3357 . . . 4  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D } )
2019preq2d 3362 . . 3  |-  ( ( A  =  C  /\  B  =  D )  ->  { C ,  { A ,  B } }  =  { C ,  { C ,  D } } )
2118, 20eqtrd 2132 . 2  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  { A ,  B } }  =  { C ,  { C ,  D } } )
2216, 21impbii 178 1  |-  ( { A ,  { A ,  B } }  =  { C ,  { C ,  D } }  <->  ( A  =  C  /\  B  =  D ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 174    /\ wa 356    = wceq 1531    e. wcel 1533   _Vcvv 2512   {cpr 3295
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-5 1452  ax-6 1453  ax-7 1454  ax-gen 1455  ax-8 1535  ax-11 1536  ax-14 1538  ax-17 1540  ax-12o 1574  ax-10 1588  ax-9 1594  ax-4 1601  ax-16 1787  ax-ext 2082  ax-sep 3745  ax-nul 3753  ax-pr 3813  ax-reg 6833
This theorem depends on definitions:  df-bi 175  df-or 357  df-an 358  df-3an 902  df-ex 1457  df-sb 1748  df-eu 1970  df-mo 1971  df-clab 2088  df-cleq 2093  df-clel 2096  df-ne 2220  df-ral 2315  df-rex 2316  df-rab 2318  df-v 2514  df-sbc 2688  df-dif 2833  df-un 2835  df-in 2837  df-ss 2841  df-nul 3111  df-if 3221  df-sn 3300  df-pr 3301  df-op 3303  df-br 3631  df-opab 3685  df-eprel 3900  df-fr 3947
  Copyright terms: Public domain W3C validator