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

Theorem eqv 3377
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 2131 . 2  |-  ( A  =  _V  <->  A. x
( x  e.  A  <->  x  e.  _V ) )
2 vex 2684 . . . 4  |-  x  e. 
_V
32tbt 246 . . 3  |-  ( x  e.  A  <->  ( x  e.  A  <->  x  e.  _V ) )
43albii 1446 . 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 1329    = wceq 1331    e. wcel 1480   _Vcvv 2681
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 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-v 2683
This theorem is referenced by:  setindel  4448  dmi  4749
  Copyright terms: Public domain W3C validator