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

Theorem prel12 3698
Description: Equality of 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
prel12  |-  ( -.  A  =  B  -> 
( { A ,  B }  =  { C ,  D }  <->  ( A  e.  { C ,  D }  /\  B  e.  { C ,  D } ) ) )

Proof of Theorem prel12
StepHypRef Expression
1 preq12b.1 . . . . 5  |-  A  e. 
_V
21prid1 3629 . . . 4  |-  A  e. 
{ A ,  B }
3 eleq2 2203 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  e. 
{ A ,  B } 
<->  A  e.  { C ,  D } ) )
42, 3mpbii 147 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  A  e.  { C ,  D }
)
5 preq12b.2 . . . . 5  |-  B  e. 
_V
65prid2 3630 . . . 4  |-  B  e. 
{ A ,  B }
7 eleq2 2203 . . . 4  |-  ( { A ,  B }  =  { C ,  D }  ->  ( B  e. 
{ A ,  B } 
<->  B  e.  { C ,  D } ) )
86, 7mpbii 147 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  B  e.  { C ,  D }
)
94, 8jca 304 . 2  |-  ( { A ,  B }  =  { C ,  D }  ->  ( A  e. 
{ C ,  D }  /\  B  e.  { C ,  D }
) )
101elpr 3548 . . . 4  |-  ( A  e.  { C ,  D }  <->  ( A  =  C  \/  A  =  D ) )
11 eqeq2 2149 . . . . . . . . . . . 12  |-  ( B  =  D  ->  ( A  =  B  <->  A  =  D ) )
1211notbid 656 . . . . . . . . . . 11  |-  ( B  =  D  ->  ( -.  A  =  B  <->  -.  A  =  D ) )
13 orel2 715 . . . . . . . . . . 11  |-  ( -.  A  =  D  -> 
( ( A  =  C  \/  A  =  D )  ->  A  =  C ) )
1412, 13syl6bi 162 . . . . . . . . . 10  |-  ( B  =  D  ->  ( -.  A  =  B  ->  ( ( A  =  C  \/  A  =  D )  ->  A  =  C ) ) )
1514com3l 81 . . . . . . . . 9  |-  ( -.  A  =  B  -> 
( ( A  =  C  \/  A  =  D )  ->  ( B  =  D  ->  A  =  C ) ) )
1615imp 123 . . . . . . . 8  |-  ( ( -.  A  =  B  /\  ( A  =  C  \/  A  =  D ) )  -> 
( B  =  D  ->  A  =  C ) )
1716ancrd 324 . . . . . . 7  |-  ( ( -.  A  =  B  /\  ( A  =  C  \/  A  =  D ) )  -> 
( B  =  D  ->  ( A  =  C  /\  B  =  D ) ) )
18 eqeq2 2149 . . . . . . . . . . . 12  |-  ( B  =  C  ->  ( A  =  B  <->  A  =  C ) )
1918notbid 656 . . . . . . . . . . 11  |-  ( B  =  C  ->  ( -.  A  =  B  <->  -.  A  =  C ) )
20 orel1 714 . . . . . . . . . . 11  |-  ( -.  A  =  C  -> 
( ( A  =  C  \/  A  =  D )  ->  A  =  D ) )
2119, 20syl6bi 162 . . . . . . . . . 10  |-  ( B  =  C  ->  ( -.  A  =  B  ->  ( ( A  =  C  \/  A  =  D )  ->  A  =  D ) ) )
2221com3l 81 . . . . . . . . 9  |-  ( -.  A  =  B  -> 
( ( A  =  C  \/  A  =  D )  ->  ( B  =  C  ->  A  =  D ) ) )
2322imp 123 . . . . . . . 8  |-  ( ( -.  A  =  B  /\  ( A  =  C  \/  A  =  D ) )  -> 
( B  =  C  ->  A  =  D ) )
2423ancrd 324 . . . . . . 7  |-  ( ( -.  A  =  B  /\  ( A  =  C  \/  A  =  D ) )  -> 
( B  =  C  ->  ( A  =  D  /\  B  =  C ) ) )
2517, 24orim12d 775 . . . . . 6  |-  ( ( -.  A  =  B  /\  ( A  =  C  \/  A  =  D ) )  -> 
( ( B  =  D  \/  B  =  C )  ->  (
( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) ) ) )
265elpr 3548 . . . . . . 7  |-  ( B  e.  { C ,  D }  <->  ( B  =  C  \/  B  =  D ) )
27 orcom 717 . . . . . . 7  |-  ( ( B  =  C  \/  B  =  D )  <->  ( B  =  D  \/  B  =  C )
)
2826, 27bitri 183 . . . . . 6  |-  ( B  e.  { C ,  D }  <->  ( B  =  D  \/  B  =  C ) )
29 preq12b.3 . . . . . . 7  |-  C  e. 
_V
30 preq12b.4 . . . . . . 7  |-  D  e. 
_V
311, 5, 29, 30preq12b 3697 . . . . . 6  |-  ( { A ,  B }  =  { C ,  D } 
<->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
3225, 28, 313imtr4g 204 . . . . 5  |-  ( ( -.  A  =  B  /\  ( A  =  C  \/  A  =  D ) )  -> 
( B  e.  { C ,  D }  ->  { A ,  B }  =  { C ,  D } ) )
3332ex 114 . . . 4  |-  ( -.  A  =  B  -> 
( ( A  =  C  \/  A  =  D )  ->  ( B  e.  { C ,  D }  ->  { A ,  B }  =  { C ,  D }
) ) )
3410, 33syl5bi 151 . . 3  |-  ( -.  A  =  B  -> 
( A  e.  { C ,  D }  ->  ( B  e.  { C ,  D }  ->  { A ,  B }  =  { C ,  D } ) ) )
3534impd 252 . 2  |-  ( -.  A  =  B  -> 
( ( A  e. 
{ C ,  D }  /\  B  e.  { C ,  D }
)  ->  { A ,  B }  =  { C ,  D }
) )
369, 35impbid2 142 1  |-  ( -.  A  =  B  -> 
( { A ,  B }  =  { C ,  D }  <->  ( A  e.  { C ,  D }  /\  B  e.  { C ,  D } ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 697    = wceq 1331    e. wcel 1480   _Vcvv 2686   {cpr 3528
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator