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

Theorem dvelimf 2050
 Description: Version of dvelimv 2017 without any variable restrictions. (Contributed by NM, 1-Oct-2002.) (Revised by Mario Carneiro, 6-Oct-2016.)
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 1966 . . 3
43bicomi 194 . 2
5 nfnae 2008 . . 3
6 nfnae 2008 . . . . . 6
7 nfnae 2008 . . . . . 6
86, 7nfan 1842 . . . . 5
9 ax12o 1976 . . . . . 6
109impcom 420 . . . . 5
118, 10nfd 1778 . . . 4
12 dvelimf.1 . . . . 5
1312a1i 11 . . . 4
1411, 13nfimd 1823 . . 3
155, 14nfald2 2029 . 2
164, 15nfxfrd 1577 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 177   wa 359  wal 1546  wnf 1550 This theorem is referenced by:  dvelimnf  2067 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946 This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551
 Copyright terms: Public domain W3C validator