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

Theorem nfmo 2046
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 1466 . . 3  |-  F/ y T.
2 nfeu.1 . . . 4  |-  F/ x ph
32a1i 9 . . 3  |-  ( T. 
->  F/ x ph )
41, 3nfmod 2043 . 2  |-  ( T. 
->  F/ x E* y ph )
54mptru 1362 1  |-  F/ x E* y ph
Colors of variables: wff set class
Syntax hints:   T. wtru 1354   F/wnf 1460   E*wmo 2027
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030
This theorem is referenced by:  euexex  2111  nfdisjv  3993  reusv1  4459  mosubopt  4692  dffun6f  5230
  Copyright terms: Public domain W3C validator