Metamath Proof Explorer


Theorem issetf

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)

Ref Expression
Hypothesis issetf.1 _ x A
Assertion issetf A V x x = A

Proof

Step Hyp Ref Expression
1 issetf.1 _ x A
2 isset A V y y = A
3 1 nfeq2 x y = A
4 nfv y x = A
5 eqeq1 y = x y = A x = A
6 3 4 5 cbvexv1 y y = A x x = A
7 2 6 bitri A V x x = A