ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfmo Unicode version

Theorem nfmo 1961
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 1395 . . 3  |-  F/ y T.
2 nfeu.1 . . . 4  |-  F/ x ph
32a1i 9 . . 3  |-  ( T. 
->  F/ x ph )
41, 3nfmod 1958 . 2  |-  ( T. 
->  F/ x E* y ph )
54trud 1293 1  |-  F/ x E* y ph
Colors of variables: wff set class
Syntax hints:   T. wtru 1285   F/wnf 1389   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:  euexex  2026  nfdisjv  3778  reusv1  4208  mosubopt  4423  dffun6f  4935
  Copyright terms: Public domain W3C validator