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

Theorem velcomp 3917
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 3457 . 2 𝑥 ∈ V
2 eldif 3912 . 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 2145  Vcvv 3453  cdif 3899
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-dif 3905
This theorem is used by:  ddif  4091  dfun2  4219  dfin2  4220  rnep  5915  compeq  45265  compab  45267
  Copyright terms: Public domain W3C validator