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

Theorem nfmod 1994
Description: Bound-variable hypothesis builder for "at most one." (Contributed by Mario Carneiro, 14-Nov-2016.)
Hypotheses
Ref Expression
nfeud.1  |-  F/ y
ph
nfeud.2  |-  ( ph  ->  F/ x ps )
Assertion
Ref Expression
nfmod  |-  ( ph  ->  F/ x E* y ps )

Proof of Theorem nfmod
StepHypRef Expression
1 df-mo 1981 . 2  |-  ( E* y ps  <->  ( E. y ps  ->  E! y ps ) )
2 nfeud.1 . . . 4  |-  F/ y
ph
3 nfeud.2 . . . 4  |-  ( ph  ->  F/ x ps )
42, 3nfexd 1719 . . 3  |-  ( ph  ->  F/ x E. y ps )
52, 3nfeud 1993 . . 3  |-  ( ph  ->  F/ x E! y ps )
64, 5nfimd 1549 . 2  |-  ( ph  ->  F/ x ( E. y ps  ->  E! y ps ) )
71, 6nfxfrd 1436 1  |-  ( ph  ->  F/ x E* y ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/wnf 1421   E.wex 1453   E!weu 1977   E*wmo 1978
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500
This theorem depends on definitions:  df-bi 116  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981
This theorem is referenced by:  nfmo  1997
  Copyright terms: Public domain W3C validator