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

Theorem difdifdirss 3581
Description: Distributive law for class difference. In classical logic, as in Exercise 4.8 of [Stoll] p. 16, this would be equality rather than subset. (Contributed by Jim Kingdon, 4-Aug-2018.)
Assertion
Ref Expression
difdifdirss  |-  ( ( A  \  B ) 
\  C )  C_  ( ( A  \  C )  \  ( B  \  C ) )

Proof of Theorem difdifdirss
StepHypRef Expression
1 dif32 3472 . . . . 5  |-  ( ( A  \  B ) 
\  C )  =  ( ( A  \  C )  \  B
)
2 invdif 3451 . . . . 5  |-  ( ( A  \  C )  i^i  ( _V  \  B ) )  =  ( ( A  \  C )  \  B
)
31, 2eqtr4i 2255 . . . 4  |-  ( ( A  \  B ) 
\  C )  =  ( ( A  \  C )  i^i  ( _V  \  B ) )
4 un0 3530 . . . 4  |-  ( ( ( A  \  C
)  i^i  ( _V  \  B ) )  u.  (/) )  =  (
( A  \  C
)  i^i  ( _V  \  B ) )
53, 4eqtr4i 2255 . . 3  |-  ( ( A  \  B ) 
\  C )  =  ( ( ( A 
\  C )  i^i  ( _V  \  B
) )  u.  (/) )
6 indi 3456 . . . 4  |-  ( ( A  \  C )  i^i  ( ( _V 
\  B )  u.  C ) )  =  ( ( ( A 
\  C )  i^i  ( _V  \  B
) )  u.  (
( A  \  C
)  i^i  C )
)
7 disjdif 3569 . . . . . 6  |-  ( C  i^i  ( A  \  C ) )  =  (/)
8 incom 3401 . . . . . 6  |-  ( C  i^i  ( A  \  C ) )  =  ( ( A  \  C )  i^i  C
)
97, 8eqtr3i 2254 . . . . 5  |-  (/)  =  ( ( A  \  C
)  i^i  C )
109uneq2i 3360 . . . 4  |-  ( ( ( A  \  C
)  i^i  ( _V  \  B ) )  u.  (/) )  =  (
( ( A  \  C )  i^i  ( _V  \  B ) )  u.  ( ( A 
\  C )  i^i 
C ) )
116, 10eqtr4i 2255 . . 3  |-  ( ( A  \  C )  i^i  ( ( _V 
\  B )  u.  C ) )  =  ( ( ( A 
\  C )  i^i  ( _V  \  B
) )  u.  (/) )
125, 11eqtr4i 2255 . 2  |-  ( ( A  \  B ) 
\  C )  =  ( ( A  \  C )  i^i  (
( _V  \  B
)  u.  C ) )
13 ddifss 3447 . . . . . 6  |-  C  C_  ( _V  \  ( _V  \  C ) )
14 unss2 3380 . . . . . 6  |-  ( C 
C_  ( _V  \ 
( _V  \  C
) )  ->  (
( _V  \  B
)  u.  C ) 
C_  ( ( _V 
\  B )  u.  ( _V  \  ( _V  \  C ) ) ) )
1513, 14ax-mp 5 . . . . 5  |-  ( ( _V  \  B )  u.  C )  C_  ( ( _V  \  B )  u.  ( _V  \  ( _V  \  C ) ) )
16 indmss 3468 . . . . . 6  |-  ( ( _V  \  B )  u.  ( _V  \ 
( _V  \  C
) ) )  C_  ( _V  \  ( B  i^i  ( _V  \  C ) ) )
17 invdif 3451 . . . . . . 7  |-  ( B  i^i  ( _V  \  C ) )  =  ( B  \  C
)
1817difeq2i 3324 . . . . . 6  |-  ( _V 
\  ( B  i^i  ( _V  \  C ) ) )  =  ( _V  \  ( B 
\  C ) )
1916, 18sseqtri 3262 . . . . 5  |-  ( ( _V  \  B )  u.  ( _V  \ 
( _V  \  C
) ) )  C_  ( _V  \  ( B  \  C ) )
2015, 19sstri 3237 . . . 4  |-  ( ( _V  \  B )  u.  C )  C_  ( _V  \  ( B  \  C ) )
21 sslin 3435 . . . 4  |-  ( ( ( _V  \  B
)  u.  C ) 
C_  ( _V  \ 
( B  \  C
) )  ->  (
( A  \  C
)  i^i  ( ( _V  \  B )  u.  C ) )  C_  ( ( A  \  C )  i^i  ( _V  \  ( B  \  C ) ) ) )
2220, 21ax-mp 5 . . 3  |-  ( ( A  \  C )  i^i  ( ( _V 
\  B )  u.  C ) )  C_  ( ( A  \  C )  i^i  ( _V  \  ( B  \  C ) ) )
23 invdif 3451 . . 3  |-  ( ( A  \  C )  i^i  ( _V  \ 
( B  \  C
) ) )  =  ( ( A  \  C )  \  ( B  \  C ) )
2422, 23sseqtri 3262 . 2  |-  ( ( A  \  C )  i^i  ( ( _V 
\  B )  u.  C ) )  C_  ( ( A  \  C )  \  ( B  \  C ) )
2512, 24eqsstri 3260 1  |-  ( ( A  \  B ) 
\  C )  C_  ( ( A  \  C )  \  ( B  \  C ) )
Colors of variables: wff set class
Syntax hints:   _Vcvv 2803    \ cdif 3198    u. cun 3199    i^i cin 3200    C_ wss 3201   (/)c0 3496
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-in1 619  ax-in2 620  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-ral 2516  df-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator