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

Theorem uneqin 3251
Description: Equality of union and intersection implies equality of their arguments. (Contributed by NM, 16-Apr-2006.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
uneqin  |-  ( ( A  u.  B )  =  ( A  i^i  B )  <->  A  =  B
)

Proof of Theorem uneqin
StepHypRef Expression
1 eqimss 3079 . . . 4  |-  ( ( A  u.  B )  =  ( A  i^i  B )  ->  ( A  u.  B )  C_  ( A  i^i  B ) )
2 unss 3175 . . . . 5  |-  ( ( A  C_  ( A  i^i  B )  /\  B  C_  ( A  i^i  B
) )  <->  ( A  u.  B )  C_  ( A  i^i  B ) )
3 ssin 3223 . . . . . . 7  |-  ( ( A  C_  A  /\  A  C_  B )  <->  A  C_  ( A  i^i  B ) )
4 sstr 3034 . . . . . . 7  |-  ( ( A  C_  A  /\  A  C_  B )  ->  A  C_  B )
53, 4sylbir 134 . . . . . 6  |-  ( A 
C_  ( A  i^i  B )  ->  A  C_  B
)
6 ssin 3223 . . . . . . 7  |-  ( ( B  C_  A  /\  B  C_  B )  <->  B  C_  ( A  i^i  B ) )
7 simpl 108 . . . . . . 7  |-  ( ( B  C_  A  /\  B  C_  B )  ->  B  C_  A )
86, 7sylbir 134 . . . . . 6  |-  ( B 
C_  ( A  i^i  B )  ->  B  C_  A
)
95, 8anim12i 332 . . . . 5  |-  ( ( A  C_  ( A  i^i  B )  /\  B  C_  ( A  i^i  B
) )  ->  ( A  C_  B  /\  B  C_  A ) )
102, 9sylbir 134 . . . 4  |-  ( ( A  u.  B ) 
C_  ( A  i^i  B )  ->  ( A  C_  B  /\  B  C_  A ) )
111, 10syl 14 . . 3  |-  ( ( A  u.  B )  =  ( A  i^i  B )  ->  ( A  C_  B  /\  B  C_  A ) )
12 eqss 3041 . . 3  |-  ( A  =  B  <->  ( A  C_  B  /\  B  C_  A ) )
1311, 12sylibr 133 . 2  |-  ( ( A  u.  B )  =  ( A  i^i  B )  ->  A  =  B )
14 unidm 3144 . . . 4  |-  ( A  u.  A )  =  A
15 inidm 3210 . . . 4  |-  ( A  i^i  A )  =  A
1614, 15eqtr4i 2112 . . 3  |-  ( A  u.  A )  =  ( A  i^i  A
)
17 uneq2 3149 . . 3  |-  ( A  =  B  ->  ( A  u.  A )  =  ( A  u.  B ) )
18 ineq2 3196 . . 3  |-  ( A  =  B  ->  ( A  i^i  A )  =  ( A  i^i  B
) )
1916, 17, 183eqtr3a 2145 . 2  |-  ( A  =  B  ->  ( A  u.  B )  =  ( A  i^i  B ) )
2013, 19impbii 125 1  |-  ( ( A  u.  B )  =  ( A  i^i  B )  <->  A  =  B
)
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1290    u. cun 2998    i^i cin 2999    C_ wss 3000
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071
This theorem depends on definitions:  df-bi 116  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-v 2622  df-un 3004  df-in 3006  df-ss 3013
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator