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

Theorem preleq 4539
Description: Equality of two unordered pairs when one member of each pair contains the other member. (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
preleq  |-  ( ( ( A  e.  B  /\  C  e.  D
)  /\  { A ,  B }  =  { C ,  D }
)  ->  ( A  =  C  /\  B  =  D ) )

Proof of Theorem preleq
StepHypRef Expression
1 en2lp 4538 . . . . 5  |-  -.  ( D  e.  C  /\  C  e.  D )
2 eleq12 2235 . . . . . 6  |-  ( ( A  =  D  /\  B  =  C )  ->  ( A  e.  B  <->  D  e.  C ) )
32anbi1d 462 . . . . 5  |-  ( ( A  =  D  /\  B  =  C )  ->  ( ( A  e.  B  /\  C  e.  D )  <->  ( D  e.  C  /\  C  e.  D ) ) )
41, 3mtbiri 670 . . . 4  |-  ( ( A  =  D  /\  B  =  C )  ->  -.  ( A  e.  B  /\  C  e.  D ) )
54con2i 622 . . 3  |-  ( ( A  e.  B  /\  C  e.  D )  ->  -.  ( A  =  D  /\  B  =  C ) )
65adantr 274 . 2  |-  ( ( ( A  e.  B  /\  C  e.  D
)  /\  { A ,  B }  =  { C ,  D }
)  ->  -.  ( A  =  D  /\  B  =  C )
)
7 preleq.1 . . . . 5  |-  A  e. 
_V
8 preleq.2 . . . . 5  |-  B  e. 
_V
9 preleq.3 . . . . 5  |-  C  e. 
_V
10 preleq.4 . . . . 5  |-  D  e. 
_V
117, 8, 9, 10preq12b 3757 . . . 4  |-  ( { A ,  B }  =  { C ,  D } 
<->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
1211biimpi 119 . . 3  |-  ( { A ,  B }  =  { C ,  D }  ->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C )
) )
1312adantl 275 . 2  |-  ( ( ( A  e.  B  /\  C  e.  D
)  /\  { A ,  B }  =  { C ,  D }
)  ->  ( ( A  =  C  /\  B  =  D )  \/  ( A  =  D  /\  B  =  C ) ) )
146, 13ecased 1344 1  |-  ( ( ( A  e.  B  /\  C  e.  D
)  /\  { A ,  B }  =  { C ,  D }
)  ->  ( A  =  C  /\  B  =  D ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    \/ wo 703    = wceq 1348    e. wcel 2141   _Vcvv 2730   {cpr 3584
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-setind 4521
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-v 2732  df-dif 3123  df-un 3125  df-sn 3589  df-pr 3590
This theorem is referenced by:  opthreg  4540
  Copyright terms: Public domain W3C validator