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

Theorem inssdif0im 3311
Description: Intersection, subclass, and difference relationship. In classical logic the converse would also hold. (Contributed by Jim Kingdon, 3-Aug-2018.)
Assertion
Ref Expression
inssdif0im  |-  ( ( A  i^i  B ) 
C_  C  ->  ( A  i^i  ( B  \  C ) )  =  (/) )

Proof of Theorem inssdif0im
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elin 3155 . . . . . 6  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
21imbi1i 236 . . . . 5  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  <->  ( ( x  e.  A  /\  x  e.  B
)  ->  x  e.  C ) )
3 imanim 818 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  B
)  ->  x  e.  C )  ->  -.  ( ( x  e.  A  /\  x  e.  B )  /\  -.  x  e.  C )
)
42, 3sylbi 119 . . . 4  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  ->  -.  ( ( x  e.  A  /\  x  e.  B )  /\  -.  x  e.  C )
)
5 eldif 2982 . . . . . 6  |-  ( x  e.  ( B  \  C )  <->  ( x  e.  B  /\  -.  x  e.  C ) )
65anbi2i 444 . . . . 5  |-  ( ( x  e.  A  /\  x  e.  ( B  \  C ) )  <->  ( x  e.  A  /\  (
x  e.  B  /\  -.  x  e.  C
) ) )
7 elin 3155 . . . . 5  |-  ( x  e.  ( A  i^i  ( B  \  C ) )  <->  ( x  e.  A  /\  x  e.  ( B  \  C
) ) )
8 anass 393 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C )  <->  ( x  e.  A  /\  (
x  e.  B  /\  -.  x  e.  C
) ) )
96, 7, 83bitr4ri 211 . . . 4  |-  ( ( ( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C )  <->  x  e.  ( A  i^i  ( B  \  C ) ) )
104, 9sylnib 633 . . 3  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  ->  -.  x  e.  ( A  i^i  ( B 
\  C ) ) )
1110alimi 1384 . 2  |-  ( A. x ( x  e.  ( A  i^i  B
)  ->  x  e.  C )  ->  A. x  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
12 dfss2 2988 . 2  |-  ( ( A  i^i  B ) 
C_  C  <->  A. x
( x  e.  ( A  i^i  B )  ->  x  e.  C
) )
13 eq0 3266 . 2  |-  ( ( A  i^i  ( B 
\  C ) )  =  (/)  <->  A. x  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
1411, 12, 133imtr4i 199 1  |-  ( ( A  i^i  B ) 
C_  C  ->  ( A  i^i  ( B  \  C ) )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102   A.wal 1282    = wceq 1284    e. wcel 1433    \ cdif 2970    i^i cin 2972    C_ wss 2973   (/)c0 3251
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-dif 2975  df-in 2979  df-ss 2986  df-nul 3252
This theorem is referenced by:  disjdif  3316
  Copyright terms: Public domain W3C validator