Theorem issetft 3466

Description: Closed theorem form of isset 3464 that does not require 𝑥 and 𝐴 to be distinct. Extracted from the proof of vtoclgft 3515. (Contributed by Wolf Lammen, 9-Apr-2025.)

Assertion

Ref	Expression
issetft	⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴))

Proof of Theorem issetft

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isset 3464	. 2 ⊢ (𝐴 ∈ V ↔ ∃𝑦 𝑦 = 𝐴)
2		cbvexeqsetf 3465	. 2 ⊢ (Ⅎ𝑥𝐴 → (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴))
3	1, 2	bitr4id 293	1 ⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2145  Ⅎwnfc 2907  Vcvv 3450

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-v 3452

This theorem is used by:  issetf  3467