Theorem nfmod 2059

Description: Bound-variable hypothesis builder for "at most one". (Contributed by Mario Carneiro, 14-Nov-2016.)

Hypotheses

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

Assertion

Ref	Expression
nfmod	⊢ (𝜑 → Ⅎ𝑥∃*𝑦𝜓)

Proof of Theorem nfmod

Step	Hyp	Ref	Expression
1		df-mo 2046	. 2 ⊢ (∃*𝑦𝜓 ↔ (∃𝑦𝜓 → ∃!𝑦𝜓))
2		nfeud.1	. . . 4 ⊢ Ⅎ𝑦𝜑
3		nfeud.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜓)
4	2, 3	nfexd 1772	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃𝑦𝜓)
5	2, 3	nfeud 2058	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃!𝑦𝜓)
6	4, 5	nfimd 1596	. 2 ⊢ (𝜑 → Ⅎ𝑥(∃𝑦𝜓 → ∃!𝑦𝜓))
7	1, 6	nfxfrd 1486	1 ⊢ (𝜑 → Ⅎ𝑥∃*𝑦𝜓)

Syntax hints:   → wi 4  Ⅎwnf 1471  ∃wex 1503  ∃!weu 2042  ∃*wmo 2043

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046

This theorem is referenced by:  nfmo  2062