New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  ssdif Unicode version

Theorem ssdif 3401
 Description: Difference law for subsets. (Contributed by NM, 28-May-1998.)
Assertion
Ref Expression
ssdif

Proof of Theorem ssdif
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 ssel 3267 . . . 4
21anim1d 547 . . 3
3 eldif 3221 . . 3
4 eldif 3221 . . 3
52, 3, 43imtr4g 261 . 2
65ssrdv 3278 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wa 358   wcel 1710   cdif 3206   wss 3257 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-dif 3215  df-ss 3259 This theorem is referenced by:  ssdifd  3402  sbthlem1  6203
 Copyright terms: Public domain W3C validator