Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  issetf Structured version   Unicode version

Theorem issetf 2967
 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
Assertion
Ref Expression
issetf

Proof of Theorem issetf
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 isset 2966 . 2
2 issetf.1 . . . 4
32nfeq2 2589 . . 3
4 nfv 1630 . . 3
5 eqeq1 2448 . . 3
63, 4, 5cbvex 1986 . 2
71, 6bitri 242 1
 Colors of variables: wff set class Syntax hints:   wb 178  wex 1551   wceq 1653   wcel 1727  wnfc 2565  cvv 2962 This theorem is referenced by:  vtoclgf  3016  spcimgft  3033 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1668  ax-8 1689  ax-6 1746  ax-7 1751  ax-11 1763  ax-12 1953  ax-ext 2423 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-v 2964
 Copyright terms: Public domain W3C validator