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

Theorem difindiss 3371
Description: Distributive law for class difference. In classical logic, for example, theorem 40 of [Suppes] p. 29, this is an equality instead of subset. (Contributed by Jim Kingdon, 26-Jul-2018.)
Assertion
Ref Expression
difindiss  |-  ( ( A  \  B )  u.  ( A  \  C ) )  C_  ( A  \  ( B  i^i  C ) )

Proof of Theorem difindiss
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elun 3258 . . 3  |-  ( x  e.  ( ( A 
\  B )  u.  ( A  \  C
) )  <->  ( x  e.  ( A  \  B
)  \/  x  e.  ( A  \  C
) ) )
2 eldif 3120 . . . . . . 7  |-  ( x  e.  ( A  \  B )  <->  ( x  e.  A  /\  -.  x  e.  B ) )
3 eldif 3120 . . . . . . 7  |-  ( x  e.  ( A  \  C )  <->  ( x  e.  A  /\  -.  x  e.  C ) )
42, 3orbi12i 754 . . . . . 6  |-  ( ( x  e.  ( A 
\  B )  \/  x  e.  ( A 
\  C ) )  <-> 
( ( x  e.  A  /\  -.  x  e.  B )  \/  (
x  e.  A  /\  -.  x  e.  C
) ) )
5 andi 808 . . . . . 6  |-  ( ( x  e.  A  /\  ( -.  x  e.  B  \/  -.  x  e.  C ) )  <->  ( (
x  e.  A  /\  -.  x  e.  B
)  \/  ( x  e.  A  /\  -.  x  e.  C )
) )
64, 5bitr4i 186 . . . . 5  |-  ( ( x  e.  ( A 
\  B )  \/  x  e.  ( A 
\  C ) )  <-> 
( x  e.  A  /\  ( -.  x  e.  B  \/  -.  x  e.  C ) ) )
7 pm3.14 743 . . . . . 6  |-  ( ( -.  x  e.  B  \/  -.  x  e.  C
)  ->  -.  (
x  e.  B  /\  x  e.  C )
)
87anim2i 340 . . . . 5  |-  ( ( x  e.  A  /\  ( -.  x  e.  B  \/  -.  x  e.  C ) )  -> 
( x  e.  A  /\  -.  ( x  e.  B  /\  x  e.  C ) ) )
96, 8sylbi 120 . . . 4  |-  ( ( x  e.  ( A 
\  B )  \/  x  e.  ( A 
\  C ) )  ->  ( x  e.  A  /\  -.  (
x  e.  B  /\  x  e.  C )
) )
10 eldif 3120 . . . . 5  |-  ( x  e.  ( A  \ 
( B  i^i  C
) )  <->  ( x  e.  A  /\  -.  x  e.  ( B  i^i  C
) ) )
11 elin 3300 . . . . . . 7  |-  ( x  e.  ( B  i^i  C )  <->  ( x  e.  B  /\  x  e.  C ) )
1211notbii 658 . . . . . 6  |-  ( -.  x  e.  ( B  i^i  C )  <->  -.  (
x  e.  B  /\  x  e.  C )
)
1312anbi2i 453 . . . . 5  |-  ( ( x  e.  A  /\  -.  x  e.  ( B  i^i  C ) )  <-> 
( x  e.  A  /\  -.  ( x  e.  B  /\  x  e.  C ) ) )
1410, 13bitr2i 184 . . . 4  |-  ( ( x  e.  A  /\  -.  ( x  e.  B  /\  x  e.  C
) )  <->  x  e.  ( A  \  ( B  i^i  C ) ) )
159, 14sylib 121 . . 3  |-  ( ( x  e.  ( A 
\  B )  \/  x  e.  ( A 
\  C ) )  ->  x  e.  ( A  \  ( B  i^i  C ) ) )
161, 15sylbi 120 . 2  |-  ( x  e.  ( ( A 
\  B )  u.  ( A  \  C
) )  ->  x  e.  ( A  \  ( B  i^i  C ) ) )
1716ssriv 3141 1  |-  ( ( A  \  B )  u.  ( A  \  C ) )  C_  ( A  \  ( B  i^i  C ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 103    \/ wo 698    e. wcel 2135    \ cdif 3108    u. cun 3109    i^i cin 3110    C_ wss 3111
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 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-ext 2146
This theorem depends on definitions:  df-bi 116  df-tru 1345  df-nf 1448  df-sb 1750  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-v 2723  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124
This theorem is referenced by:  difdif2ss  3374  indmss  3376
  Copyright terms: Public domain W3C validator