Theorem nfeudv 1963

Description: Deduction version of nfeu 1967. Similar to nfeud 1964 but has the additional constraint that 𝑥 and 𝑦 must be distinct. (Contributed by Jim Kingdon, 25-May-2018.)

Hypotheses

Ref	Expression
nfeudv.1	⊢ Ⅎ𝑦𝜑
nfeudv.2	⊢ (𝜑 → Ⅎ𝑥𝜓)

Assertion

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

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem nfeudv

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1466	. . 3 ⊢ Ⅎ𝑧𝜑
2		nfeudv.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3		nfeudv.2	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
4		nfv 1466	. . . . . 6 ⊢ Ⅎ𝑥 𝑦 = 𝑧
5	4	a1i 9	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 = 𝑧)
6	3, 5	nfbid 1525	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝜓 ↔ 𝑦 = 𝑧))
7	2, 6	nfald 1690	. . 3 ⊢ (𝜑 → Ⅎ𝑥∀𝑦(𝜓 ↔ 𝑦 = 𝑧))
8	1, 7	nfexd 1691	. 2 ⊢ (𝜑 → Ⅎ𝑥∃𝑧∀𝑦(𝜓 ↔ 𝑦 = 𝑧))
9		df-eu 1951	. . 3 ⊢ (∃!𝑦𝜓 ↔ ∃𝑧∀𝑦(𝜓 ↔ 𝑦 = 𝑧))
10	9	nfbii 1407	. 2 ⊢ (Ⅎ𝑥∃!𝑦𝜓 ↔ Ⅎ𝑥∃𝑧∀𝑦(𝜓 ↔ 𝑦 = 𝑧))
11	8, 10	sylibr 132	1 ⊢ (𝜑 → Ⅎ𝑥∃!𝑦𝜓)

Syntax hints:   → wi 4   ↔ wb 103  ∀wal 1287   = wceq 1289  Ⅎwnf 1394  ∃wex 1426  ∃!weu 1948

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-4 1445  ax-17 1464  ax-ial 1472  ax-i5r 1473

This theorem depends on definitions:  df-bi 115  df-nf 1395  df-eu 1951

This theorem is referenced by:  nfeud  1964