New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  dvelimf Unicode version

Theorem dvelimf 1997
 Description: Version of dvelimv 1939 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 1960 . . 3
43bicomi 193 . 2
5 nfnae 1956 . . 3
6 nfnae 1956 . . . . . 6
7 nfnae 1956 . . . . . 6
86, 7nfan 1824 . . . . 5
9 ax12o 1934 . . . . . 6
109impcom 419 . . . . 5
118, 10nfd 1766 . . . 4
12 dvelimf.1 . . . . 5
1312a1i 10 . . . 4
1411, 13nfimd 1808 . . 3
155, 14nfald2 1972 . 2
164, 15nfxfrd 1571 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wb 176   wa 358  wal 1540  wnf 1544 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925 This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545 This theorem is referenced by:  dvelimnf  2017
 Copyright terms: Public domain W3C validator