Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-vnex Unicode version

Theorem bj-vnex 10689
Description: vnex 3911 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-vnex  |-  -.  E. x  x  =  _V

Proof of Theorem bj-vnex
StepHypRef Expression
1 bj-vprc 10687 . 2  |-  -.  _V  e.  _V
2 isset 2605 . 2  |-  ( _V  e.  _V  <->  E. x  x  =  _V )
31, 2mtbi 627 1  |-  -.  E. x  x  =  _V
Colors of variables: wff set class
Syntax hints:   -. wn 3    = wceq 1284   E.wex 1421    e. wcel 1433   _Vcvv 2601
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-ext 2063  ax-bdn 10608  ax-bdel 10612  ax-bdsep 10675
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-v 2603
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator