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

Theorem difin2 3384
Description: Represent a set difference as an intersection with a larger difference. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
difin2  |-  ( A 
C_  C  ->  ( A  \  B )  =  ( ( C  \  B )  i^i  A
) )

Proof of Theorem difin2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ssel 3136 . . . . 5  |-  ( A 
C_  C  ->  (
x  e.  A  ->  x  e.  C )
)
21pm4.71d 391 . . . 4  |-  ( A 
C_  C  ->  (
x  e.  A  <->  ( x  e.  A  /\  x  e.  C ) ) )
32anbi1d 461 . . 3  |-  ( A 
C_  C  ->  (
( x  e.  A  /\  -.  x  e.  B
)  <->  ( ( x  e.  A  /\  x  e.  C )  /\  -.  x  e.  B )
) )
4 eldif 3125 . . 3  |-  ( x  e.  ( A  \  B )  <->  ( x  e.  A  /\  -.  x  e.  B ) )
5 elin 3305 . . . 4  |-  ( x  e.  ( ( C 
\  B )  i^i 
A )  <->  ( x  e.  ( C  \  B
)  /\  x  e.  A ) )
6 eldif 3125 . . . . 5  |-  ( x  e.  ( C  \  B )  <->  ( x  e.  C  /\  -.  x  e.  B ) )
76anbi1i 454 . . . 4  |-  ( ( x  e.  ( C 
\  B )  /\  x  e.  A )  <->  ( ( x  e.  C  /\  -.  x  e.  B
)  /\  x  e.  A ) )
8 ancom 264 . . . . 5  |-  ( ( ( x  e.  C  /\  -.  x  e.  B
)  /\  x  e.  A )  <->  ( x  e.  A  /\  (
x  e.  C  /\  -.  x  e.  B
) ) )
9 anass 399 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  C
)  /\  -.  x  e.  B )  <->  ( x  e.  A  /\  (
x  e.  C  /\  -.  x  e.  B
) ) )
108, 9bitr4i 186 . . . 4  |-  ( ( ( x  e.  C  /\  -.  x  e.  B
)  /\  x  e.  A )  <->  ( (
x  e.  A  /\  x  e.  C )  /\  -.  x  e.  B
) )
115, 7, 103bitri 205 . . 3  |-  ( x  e.  ( ( C 
\  B )  i^i 
A )  <->  ( (
x  e.  A  /\  x  e.  C )  /\  -.  x  e.  B
) )
123, 4, 113bitr4g 222 . 2  |-  ( A 
C_  C  ->  (
x  e.  ( A 
\  B )  <->  x  e.  ( ( C  \  B )  i^i  A
) ) )
1312eqrdv 2163 1  |-  ( A 
C_  C  ->  ( A  \  B )  =  ( ( C  \  B )  i^i  A
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    = wceq 1343    e. wcel 2136    \ cdif 3113    i^i cin 3115    C_ wss 3116
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-dif 3118  df-in 3122  df-ss 3129
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator