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

Theorem preq12b 3599
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 3533 . . . . 5  |-  A  e. 
{ A ,  B }
3 eleq2 2148 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  e. 
{ A ,  B } 
<->  A  e.  { C ,  D } ) )
42, 3mpbii 146 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  A  e.  { C ,  D }
)
51elpr 3452 . . . 4  |-  ( A  e.  { C ,  D }  <->  ( A  =  C  \/  A  =  D ) )
64, 5sylib 120 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  \/  A  =  D ) )
7 preq1 3504 . . . . . . . 8  |-  ( A  =  C  ->  { A ,  B }  =  { C ,  B }
)
87eqeq1d 2093 . . . . . . 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 3598 . . . . . . 7  |-  ( { C ,  B }  =  { C ,  D }  ->  B  =  D )
128, 11syl6bi 161 . . . . . 6  |-  ( A  =  C  ->  ( { A ,  B }  =  { C ,  D }  ->  B  =  D ) )
1312com12 30 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  ->  B  =  D ) )
1413ancld 318 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  C  ->  ( A  =  C  /\  B  =  D ) ) )
15 prcom 3503 . . . . . . 7  |-  { C ,  D }  =  { D ,  C }
1615eqeq2i 2095 . . . . . 6  |-  ( { A ,  B }  =  { C ,  D } 
<->  { A ,  B }  =  { D ,  C } )
17 preq1 3504 . . . . . . . . 9  |-  ( A  =  D  ->  { A ,  B }  =  { D ,  B }
)
1817eqeq1d 2093 . . . . . . . 8  |-  ( A  =  D  ->  ( { A ,  B }  =  { D ,  C } 
<->  { D ,  B }  =  { D ,  C } ) )
19 preq12b.3 . . . . . . . . 9  |-  C  e. 
_V
209, 19preqr2 3598 . . . . . . . 8  |-  ( { D ,  B }  =  { D ,  C }  ->  B  =  C )
2118, 20syl6bi 161 . . . . . . 7  |-  ( A  =  D  ->  ( { A ,  B }  =  { D ,  C }  ->  B  =  C ) )
2221com12 30 . . . . . 6  |-  ( { A ,  B }  =  { D ,  C }  ->  ( A  =  D  ->  B  =  C ) )
2316, 22sylbi 119 . . . . 5  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  D  ->  B  =  C ) )
2423ancld 318 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  =  D  ->  ( A  =  D  /\  B  =  C ) ) )
2514, 24orim12d 733 . . 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 3506 . . 3  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D } )
28 prcom 3503 . . . . 5  |-  { D ,  B }  =  { B ,  D }
2917, 28syl6eq 2133 . . . 4  |-  ( A  =  D  ->  { A ,  B }  =  { B ,  D }
)
30 preq1 3504 . . . 4  |-  ( B  =  C  ->  { B ,  D }  =  { C ,  D }
)
3129, 30sylan9eq 2137 . . 3  |-  ( ( A  =  D  /\  B  =  C )  ->  { A ,  B }  =  { C ,  D } )
3227, 31jaoi 669 . 2  |-  ( ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) )  ->  { A ,  B }  =  { C ,  D } )
3326, 32impbii 124 1  |-  ( { A ,  B }  =  { C ,  D } 
<->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    \/ wo 662    = wceq 1287    e. wcel 1436   _Vcvv 2615   {cpr 3432
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 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067
This theorem depends on definitions:  df-bi 115  df-tru 1290  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-v 2617  df-un 2992  df-sn 3437  df-pr 3438
This theorem is referenced by:  prel12  3600  opthpr  3601  preq12bg  3602  preqsn  3604  opeqpr  4056  preleq  4346
  Copyright terms: Public domain W3C validator