Theorem wl-eutf 34811

Description: Closed form of eu6 2659 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 2456	. . 3 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2		nfa1 2155	. . 3 ⊢ Ⅎ𝑥∀𝑥Ⅎ𝑦𝜑
3	1, 2	nfan 1900	. 2 ⊢ Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑)
4		nfnae 2456	. . 3 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
5		nfnf1 2158	. . . 4 ⊢ Ⅎ𝑦Ⅎ𝑦𝜑
6	5	nfal 2342	. . 3 ⊢ Ⅎ𝑦∀𝑥Ⅎ𝑦𝜑
7	4, 6	nfan 1900	. 2 ⊢ Ⅎ𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑)
8		simpl 485	. 2 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → ¬ ∀𝑥 𝑥 = 𝑦)
9		sp 2182	. . 3 ⊢ (∀𝑥Ⅎ𝑦𝜑 → Ⅎ𝑦𝜑)
10	9	adantl 484	. 2 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → Ⅎ𝑦𝜑)
11	3, 7, 8, 10	wl-eudf 34810	1 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑦𝜑) → (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1535  ∃wex 1780  Ⅎwnf 1784  ∃!weu 2653

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2145  ax-11 2161  ax-12 2177  ax-13 2390

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-mo 2622  df-eu 2654

This theorem is referenced by: (None)