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

Theorem dvelimh 2500
Description: Version of dvelim 2501 without any variable restrictions. (Contributed by NM, 1-Oct-2002.) (Proof shortened by Wolf Lammen, 11-May-2018.)
Hypotheses
Ref Expression
dvelimh.1 (𝜑 → ∀𝑥𝜑)
dvelimh.2 (𝜓 → ∀𝑧𝜓)
dvelimh.3 (𝑧 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
dvelimh (¬ ∀𝑥 𝑥 = 𝑦 → (𝜓 → ∀𝑥𝜓))

Proof of Theorem dvelimh
StepHypRef Expression
1 dvelimh.1 . . . 4 (𝜑 → ∀𝑥𝜑)
21nf5i 2191 . . 3 𝑥𝜑
3 dvelimh.2 . . . 4 (𝜓 → ∀𝑧𝜓)
43nf5i 2191 . . 3 𝑧𝜓
5 dvelimh.3 . . 3 (𝑧 = 𝑦 → (𝜑𝜓))
62, 4, 5dvelimf 2498 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜓)
76nf5rd 2232 1 (¬ ∀𝑥 𝑥 = 𝑦 → (𝜓 → ∀𝑥𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wal 1635
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-tru 1641  df-ex 1860  df-nf 1864
This theorem is referenced by:  dvelim  2501  dveeq1-o16  34717  dveel2ALT  34720  ax6e2nd  39273  ax6e2ndVD  39639  ax6e2ndALT  39661
  Copyright terms: Public domain W3C validator