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

Theorem velcomp 4057
Description: Characterization of setvar elements of the complement of a class. (Contributed by Andrew Salmon, 15-Jul-2011.)
Assertion
Ref Expression
velcomp (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥 ∈ 𝐴)

Proof of Theorem velcomp
StepHypRef Expression
1 vex 3458 . 2 𝑥 ∈ V
2 eldif 4052 . 2 (𝑥 ∈ (V ∖ 𝐴) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ 𝐴))
31, 2mpbiran 722 1 (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥 ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048
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-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-dif 4050
This theorem is used by:  ddif  4080  dfun2  4218  dfin2  4219  rnep  5916  compeq  45614  compab  45616
  Copyright terms: Public domain W3C validator