Theorem nfmod 2031

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 2018	. 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 1749	. . 3 |- ( ph -> F/ x E. y ps )
5	2, 3	nfeud 2030	. . 3 |- ( ph -> F/ x E! y ps )
6	4, 5	nfimd 1573	. 2 |- ( ph -> F/ x ( E. y ps -> E! y ps ) )
7	1, 6	nfxfrd 1463	1 |- ( ph -> F/ x E* y ps )

Syntax hints:   -> wi 4   F/wnf 1448   E.wex 1480   E!weu 2014   E*wmo 2015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523

This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018

This theorem is referenced by:  nfmo  2034