Theorem nfmod 1958

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

Hypotheses

Ref	Expression
nfeud.1	|- F/ y ph
nfeud.2	|- ( ph -> F/ x ps )

Assertion

Ref	Expression
nfmod	|- ( ph -> F/ x E* y ps )

Proof of Theorem nfmod

Step	Hyp	Ref	Expression
1		df-mo 1945	. 2 |- ( E* y ps <-> ( E. y ps -> E! y ps ) )
2		nfeud.1	. . . 4 |- F/ y ph
3		nfeud.2	. . . 4 |- ( ph -> F/ x ps )
4	2, 3	nfexd 1684	. . 3 |- ( ph -> F/ x E. y ps )
5	2, 3	nfeud 1957	. . 3 |- ( ph -> F/ x E! y ps )
6	4, 5	nfimd 1517	. 2 |- ( ph -> F/ x ( E. y ps -> E! y ps ) )
7	1, 6	nfxfrd 1404	1 |- ( ph -> F/ x E* y ps )

Syntax hints:   -> wi 4   F/wnf 1389   E.wex 1421   E!weu 1941   E*wmo 1942

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-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945

This theorem is referenced by:  nfmo  1961