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

Theorem nfmo 1962
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 1396 . . 3  |-  F/ y T.
2 nfeu.1 . . . 4  |-  F/ x ph
32a1i 9 . . 3  |-  ( T. 
->  F/ x ph )
41, 3nfmod 1959 . 2  |-  ( T. 
->  F/ x E* y ph )
54trud 1294 1  |-  F/ x E* y ph
Colors of variables: wff set class
Syntax hints:   T. wtru 1286   F/wnf 1390   E*wmo 1943
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 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469
This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946
This theorem is referenced by:  euexex  2027  nfdisjv  3786  reusv1  4216  mosubopt  4431  dffun6f  4945
  Copyright terms: Public domain W3C validator