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

Theorem preq12b 3569
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 3504 . . . . 5  |-  A  e. 
{ A ,  B }
3 eleq2 2117 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  e. 
{ A ,  B } 
<->  A  e.  { C ,  D } ) )
42, 3mpbii 140 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  A  e.  { C ,  D }
)
51elpr 3424 . . . 4  |-  ( A  e.  { C ,  D }  <->  ( A  =  C  \/  A  =  D ) )
64, 5sylib 131 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  \/  A  =  D ) )
7 preq1 3475 . . . . . . . 8  |-  ( A  =  C  ->  { A ,  B }  =  { C ,  B }
)
87eqeq1d 2064 . . . . . . 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 3568 . . . . . . 7  |-  ( { C ,  B }  =  { C ,  D }  ->  B  =  D )
128, 11syl6bi 156 . . . . . 6  |-  ( A  =  C  ->  ( { A ,  B }  =  { C ,  D }  ->  B  =  D ) )
1312com12 30 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  ->  B  =  D ) )
1413ancld 312 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  ->  ( A  =  C  /\  B  =  D ) ) )
15 prcom 3474 . . . . . . 7  |-  { C ,  D }  =  { D ,  C }
1615eqeq2i 2066 . . . . . 6  |-  ( { A ,  B }  =  { C ,  D } 
<->  { A ,  B }  =  { D ,  C } )
17 preq1 3475 . . . . . . . . 9  |-  ( A  =  D  ->  { A ,  B }  =  { D ,  B }
)
1817eqeq1d 2064 . . . . . . . 8  |-  ( A  =  D  ->  ( { A ,  B }  =  { D ,  C } 
<->  { D ,  B }  =  { D ,  C } ) )
19 preq12b.3 . . . . . . . . 9  |-  C  e. 
_V
209, 19preqr2 3568 . . . . . . . 8  |-  ( { D ,  B }  =  { D ,  C }  ->  B  =  C )
2118, 20syl6bi 156 . . . . . . 7  |-  ( A  =  D  ->  ( { A ,  B }  =  { D ,  C }  ->  B  =  C ) )
2221com12 30 . . . . . 6  |-  ( { A ,  B }  =  { D ,  C }  ->  ( A  =  D  ->  B  =  C ) )
2316, 22sylbi 118 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  D  ->  B  =  C ) )
2423ancld 312 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  D  ->  ( A  =  D  /\  B  =  C ) ) )
2514, 24orim12d 710 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  ( ( A  =  C  \/  A  =  D )  ->  (
( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) ) ) )
266, 25mpd 13 . 2  |-  ( { A ,  B }  =  { C ,  D }  ->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
27 preq12 3477 . . 3  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D } )
28 prcom 3474 . . . . 5  |-  { D ,  B }  =  { B ,  D }
2917, 28syl6eq 2104 . . . 4  |-  ( A  =  D  ->  { A ,  B }  =  { B ,  D }
)
30 preq1 3475 . . . 4  |-  ( B  =  C  ->  { B ,  D }  =  { C ,  D }
)
3129, 30sylan9eq 2108 . . 3  |-  ( ( A  =  D  /\  B  =  C )  ->  { A ,  B }  =  { C ,  D } )
3227, 31jaoi 646 . 2  |-  ( ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) )  ->  { A ,  B }  =  { C ,  D } )
3326, 32impbii 121 1  |-  ( { A ,  B }  =  { C ,  D } 
<->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    <-> wb 102    \/ wo 639    = wceq 1259    e. wcel 1409   _Vcvv 2574   {cpr 3404
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-un 2950  df-sn 3409  df-pr 3410
This theorem is referenced by:  prel12  3570  opthpr  3571  preq12bg  3572  preqsn  3574  opeqpr  4018  preleq  4307
  Copyright terms: Public domain W3C validator