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

Theorem preq12b 3788
Description: Equality relationship for two unordered pairs. (Contributed by NM, 17-Oct-1996.)
Hypotheses
Ref Expression
preq12b.1  |-  A  e. 
_V
preq12b.2  |-  B  e. 
_V
preq12b.3  |-  C  e. 
_V
preq12b.4  |-  D  e. 
_V
Assertion
Ref Expression
preq12b  |-  ( { A ,  B }  =  { C ,  D } 
<->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )

Proof of Theorem preq12b
StepHypRef Expression
1 preq12b.1 . . . . . 6  |-  A  e. 
_V
21prid1 3734 . . . . 5  |-  A  e. 
{ A ,  B }
3 eleq2 2344 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  e. 
{ A ,  B } 
<->  A  e.  { C ,  D } ) )
42, 3mpbii 202 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  A  e.  { C ,  D }
)
51elpr 3658 . . . 4  |-  ( A  e.  { C ,  D }  <->  ( A  =  C  \/  A  =  D ) )
64, 5sylib 188 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  \/  A  =  D ) )
7 preq1 3706 . . . . . . . 8  |-  ( A  =  C  ->  { A ,  B }  =  { C ,  B }
)
87eqeq1d 2291 . . . . . . 7  |-  ( A  =  C  ->  ( { A ,  B }  =  { C ,  D } 
<->  { C ,  B }  =  { C ,  D } ) )
9 preq12b.2 . . . . . . . 8  |-  B  e. 
_V
10 preq12b.4 . . . . . . . 8  |-  D  e. 
_V
119, 10preqr2 3787 . . . . . . 7  |-  ( { C ,  B }  =  { C ,  D }  ->  B  =  D )
128, 11syl6bi 219 . . . . . 6  |-  ( A  =  C  ->  ( { A ,  B }  =  { C ,  D }  ->  B  =  D ) )
1312com12 27 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  ->  B  =  D ) )
1413ancld 536 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  ->  ( A  =  C  /\  B  =  D ) ) )
15 prcom 3705 . . . . . . 7  |-  { C ,  D }  =  { D ,  C }
1615eqeq2i 2293 . . . . . 6  |-  ( { A ,  B }  =  { C ,  D } 
<->  { A ,  B }  =  { D ,  C } )
17 preq1 3706 . . . . . . . . 9  |-  ( A  =  D  ->  { A ,  B }  =  { D ,  B }
)
1817eqeq1d 2291 . . . . . . . 8  |-  ( A  =  D  ->  ( { A ,  B }  =  { D ,  C } 
<->  { D ,  B }  =  { D ,  C } ) )
19 preq12b.3 . . . . . . . . 9  |-  C  e. 
_V
209, 19preqr2 3787 . . . . . . . 8  |-  ( { D ,  B }  =  { D ,  C }  ->  B  =  C )
2118, 20syl6bi 219 . . . . . . 7  |-  ( A  =  D  ->  ( { A ,  B }  =  { D ,  C }  ->  B  =  C ) )
2221com12 27 . . . . . 6  |-  ( { A ,  B }  =  { D ,  C }  ->  ( A  =  D  ->  B  =  C ) )
2316, 22sylbi 187 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  D  ->  B  =  C ) )
2423ancld 536 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  D  ->  ( A  =  D  /\  B  =  C ) ) )
2514, 24orim12d 811 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  ( ( A  =  C  \/  A  =  D )  ->  (
( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) ) ) )
266, 25mpd 14 . 2  |-  ( { A ,  B }  =  { C ,  D }  ->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
27 preq12 3708 . . 3  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D } )
28 prcom 3705 . . . . 5  |-  { D ,  B }  =  { B ,  D }
2917, 28syl6eq 2331 . . . 4  |-  ( A  =  D  ->  { A ,  B }  =  { B ,  D }
)
30 preq1 3706 . . . 4  |-  ( B  =  C  ->  { B ,  D }  =  { C ,  D }
)
3129, 30sylan9eq 2335 . . 3  |-  ( ( A  =  D  /\  B  =  C )  ->  { A ,  B }  =  { C ,  D } )
3227, 31jaoi 368 . 2  |-  ( ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) )  ->  { A ,  B }  =  { C ,  D } )
3326, 32impbii 180 1  |-  ( { A ,  B }  =  { C ,  D } 
<->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    \/ wo 357    /\ wa 358    = wceq 1623    e. wcel 1684   _Vcvv 2788   {cpr 3641
This theorem is referenced by:  prel12  3789  opthpr  3790  preq12bg  3791  preqsn  3792  opeqpr  4263  preleq  7318  altopthsn  24495  axlowdimlem13  24582  cbcpcp  25162
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790  df-un 3157  df-sn 3646  df-pr 3647
  Copyright terms: Public domain W3C validator