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

Theorem inssdif0im 3435
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 3264 . . . . . 6  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
21imbi1i 237 . . . . 5  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  <->  ( ( x  e.  A  /\  x  e.  B
)  ->  x  e.  C ) )
3 imanim 678 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  B
)  ->  x  e.  C )  ->  -.  ( ( x  e.  A  /\  x  e.  B )  /\  -.  x  e.  C )
)
42, 3sylbi 120 . . . 4  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  ->  -.  ( ( x  e.  A  /\  x  e.  B )  /\  -.  x  e.  C )
)
5 eldif 3085 . . . . . 6  |-  ( x  e.  ( B  \  C )  <->  ( x  e.  B  /\  -.  x  e.  C ) )
65anbi2i 453 . . . . 5  |-  ( ( x  e.  A  /\  x  e.  ( B  \  C ) )  <->  ( x  e.  A  /\  (
x  e.  B  /\  -.  x  e.  C
) ) )
7 elin 3264 . . . . 5  |-  ( x  e.  ( A  i^i  ( B  \  C ) )  <->  ( x  e.  A  /\  x  e.  ( B  \  C
) ) )
8 anass 399 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C )  <->  ( x  e.  A  /\  (
x  e.  B  /\  -.  x  e.  C
) ) )
96, 7, 83bitr4ri 212 . . . 4  |-  ( ( ( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C )  <->  x  e.  ( A  i^i  ( B  \  C ) ) )
104, 9sylnib 666 . . 3  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  ->  -.  x  e.  ( A  i^i  ( B 
\  C ) ) )
1110alimi 1432 . 2  |-  ( A. x ( x  e.  ( A  i^i  B
)  ->  x  e.  C )  ->  A. x  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
12 dfss2 3091 . 2  |-  ( ( A  i^i  B ) 
C_  C  <->  A. x
( x  e.  ( A  i^i  B )  ->  x  e.  C
) )
13 eq0 3386 . 2  |-  ( ( A  i^i  ( B 
\  C ) )  =  (/)  <->  A. x  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
1411, 12, 133imtr4i 200 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 103   A.wal 1330    = wceq 1332    e. wcel 1481    \ cdif 3073    i^i cin 3075    C_ wss 3076   (/)c0 3368
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-dif 3078  df-in 3082  df-ss 3089  df-nul 3369
This theorem is referenced by:  disjdif  3440
  Copyright terms: Public domain W3C validator