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

Theorem nfeud 2623
Description: Bound-variable hypothesis builder for the unique existential quantifier. Deduction version of nfeu 2625. Usage of this theorem is discouraged because it depends on ax-13 2407. Use the weaker nfeudw 2622 when possible. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 7-Oct-2016.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfeud.1 𝑦𝜑
nfeud.2 (𝜑 → Ⅎ𝑥𝜓)
Assertion
Ref Expression
nfeud (𝜑 → Ⅎ𝑥∃!𝑦𝜓)

Proof of Theorem nfeud
StepHypRef Expression
1 nfeud.1 . 2 𝑦𝜑
2 nfeud.2 . . 3 (𝜑 → Ⅎ𝑥𝜓)
32adantr 486 . 2 ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓)
41, 3nfeud2 2621 1 (𝜑 → Ⅎ𝑥∃!𝑦𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wal 1568  wnf 1816  ∃!weu 2599
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2407
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2570  df-eu 2600
This theorem is used by:  nfeu  2625
  Copyright terms: Public domain W3C validator