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

Theorem nfald 1871
 Description: If is not free in , it is not free in . (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 6-Jan-2018.)
Hypotheses
Ref Expression
nfald.1
nfald.2
Assertion
Ref Expression
nfald

Proof of Theorem nfald
StepHypRef Expression
1 nfald.1 . . 3
2 nfald.2 . . 3
31, 2alrimi 1781 . 2
4 nfnf1 1808 . . . 4
54nfal 1864 . . 3
6 hba1 1804 . . . 4
7 sp 1763 . . . . 5
87nfrd 1779 . . . 4
96, 8hbald 1755 . . 3
105, 9nfd 1782 . 2
113, 10syl 16 1
 Colors of variables: wff set class Syntax hints:   wi 4  wal 1549  wnf 1553 This theorem is referenced by:  nfexd  1873  dvelimhw  1876  ax12olem4  2008  nfald2  2064  nfsb4tOLD  2128  nfeqd  2586  axrepndlem1  8467  axrepndlem2  8468  axunnd  8471  axpowndlem2  8473  axpowndlem4  8475  axregndlem2  8478  axinfndlem1  8480  axinfnd  8481  axacndlem4  8485  axacndlem5  8486  axacnd  8487 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 This theorem depends on definitions:  df-bi 178  df-ex 1551  df-nf 1554
 Copyright terms: Public domain W3C validator