Theorem nfmo 2073

Description: Bound-variable hypothesis builder for "at most one". (Contributed by NM, 9-Mar-1995.)

Hypothesis

Ref	Expression
nfeu.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
nfmo	⊢ Ⅎ𝑥∃*𝑦𝜑

Proof of Theorem nfmo

Step	Hyp	Ref	Expression
1		nftru 1488	. . 3 ⊢ Ⅎ𝑦⊤
2		nfeu.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3	2	a1i 9	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
4	1, 3	nfmod 2070	. 2 ⊢ (⊤ → Ⅎ𝑥∃*𝑦𝜑)
5	4	mptru 1381	1 ⊢ Ⅎ𝑥∃*𝑦𝜑

Syntax hints:  ⊤wtru 1373  Ⅎwnf 1482  ∃*wmo 2054

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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557

This theorem depends on definitions:  df-bi 117  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057

This theorem is referenced by:  euexex  2138  nfdisjv  4032  reusv1  4504  mosubopt  4739  dffun6f  5283