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

Theorem pssdifcom1 3635
 Description: Two ways to express overlapping subsets. (Contributed by Stefan O'Rear, 31-Oct-2014.)
Assertion
Ref Expression
pssdifcom1

Proof of Theorem pssdifcom1
StepHypRef Expression
1 difcom 3634 . . . 4
21a1i 10 . . 3
3 ssconb 3399 . . . . 5
43ancoms 439 . . . 4
54notbid 285 . . 3
62, 5anbi12d 691 . 2
7 dfpss3 3355 . 2
8 dfpss3 3355 . 2
96, 7, 83bitr4g 279 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wb 176   wa 358   cdif 3206   wss 3257   wpss 3258 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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-ne 2518  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215  df-ss 3259  df-pss 3261 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator