Theorem nfeqf2 2385

Description: An equation between setvar is free of any other setvar. Usage of this theorem is discouraged because it depends on ax-13 2380. (Contributed by Wolf Lammen, 9-Jun-2019.) Remove dependency on ax-12 2178. (Revised by Wolf Lammen, 16-Dec-2022.) (New usage is discouraged.)

Assertion

Ref	Expression
nfeqf2	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦)

Distinct variable group:   𝑥,𝑧

Proof of Theorem nfeqf2

Step	Hyp	Ref	Expression
1		exnal 1825	. 2 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦)
2		hbe1 2143	. . . . 5 ⊢ (∃𝑥 𝑧 = 𝑦 → ∀𝑥∃𝑥 𝑧 = 𝑦)
3		ax13lem2 2384	. . . . . 6 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦))
4		ax13lem1 2382	. . . . . 6 ⊢ (¬ 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))
5	3, 4	syldc 48	. . . . 5 ⊢ (∃𝑥 𝑧 = 𝑦 → (¬ 𝑥 = 𝑦 → ∀𝑥 𝑧 = 𝑦))
6	2, 5	eximdh 1863	. . . 4 ⊢ (∃𝑥 𝑧 = 𝑦 → (∃𝑥 ¬ 𝑥 = 𝑦 → ∃𝑥∀𝑥 𝑧 = 𝑦))
7		hbe1a 2144	. . . 4 ⊢ (∃𝑥∀𝑥 𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)
8	6, 7	syl6com 37	. . 3 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))
9	8	nfd 1788	. 2 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦)
10	1, 9	sylbir 235	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦)

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1535  ∃wex 1777  Ⅎwnf 1781

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-10 2141  ax-13 2380

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1778  df-nf 1782

This theorem is referenced by:  dveeq2  2386  nfeqf1  2387  sb4b  2483  sbal1  2536  copsexg  5511  axrepndlem1  10661  axpowndlem2  10667  axpowndlem3  10668  bj-dvelimdv  36817  bj-dvelimdv1  36818  wl-equsb3  37510  wl-sbcom2d-lem1  37513  wl-mo2df  37524  wl-eudf  37526  wl-euequf  37528