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

Theorem nfnt 1635
Description: If  x is not free in  ph, then it is not free in  -.  ph. (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 28-Dec-2017.) (Revised by BJ, 24-Jul-2019.)
Assertion
Ref Expression
nfnt  |-  ( F/ x ph  ->  F/ x  -.  ph )

Proof of Theorem nfnt
StepHypRef Expression
1 nfnf1 1524 . 2  |-  F/ x F/ x ph
2 df-nf 1438 . . 3  |-  ( F/ x ph  <->  A. x
( ph  ->  A. x ph ) )
3 hbnt 1632 . . 3  |-  ( A. x ( ph  ->  A. x ph )  -> 
( -.  ph  ->  A. x  -.  ph )
)
42, 3sylbi 120 . 2  |-  ( F/ x ph  ->  ( -.  ph  ->  A. x  -.  ph ) )
51, 4nfd 1504 1  |-  ( F/ x ph  ->  F/ x  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4   A.wal 1330   F/wnf 1437
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-5 1424  ax-gen 1426  ax-ie2 1471  ax-4 1488  ax-ial 1515
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438
This theorem is referenced by:  nfnd  1636  nfn  1637
  Copyright terms: Public domain W3C validator