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

Theorem dvelimf 2068
 Description: Version of dvelimv 2074 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 1999 . . 3
43bicomi 194 . 2
5 nfnae 2044 . . 3
6 nfeqf 2009 . . . . 5
76ancoms 440 . . . 4
8 dvelimf.1 . . . . 5
98a1i 11 . . . 4
107, 9nfimd 1827 . . 3
115, 10nfald2 2064 . 2
124, 11nfxfrd 1580 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 177   wa 359  wal 1549  wnf 1553 This theorem is referenced by:  dvelimdf  2070  dvelimh  2071  dvelimnf  2075 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950 This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554
 Copyright terms: Public domain W3C validator