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

Theorem issetf 2744
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 2743 . 2  |-  ( A  e.  _V  <->  E. y 
y  =  A )
2 issetf.1 . . . 4  |-  F/_ x A
32nfeq2 2331 . . 3  |-  F/ x  y  =  A
4 nfv 1528 . . 3  |-  F/ y  x  =  A
5 eqeq1 2184 . . 3  |-  ( y  =  x  ->  (
y  =  A  <->  x  =  A ) )
63, 4, 5cbvex 1756 . 2  |-  ( E. y  y  =  A  <->  E. x  x  =  A )
71, 6bitri 184 1  |-  ( A  e.  _V  <->  E. x  x  =  A )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1353   E.wex 1492    e. wcel 2148   F/_wnfc 2306   _Vcvv 2737
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739
This theorem is referenced by:  vtoclgf  2795  spcimgft  2813  spcimegft  2815  bj-vtoclgft  14378
  Copyright terms: Public domain W3C validator