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

Theorem nfmo 2017
 Description: Bound-variable hypothesis builder for "at most one." (Contributed by NM, 9-Mar-1995.)
Hypothesis
Ref Expression
nfeu.1 𝑥𝜑
Assertion
Ref Expression
nfmo 𝑥∃*𝑦𝜑

Proof of Theorem nfmo
StepHypRef Expression
1 nftru 1442 . . 3 𝑦
2 nfeu.1 . . . 4 𝑥𝜑
32a1i 9 . . 3 (⊤ → Ⅎ𝑥𝜑)
41, 3nfmod 2014 . 2 (⊤ → Ⅎ𝑥∃*𝑦𝜑)
54mptru 1340 1 𝑥∃*𝑦𝜑
 Colors of variables: wff set class Syntax hints:  ⊤wtru 1332  Ⅎwnf 1436  ∃*wmo 1998 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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515 This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001 This theorem is referenced by:  euexex  2082  nfdisjv  3913  reusv1  4374  mosubopt  4599  dffun6f  5131
 Copyright terms: Public domain W3C validator