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

Theorem dvelimh 2185
 Description: Version of dvelim 2186 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
21nfi 1682 . . 3
3 dvelimh.2 . . . 4
43nfi 1682 . . 3
5 dvelimh.3 . . 3
62, 4, 5dvelimf 2183 . 2
76nfrd 1973 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wb 189  wal 1450 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104 This theorem depends on definitions:  df-bi 190  df-an 378  df-ex 1672  df-nf 1676 This theorem is referenced by:  dvelim  2186  dveeq1-o16  32571  dveel2ALT  32574  ax6e2nd  36995  ax6e2ndVD  37368  ax6e2ndALT  37390
 Copyright terms: Public domain W3C validator