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

Theorem nfcvf 2415
Description: If  x and  y are distinct, then  x is not free in  y. (Contributed by Mario Carneiro, 8-Oct-2016.)
Assertion
Ref Expression
nfcvf  |-  ( -. 
A. x  x  =  y  ->  F/_ x y )

Proof of Theorem nfcvf
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 nfcv 2392 . 2  |-  F/_ x
z
2 nfcv 2392 . 2  |-  F/_ z
y
3 id 19 . 2  |-  ( z  =  y  ->  z  =  y )
41, 2, 3dvelimc 2414 1  |-  ( -. 
A. x  x  =  y  ->  F/_ x y )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4   A.wal 1400   F/_wnfc 2379
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-cleq 2231  df-clel 2234  df-nfc 2381
This theorem is referenced by:  nfcvf2  2416
  Copyright terms: Public domain W3C validator