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

Theorem nfmo1 1912
Description: Bound-variable hypothesis builder for "at most one." (Contributed by NM, 8-Mar-1995.) (Revised by Mario Carneiro, 7-Oct-2016.)
Assertion
Ref Expression
nfmo1  |-  F/ x E* x ph

Proof of Theorem nfmo1
StepHypRef Expression
1 df-mo 1904 . 2  |-  ( E* x ph  <->  ( E. x ph  ->  E! x ph ) )
2 nfe1 1385 . . 3  |-  F/ x E. x ph
3 nfeu1 1911 . . 3  |-  F/ x E! x ph
42, 3nfim 1464 . 2  |-  F/ x
( E. x ph  ->  E! x ph )
51, 4nfxfr 1363 1  |-  F/ x E* x ph
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/wnf 1349   E.wex 1381   E!weu 1900   E*wmo 1901
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-ial 1427  ax-i5r 1428
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-eu 1903  df-mo 1904
This theorem is referenced by:  moanmo  1977  euexex  1985  nfrmo1  2482  mob  2723  morex  2725  funimaexglem  4982
  Copyright terms: Public domain W3C validator