Theorem wl-issetft 38270

Description: A closed form of issetf 3474. The proof here is a modification of a subproof in vtoclgft 3522, where it could be used to shorten the proof. (Contributed by Wolf Lammen, 25-Jan-2025.)

Assertion

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

Proof of Theorem wl-issetft

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isset 3471	. 2 ⊢ (𝐴 ∈ V ↔ ∃𝑦 𝑦 = 𝐴)
2		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦Ⅎ𝑥𝐴
3		nfnfc1 2930	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
4		nfcvd 2928	. . . . . . 7 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝑦)
5		id 23	. . . . . . 7 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝐴)
6	4, 5	nfeqd 2937	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
7	6	nfnd 1891	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 ¬ 𝑦 = 𝐴)
8		nfvd 1948	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑦 ¬ 𝑥 = 𝐴)
9		eqeq1 2769	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝐴 ↔ 𝑥 = 𝐴))
10	9	notbid 321	. . . . . 6 ⊢ (𝑦 = 𝑥 → (¬ 𝑦 = 𝐴 ↔ ¬ 𝑥 = 𝐴))
11	10	a1i 11	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → (𝑦 = 𝑥 → (¬ 𝑦 = 𝐴 ↔ ¬ 𝑥 = 𝐴)))
12	2, 3, 7, 8, 11	cbv2w 2371	. . . 4 ⊢ (Ⅎ𝑥𝐴 → (∀𝑦 ¬ 𝑦 = 𝐴 ↔ ∀𝑥 ¬ 𝑥 = 𝐴))
13		alnex 1814	. . . 4 ⊢ (∀𝑦 ¬ 𝑦 = 𝐴 ↔ ¬ ∃𝑦 𝑦 = 𝐴)
14		alnex 1814	. . . 4 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴)
15	12, 13, 14	3bitr3g 316	. . 3 ⊢ (Ⅎ𝑥𝐴 → (¬ ∃𝑦 𝑦 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴))
16	15	con4bid 320	. 2 ⊢ (Ⅎ𝑥𝐴 → (∃𝑦 𝑦 = 𝐴 ↔ ∃𝑥 𝑥 = 𝐴))
17	1, 16	bitrid 286	1 ⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2146  Ⅎwnfc 2912  Vcvv 3457

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

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 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-v 3459

This theorem is used by: (None)