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

Theorem velcomp 3951
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 3497 . 2 𝑥 ∈ V
2 eldif 3946 . 2 (𝑥 ∈ (V ∖ 𝐴) ↔ (𝑥 ∈ V ∧ ¬ 𝑥𝐴))
31, 2mpbiran 707 1 (𝑥 ∈ (V ∖ 𝐴) ↔ ¬ 𝑥𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wcel 2114  Vcvv 3494  cdif 3933
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3496  df-dif 3939
This theorem is referenced by:  rnep  5797  compeq  40821  compab  40823
  Copyright terms: Public domain W3C validator