MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssindif0 Structured version   Visualization version   GIF version

Theorem ssindif0 4416
Description: Subclass expressed in terms of intersection with difference from the universal class. (Contributed by NM, 17-Sep-2003.)
Assertion
Ref Expression
ssindif0 (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ (V ∖ 𝐵)) = ∅)

Proof of Theorem ssindif0
StepHypRef Expression
1 disj2 4410 . 2 ((𝐴 ∩ (V ∖ 𝐵)) = ∅ ↔ 𝐴 ⊆ (V ∖ (V ∖ 𝐵)))
2 ddif 4077 . . 3 (V ∖ (V ∖ 𝐵)) = 𝐵
32sseq2i 3937 . 2 (𝐴 ⊆ (V ∖ (V ∖ 𝐵)) ↔ 𝐴 ⊆ 𝐵)
41, 3bitr2i 279 1 (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ (V ∖ 𝐵)) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045   ∩ cin 4089  ∅c0 4278
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-nul 4279
This theorem is used by:  setind  9752  setindregs  35855
  Copyright terms: Public domain W3C validator