MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfmod Unicode version

Theorem nfmod 2299
Description: Bound-variable hypothesis builder for "at most one." (Contributed by Mario Carneiro, 14-Nov-2016.)
Hypotheses
Ref Expression
nfeud.1
nfeud.2
Assertion
Ref Expression
nfmod

Proof of Theorem nfmod
StepHypRef Expression
1 nfeud.1 . 2
2 nfeud.2 . . 3
32adantr 465 . 2
41, 3nfmod2 2297 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  ->wi 4  A.wal 1393  F/wnf 1616  E*wmo 2283
This theorem is referenced by:  nfmo  2301  wl-mo3t  30021
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1613  df-nf 1617  df-eu 2286  df-mo 2287
  Copyright terms: Public domain W3C validator