Theorem nfeud2 2616

Description: Bound-variable hypothesis builder for uniqueness. (Contributed by Mario Carneiro, 14-Nov-2016.) (Proof shortened by Wolf Lammen, 4-Oct-2018.) (Proof shortened by BJ, 14-Oct-2022.) Usage of this theorem is discouraged because it depends on ax-13 2402. Use nfeudw 2617 instead. (New usage is discouraged.)

Hypotheses

Ref	Expression
nfeud2.1	⊢ Ⅎ𝑦𝜑
nfeud2.2	⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)

Assertion

Ref	Expression
nfeud2	⊢ (𝜑 → Ⅎ𝑥∃!𝑦𝜓)

Proof of Theorem nfeud2

Step	Hyp	Ref	Expression
1		df-eu 2595	. 2 ⊢ (∃!𝑦𝜓 ↔ (∃𝑦𝜓 ∧ ∃*𝑦𝜓))
2		nfeud2.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3		nfeud2.2	. . . 4 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)
4	2, 3	nfexd2 2476	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃𝑦𝜓)
5	2, 3	nfmod2 2584	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃*𝑦𝜓)
6	4, 5	nfand 1930	. 2 ⊢ (𝜑 → Ⅎ𝑥(∃𝑦𝜓 ∧ ∃*𝑦𝜓))
7	1, 6	nfxfrd 1887	1 ⊢ (𝜑 → Ⅎ𝑥∃!𝑦𝜓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816  ∃*wmo 2563  ∃!weu 2594

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2565  df-eu 2595

This theorem is used by:  nfeud  2618  nfreud  3410