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

Theorem issetf 2693
Description: A version of isset that does not require x and A to be distinct. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 10-Oct-2016.)
Hypothesis
Ref Expression
issetf.1  |-  F/_ x A
Assertion
Ref Expression
issetf  |-  ( A  e.  _V  <->  E. x  x  =  A )

Proof of Theorem issetf
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 isset 2692 . 2  |-  ( A  e.  _V  <->  E. y 
y  =  A )
2 issetf.1 . . . 4  |-  F/_ x A
32nfeq2 2293 . . 3  |-  F/ x  y  =  A
4 nfv 1508 . . 3  |-  F/ y  x  =  A
5 eqeq1 2146 . . 3  |-  ( y  =  x  ->  (
y  =  A  <->  x  =  A ) )
63, 4, 5cbvex 1729 . 2  |-  ( E. y  y  =  A  <->  E. x  x  =  A )
71, 6bitri 183 1  |-  ( A  e.  _V  <->  E. x  x  =  A )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480   F/_wnfc 2268   _Vcvv 2686
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688
This theorem is referenced by:  vtoclgf  2744  spcimgft  2762  spcimegft  2764  bj-vtoclgft  12982
  Copyright terms: Public domain W3C validator