Theorem wl-eutf 34974

Description: Closed form of eu6 2634 with a distinctor avoiding distinct variable conditions. (Contributed by Wolf Lammen, 23-Sep-2020.)

Assertion

Ref	Expression
wl-eutf	⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)))

Proof of Theorem wl-eutf

Step	Hyp	Ref	Expression
1		nfnae 2445	. . 3 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2		nfa1 2152	. . 3 ⊢ Ⅎ𝑥∀𝑥Ⅎ𝑦𝜑
3	1, 2	nfan 1900	. 2 ⊢ Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑)
4		nfnae 2445	. . 3 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
5		nfnf1 2155	. . . 4 ⊢ Ⅎ𝑦Ⅎ𝑦𝜑
6	5	nfal 2331	. . 3 ⊢ Ⅎ𝑦∀𝑥Ⅎ𝑦𝜑
7	4, 6	nfan 1900	. 2 ⊢ Ⅎ𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑)
8		simpl 486	. 2 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → ¬ ∀𝑥 𝑥 = 𝑦)
9		sp 2180	. . 3 ⊢ (∀𝑥Ⅎ𝑦𝜑 → Ⅎ𝑦𝜑)
10	9	adantl 485	. 2 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → Ⅎ𝑦𝜑)
11	3, 7, 8, 10	wl-eudf 34973	1 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536  ∃wex 1781  Ⅎwnf 1785  ∃!weu 2628

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-10 2142  ax-11 2158  ax-12 2175  ax-13 2379

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-mo 2598  df-eu 2629

This theorem is referenced by: (None)