ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqv Unicode version

Theorem eqv 3387
Description: The universe contains every set. (Contributed by NM, 11-Sep-2006.)
Assertion
Ref Expression
eqv  |-  ( A  =  _V  <->  A. x  x  e.  A )
Distinct variable group:    x, A

Proof of Theorem eqv
StepHypRef Expression
1 dfcleq 2134 . 2  |-  ( A  =  _V  <->  A. x
( x  e.  A  <->  x  e.  _V ) )
2 vex 2692 . . . 4  |-  x  e. 
_V
32tbt 246 . . 3  |-  ( x  e.  A  <->  ( x  e.  A  <->  x  e.  _V ) )
43albii 1447 . 2  |-  ( A. x  x  e.  A  <->  A. x ( x  e.  A  <->  x  e.  _V ) )
51, 4bitr4i 186 1  |-  ( A  =  _V  <->  A. x  x  e.  A )
Colors of variables: wff set class
Syntax hints:    <-> wb 104   A.wal 1330    = wceq 1332    e. wcel 1481   _Vcvv 2689
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-v 2691
This theorem is referenced by:  setindel  4461  dmi  4762
  Copyright terms: Public domain W3C validator