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

Theorem uneqin 3460
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 3282 . . . 4  |-  ( ( A  u.  B )  =  ( A  i^i  B )  ->  ( A  u.  B )  C_  ( A  i^i  B ) )
2 unss 3383 . . . . 5  |-  ( ( A  C_  ( A  i^i  B )  /\  B  C_  ( A  i^i  B
) )  <->  ( A  u.  B )  C_  ( A  i^i  B ) )
3 ssin 3431 . . . . . . 7  |-  ( ( A  C_  A  /\  A  C_  B )  <->  A  C_  ( A  i^i  B ) )
4 sstr 3236 . . . . . . 7  |-  ( ( A  C_  A  /\  A  C_  B )  ->  A  C_  B )
53, 4sylbir 135 . . . . . 6  |-  ( A 
C_  ( A  i^i  B )  ->  A  C_  B
)
6 ssin 3431 . . . . . . 7  |-  ( ( B  C_  A  /\  B  C_  B )  <->  B  C_  ( A  i^i  B ) )
7 simpl 109 . . . . . . 7  |-  ( ( B  C_  A  /\  B  C_  B )  ->  B  C_  A )
86, 7sylbir 135 . . . . . 6  |-  ( B 
C_  ( A  i^i  B )  ->  B  C_  A
)
95, 8anim12i 338 . . . . 5  |-  ( ( A  C_  ( A  i^i  B )  /\  B  C_  ( A  i^i  B
) )  ->  ( A  C_  B  /\  B  C_  A ) )
102, 9sylbir 135 . . . 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 3243 . . 3  |-  ( A  =  B  <->  ( A  C_  B  /\  B  C_  A ) )
1311, 12sylibr 134 . 2  |-  ( ( A  u.  B )  =  ( A  i^i  B )  ->  A  =  B )
14 unidm 3352 . . . 4  |-  ( A  u.  A )  =  A
15 inidm 3418 . . . 4  |-  ( A  i^i  A )  =  A
1614, 15eqtr4i 2255 . . 3  |-  ( A  u.  A )  =  ( A  i^i  A
)
17 uneq2 3357 . . 3  |-  ( A  =  B  ->  ( A  u.  A )  =  ( A  u.  B ) )
18 ineq2 3404 . . 3  |-  ( A  =  B  ->  ( A  i^i  A )  =  ( A  i^i  B
) )
1916, 17, 183eqtr3a 2288 . 2  |-  ( A  =  B  ->  ( A  u.  B )  =  ( A  i^i  B ) )
2013, 19impbii 126 1  |-  ( ( A  u.  B )  =  ( A  i^i  B )  <->  A  =  B
)
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398    u. cun 3199    i^i cin 3200    C_ wss 3201
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-in 3207  df-ss 3214
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator