ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfald Structured version   Unicode version

Theorem nfald 1640
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  F/
nfald.2  F/
Assertion
Ref Expression
nfald  F/

Proof of Theorem nfald
StepHypRef Expression
1 nfald.1 . . . 4  F/
21nfri 1409 . . 3
3 nfald.2 . . 3  F/
42, 3alrimih 1355 . 2  F/
5 nfnf1 1433 . . . 4  F/ F/
65nfal 1465 . . 3  F/ F/
7 hba1 1430 . . . 4  F/  F/
8 sp 1398 . . . . 5  F/  F/
98nfrd 1410 . . . 4  F/
107, 9hbald 1377 . . 3  F/
116, 10nfd 1413 . 2  F/  F/
124, 11syl 14 1  F/
Colors of variables: wff set class
Syntax hints:   wi 4  wal 1240   F/wnf 1346
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1333  ax-7 1334  ax-gen 1335  ax-4 1397  ax-ial 1424
This theorem depends on definitions:  df-bi 110  df-nf 1347
This theorem is referenced by:  dvelimALT  1883  dvelimfv  1884  nfeudv  1912  nfeqd  2189  nfraldxy  2350  nfiotadxy  4813  bdsepnft  9321  strcollnft  9414
  Copyright terms: Public domain W3C validator