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

Theorem dvelimh 2464
Description: Version of dvelim 2465 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 2141 . . 3 𝑥𝜑
3 dvelimh.2 . . . 4 (𝜓 → ∀𝑧𝜓)
43nf5i 2141 . . 3 𝑧𝜓
5 dvelimh.3 . . 3 (𝑧 = 𝑦 → (𝜑𝜓))
62, 4, 5dvelimf 2462 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜓)
76nf5rd 2186 1 (¬ ∀𝑥 𝑥 = 𝑦 → (𝜓 → ∀𝑥𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wal 1526
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-10 2136  ax-11 2151  ax-12 2167  ax-13 2381
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776
This theorem is referenced by:  dvelim  2465  dveeq1-o16  35952  dveel2ALT  35955  ax6e2nd  40769  ax6e2ndVD  41119  ax6e2ndALT  41141
  Copyright terms: Public domain W3C validator