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

Theorem dvelimf 2137
 Description: Version of dvelimv 2141 without any variable restrictions. (Contributed by NM, 1-Oct-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof shortened by Wolf Lammen, 11-May-2018.)
Hypotheses
Ref Expression
dvelimf.1
dvelimf.2
dvelimf.3
Assertion
Ref Expression
dvelimf

Proof of Theorem dvelimf
StepHypRef Expression
1 dvelimf.2 . . . 4
2 dvelimf.3 . . . 4
31, 2equsal 2095 . . 3
43bicomi 205 . 2
5 nfnae 2119 . . 3
6 nfeqf 2106 . . . . 5
76ancoms 454 . . . 4
8 dvelimf.1 . . . . 5
98a1i 11 . . . 4
107, 9nfimd 1977 . . 3
115, 10nfald2 2134 . 2
124, 11nfxfrd 1691 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wb 187   wa 370  wal 1435  wnf 1661 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2058 This theorem depends on definitions:  df-bi 188  df-an 372  df-ex 1658  df-nf 1662 This theorem is referenced by:  dvelimdf  2138  dvelimh  2139  dvelimnf  2142
 Copyright terms: Public domain W3C validator