MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  inssdif0 Unicode version

Theorem inssdif0 3521
Description: Intersection, subclass, and difference relationship. (Contributed by NM, 27-Oct-1996.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) (Proof shortened by Wolf Lammen, 30-Sep-2014.)
Assertion
Ref Expression
inssdif0  |-  ( ( A  i^i  B ) 
C_  C  <->  ( A  i^i  ( B  \  C
) )  =  (/) )

Proof of Theorem inssdif0
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elin 3358 . . . . . 6  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
21imbi1i 315 . . . . 5  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  <->  ( ( x  e.  A  /\  x  e.  B
)  ->  x  e.  C ) )
3 iman 413 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  B
)  ->  x  e.  C )  <->  -.  (
( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C ) )
42, 3bitri 240 . . . 4  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  <->  -.  ( ( x  e.  A  /\  x  e.  B )  /\  -.  x  e.  C )
)
5 eldif 3162 . . . . . 6  |-  ( x  e.  ( B  \  C )  <->  ( x  e.  B  /\  -.  x  e.  C ) )
65anbi2i 675 . . . . 5  |-  ( ( x  e.  A  /\  x  e.  ( B  \  C ) )  <->  ( x  e.  A  /\  (
x  e.  B  /\  -.  x  e.  C
) ) )
7 elin 3358 . . . . 5  |-  ( x  e.  ( A  i^i  ( B  \  C ) )  <->  ( x  e.  A  /\  x  e.  ( B  \  C
) ) )
8 anass 630 . . . . 5  |-  ( ( ( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C )  <->  ( x  e.  A  /\  (
x  e.  B  /\  -.  x  e.  C
) ) )
96, 7, 83bitr4ri 269 . . . 4  |-  ( ( ( x  e.  A  /\  x  e.  B
)  /\  -.  x  e.  C )  <->  x  e.  ( A  i^i  ( B  \  C ) ) )
104, 9xchbinx 301 . . 3  |-  ( ( x  e.  ( A  i^i  B )  ->  x  e.  C )  <->  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
1110albii 1553 . 2  |-  ( A. x ( x  e.  ( A  i^i  B
)  ->  x  e.  C )  <->  A. x  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
12 dfss2 3169 . 2  |-  ( ( A  i^i  B ) 
C_  C  <->  A. x
( x  e.  ( A  i^i  B )  ->  x  e.  C
) )
13 eq0 3469 . 2  |-  ( ( A  i^i  ( B 
\  C ) )  =  (/)  <->  A. x  -.  x  e.  ( A  i^i  ( B  \  C ) ) )
1411, 12, 133bitr4i 268 1  |-  ( ( A  i^i  B ) 
C_  C  <->  ( A  i^i  ( B  \  C
) )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    /\ wa 358   A.wal 1527    = wceq 1623    e. wcel 1684    \ cdif 3149    i^i cin 3151    C_ wss 3152   (/)c0 3455
This theorem is referenced by:  disjdif  3526  inf3lem3  7331  ssfin4  7936  isnrm2  17086  1stccnp  17188  llycmpkgen2  17245  ufileu  17614  fclscf  17720  flimfnfcls  17723  opnbnd  26243  diophrw  26838  setindtr  27117
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-v 2790  df-dif 3155  df-in 3159  df-ss 3166  df-nul 3456
  Copyright terms: Public domain W3C validator