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

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

Proof of Theorem nfmod2
StepHypRef Expression
1 df-mo 2285 . 2
2 nfeud2.1 . . . 4
3 nfeud2.2 . . . 4
42, 3nfexd2 2061 . . 3
52, 3nfeud2 2292 . . 3
64, 5nfimd 1827 . 2
71, 6nfxfrd 1580 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wa 359  wal 1549  wex 1550  wnf 1553  weu 2280  wmo 2281 This theorem is referenced by:  nfmod  2295  nfrmod  2873  nfrmo  2875  nfdisj  4186 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950 This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-eu 2284  df-mo 2285
 Copyright terms: Public domain W3C validator