Theorem wl-issetft 37536

Description: A closed form of issetf 3505. The proof here is a modification of a subproof in vtoclgft 3564, 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 3502	. 2 ⊢ (𝐴 ∈ V ↔ ∃𝑦 𝑦 = 𝐴)
2		nfv 1913	. . . . 5 ⊢ Ⅎ𝑦Ⅎ𝑥𝐴
3		nfnfc1 2911	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
4		nfcvd 2909	. . . . . . 7 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝑦)
5		id 22	. . . . . . 7 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝐴)
6	4, 5	nfeqd 2919	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
7	6	nfnd 1857	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 ¬ 𝑦 = 𝐴)
8		nfvd 1914	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑦 ¬ 𝑥 = 𝐴)
9		eqeq1 2744	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝐴 ↔ 𝑥 = 𝐴))
10	9	notbid 318	. . . . . 6 ⊢ (𝑦 = 𝑥 → (¬ 𝑦 = 𝐴 ↔ ¬ 𝑥 = 𝐴))
11	10	a1i 11	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → (𝑦 = 𝑥 → (¬ 𝑦 = 𝐴 ↔ ¬ 𝑥 = 𝐴)))
12	2, 3, 7, 8, 11	cbv2w 2343	. . . 4 ⊢ (Ⅎ𝑥𝐴 → (∀𝑦 ¬ 𝑦 = 𝐴 ↔ ∀𝑥 ¬ 𝑥 = 𝐴))
13		alnex 1779	. . . 4 ⊢ (∀𝑦 ¬ 𝑦 = 𝐴 ↔ ¬ ∃𝑦 𝑦 = 𝐴)
14		alnex 1779	. . . 4 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴)
15	12, 13, 14	3bitr3g 313	. . 3 ⊢ (Ⅎ𝑥𝐴 → (¬ ∃𝑦 𝑦 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴))
16	15	con4bid 317	. 2 ⊢ (Ⅎ𝑥𝐴 → (∃𝑦 𝑦 = 𝐴 ↔ ∃𝑥 𝑥 = 𝐴))
17	1, 16	bitrid 283	1 ⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206  ∀wal 1535   = wceq 1537  ∃wex 1777   ∈ wcel 2108  Ⅎwnfc 2893  Vcvv 3488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-v 3490

This theorem is referenced by: (None)