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

Theorem ssindif0 4420
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 4414 . 2 ((𝐴 ∩ (V ∖ 𝐵)) = ∅ ↔ 𝐴 ⊆ (V ∖ (V ∖ 𝐵)))
2 ddif 4080 . . 3 (V ∖ (V ∖ 𝐵)) = 𝐵
32sseq2i 3942 . 2 (𝐴 ⊆ (V ∖ (V ∖ 𝐵)) ↔ 𝐴 ⊆ 𝐵)
41, 3bitr2i 279 1 (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ (V ∖ 𝐵)) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-nul 4282
This theorem is used by:  setind  9785  setindregs  35939
  Copyright terms: Public domain W3C validator