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

Theorem ssprsseq 3801
Description: A proper pair is a subset of a pair iff it is equal to the superset. (Contributed by AV, 26-Oct-2020.)
Assertion
Ref Expression
ssprsseq  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( { A ,  B }  C_  { C ,  D }  <->  { A ,  B }  =  { C ,  D }
) )

Proof of Theorem ssprsseq
StepHypRef Expression
1 ssprss 3800 . . . 4  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( { A ,  B }  C_  { C ,  D }  <->  ( ( A  =  C  \/  A  =  D )  /\  ( B  =  C  \/  B  =  D ) ) ) )
213adant3 1020 . . 3  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( { A ,  B }  C_  { C ,  D }  <->  ( ( A  =  C  \/  A  =  D )  /\  ( B  =  C  \/  B  =  D ) ) ) )
3 eqneqall 2387 . . . . . . . 8  |-  ( A  =  B  ->  ( A  =/=  B  ->  { A ,  B }  =  { C ,  D }
) )
4 eqtr3 2226 . . . . . . . 8  |-  ( ( A  =  C  /\  B  =  C )  ->  A  =  B )
53, 4syl11 31 . . . . . . 7  |-  ( A  =/=  B  ->  (
( A  =  C  /\  B  =  C )  ->  { A ,  B }  =  { C ,  D }
) )
653ad2ant3 1023 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( ( A  =  C  /\  B  =  C )  ->  { A ,  B }  =  { C ,  D }
) )
76com12 30 . . . . 5  |-  ( ( A  =  C  /\  B  =  C )  ->  ( ( A  e.  V  /\  B  e.  W  /\  A  =/= 
B )  ->  { A ,  B }  =  { C ,  D }
) )
8 preq12 3717 . . . . . . 7  |-  ( ( A  =  D  /\  B  =  C )  ->  { A ,  B }  =  { D ,  C } )
9 prcom 3714 . . . . . . 7  |-  { D ,  C }  =  { C ,  D }
108, 9eqtrdi 2255 . . . . . 6  |-  ( ( A  =  D  /\  B  =  C )  ->  { A ,  B }  =  { C ,  D } )
1110a1d 22 . . . . 5  |-  ( ( A  =  D  /\  B  =  C )  ->  ( ( A  e.  V  /\  B  e.  W  /\  A  =/= 
B )  ->  { A ,  B }  =  { C ,  D }
) )
12 preq12 3717 . . . . . 6  |-  ( ( A  =  C  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D } )
1312a1d 22 . . . . 5  |-  ( ( A  =  C  /\  B  =  D )  ->  ( ( A  e.  V  /\  B  e.  W  /\  A  =/= 
B )  ->  { A ,  B }  =  { C ,  D }
) )
14 eqtr3 2226 . . . . . . . 8  |-  ( ( A  =  D  /\  B  =  D )  ->  A  =  B )
153, 14syl11 31 . . . . . . 7  |-  ( A  =/=  B  ->  (
( A  =  D  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D }
) )
16153ad2ant3 1023 . . . . . 6  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( ( A  =  D  /\  B  =  D )  ->  { A ,  B }  =  { C ,  D }
) )
1716com12 30 . . . . 5  |-  ( ( A  =  D  /\  B  =  D )  ->  ( ( A  e.  V  /\  B  e.  W  /\  A  =/= 
B )  ->  { A ,  B }  =  { C ,  D }
) )
187, 11, 13, 17ccase 967 . . . 4  |-  ( ( ( A  =  C  \/  A  =  D )  /\  ( B  =  C  \/  B  =  D ) )  -> 
( ( A  e.  V  /\  B  e.  W  /\  A  =/= 
B )  ->  { A ,  B }  =  { C ,  D }
) )
1918com12 30 . . 3  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( ( ( A  =  C  \/  A  =  D )  /\  ( B  =  C  \/  B  =  D )
)  ->  { A ,  B }  =  { C ,  D }
) )
202, 19sylbid 150 . 2  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( { A ,  B }  C_  { C ,  D }  ->  { A ,  B }  =  { C ,  D }
) )
21 eqimss 3251 . 2  |-  ( { A ,  B }  =  { C ,  D }  ->  { A ,  B }  C_  { C ,  D } )
2220, 21impbid1 142 1  |-  ( ( A  e.  V  /\  B  e.  W  /\  A  =/=  B )  -> 
( { A ,  B }  C_  { C ,  D }  <->  { A ,  B }  =  { C ,  D }
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 710    /\ w3a 981    = wceq 1373    e. wcel 2177    =/= wne 2377    C_ wss 3170   {cpr 3639
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-sn 3644  df-pr 3645
This theorem is referenced by:  upgredgpr  15823
  Copyright terms: Public domain W3C validator