MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfmo Structured version   Unicode version

Theorem nfmo 2298
Description: Bound-variable hypothesis builder for "at most one." (Contributed by NM, 9-Mar-1995.)
Hypothesis
Ref Expression
nfeu.1  |-  F/ x ph
Assertion
Ref Expression
nfmo  |-  F/ x E* y ph

Proof of Theorem nfmo
StepHypRef Expression
1 nftru 1563 . . 3  |-  F/ y  T.
2 nfeu.1 . . . 4  |-  F/ x ph
32a1i 11 . . 3  |-  (  T. 
->  F/ x ph )
41, 3nfmod 2296 . 2  |-  (  T. 
->  F/ x E* y ph )
54trud 1332 1  |-  F/ x E* y ph
Colors of variables: wff set class
Syntax hints:    T. wtru 1325   F/wnf 1553   E*wmo 2282
This theorem is referenced by:  moexex  2350  2moex  2352  2euex  2353  mosubopt  4454  reusv1  4723  reusv2lem1  4724  dffun6f  5468
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-eu 2285  df-mo 2286
  Copyright terms: Public domain W3C validator