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

Theorem nfmod 2483
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 481 . 2 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)
41, 3nfmod2 2481 1 (𝜑 → Ⅎ𝑥∃*𝑦𝜓)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1479  wnf 1706  ∃*wmo 2469
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1484  df-ex 1703  df-nf 1708  df-eu 2472  df-mo 2473
This theorem is referenced by:  nfmo  2485  wl-mo3t  33329
  Copyright terms: Public domain W3C validator