Theorem vtoclgft 3501

Description: Closed theorem form of vtoclgf 3513. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 12-Oct-2016.) (Proof shortened by JJ, 11-Aug-2021.) Avoid ax-13 2379. (Revised by Gino Giotto, 6-Oct-2023.)

Assertion

Ref	Expression
vtoclgft	⊢ (((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑) ∧ 𝐴 ∈ 𝑉) → 𝜓)

Proof of Theorem vtoclgft

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elisset 3452	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ∃𝑧 𝑧 = 𝐴)
2		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑧Ⅎ𝑥𝐴
3		nfnfc1 2958	. . . . . . . . 9 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
4		nfcvd 2956	. . . . . . . . . . 11 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝑧)
5		id 22	. . . . . . . . . . 11 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝐴)
6	4, 5	nfeqd 2965	. . . . . . . . . 10 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑧 = 𝐴)
7	6	nfnd 1859	. . . . . . . . 9 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 ¬ 𝑧 = 𝐴)
8		nfvd 1916	. . . . . . . . 9 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑧 ¬ 𝑥 = 𝐴)
9		eqeq1 2802	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝑧 = 𝐴 ↔ 𝑥 = 𝐴))
10	9	a1i 11	. . . . . . . . . . 11 ⊢ (Ⅎ𝑥𝐴 → (𝑧 = 𝑥 → (𝑧 = 𝐴 ↔ 𝑥 = 𝐴)))
11		notbi 322	. . . . . . . . . . 11 ⊢ ((𝑧 = 𝐴 ↔ 𝑥 = 𝐴) ↔ (¬ 𝑧 = 𝐴 ↔ ¬ 𝑥 = 𝐴))
12	10, 11	syl6ib 254	. . . . . . . . . 10 ⊢ (Ⅎ𝑥𝐴 → (𝑧 = 𝑥 → (¬ 𝑧 = 𝐴 ↔ ¬ 𝑥 = 𝐴)))
13		biimp 218	. . . . . . . . . 10 ⊢ ((¬ 𝑧 = 𝐴 ↔ ¬ 𝑥 = 𝐴) → (¬ 𝑧 = 𝐴 → ¬ 𝑥 = 𝐴))
14	12, 13	syl6 35	. . . . . . . . 9 ⊢ (Ⅎ𝑥𝐴 → (𝑧 = 𝑥 → (¬ 𝑧 = 𝐴 → ¬ 𝑥 = 𝐴)))
15	2, 3, 7, 8, 14	cbv1v 2345	. . . . . . . 8 ⊢ (Ⅎ𝑥𝐴 → (∀𝑧 ¬ 𝑧 = 𝐴 → ∀𝑥 ¬ 𝑥 = 𝐴))
16		equcomi 2024	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → 𝑧 = 𝑥)
17		biimpr 223	. . . . . . . . . 10 ⊢ ((¬ 𝑧 = 𝐴 ↔ ¬ 𝑥 = 𝐴) → (¬ 𝑥 = 𝐴 → ¬ 𝑧 = 𝐴))
18	16, 12, 17	syl56 36	. . . . . . . . 9 ⊢ (Ⅎ𝑥𝐴 → (𝑥 = 𝑧 → (¬ 𝑥 = 𝐴 → ¬ 𝑧 = 𝐴)))
19	3, 2, 8, 7, 18	cbv1v 2345	. . . . . . . 8 ⊢ (Ⅎ𝑥𝐴 → (∀𝑥 ¬ 𝑥 = 𝐴 → ∀𝑧 ¬ 𝑧 = 𝐴))
20	15, 19	impbid 215	. . . . . . 7 ⊢ (Ⅎ𝑥𝐴 → (∀𝑧 ¬ 𝑧 = 𝐴 ↔ ∀𝑥 ¬ 𝑥 = 𝐴))
21		alnex 1783	. . . . . . 7 ⊢ (∀𝑧 ¬ 𝑧 = 𝐴 ↔ ¬ ∃𝑧 𝑧 = 𝐴)
22		alnex 1783	. . . . . . 7 ⊢ (∀𝑥 ¬ 𝑥 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴)
23	20, 21, 22	3bitr3g 316	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → (¬ ∃𝑧 𝑧 = 𝐴 ↔ ¬ ∃𝑥 𝑥 = 𝐴))
24	23	con4bid 320	. . . . 5 ⊢ (Ⅎ𝑥𝐴 → (∃𝑧 𝑧 = 𝐴 ↔ ∃𝑥 𝑥 = 𝐴))
25	1, 24	syl5ib 247	. . . 4 ⊢ (Ⅎ𝑥𝐴 → (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴))
26	25	ad2antrr 725	. . 3 ⊢ (((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑)) → (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴))
27	26	3impia 1114	. 2 ⊢ (((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑) ∧ 𝐴 ∈ 𝑉) → ∃𝑥 𝑥 = 𝐴)
28		biimp 218	. . . . . . . . 9 ⊢ ((𝜑 ↔ 𝜓) → (𝜑 → 𝜓))
29	28	imim2i 16	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → (𝑥 = 𝐴 → (𝜑 → 𝜓)))
30	29	com23 86	. . . . . . 7 ⊢ ((𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → (𝜑 → (𝑥 = 𝐴 → 𝜓)))
31	30	imp 410	. . . . . 6 ⊢ (((𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝜑) → (𝑥 = 𝐴 → 𝜓))
32	31	alanimi 1818	. . . . 5 ⊢ ((∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑) → ∀𝑥(𝑥 = 𝐴 → 𝜓))
33		19.23t 2208	. . . . . 6 ⊢ (Ⅎ𝑥𝜓 → (∀𝑥(𝑥 = 𝐴 → 𝜓) ↔ (∃𝑥 𝑥 = 𝐴 → 𝜓)))
34	33	adantl 485	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) → (∀𝑥(𝑥 = 𝐴 → 𝜓) ↔ (∃𝑥 𝑥 = 𝐴 → 𝜓)))
35	32, 34	syl5ib 247	. . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) → ((∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑) → (∃𝑥 𝑥 = 𝐴 → 𝜓)))
36	35	imp 410	. . 3 ⊢ (((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑)) → (∃𝑥 𝑥 = 𝐴 → 𝜓))
37	36	3adant3 1129	. 2 ⊢ (((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑) ∧ 𝐴 ∈ 𝑉) → (∃𝑥 𝑥 = 𝐴 → 𝜓))
38	27, 37	mpd 15	1 ⊢ (((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝜓) ∧ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ ∀𝑥𝜑) ∧ 𝐴 ∈ 𝑉) → 𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084  ∀wal 1536   = wceq 1538  ∃wex 1781  Ⅎwnf 1785   ∈ wcel 2111  Ⅎwnfc 2936

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-ex 1782  df-nf 1786  df-cleq 2791  df-clel 2870  df-nfc 2938

This theorem is referenced by:  vtocldf  3503  bj-vtoclgfALT  34476