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

Theorem nfnae 1651
Description: All variables are effectively bound in a distinct variable specifier. (Contributed by Mario Carneiro, 11-Aug-2016.)
Assertion
Ref Expression
nfnae  |-  F/ z  -.  A. x  x  =  y

Proof of Theorem nfnae
StepHypRef Expression
1 nfae 1648 . 2  |-  F/ z A. x  x  =  y
21nfn 1589 1  |-  F/ z  -.  A. x  x  =  y
Colors of variables: wff set class
Syntax hints:   -. wn 3   A.wal 1283   F/wnf 1390
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468
This theorem depends on definitions:  df-bi 115  df-tru 1288  df-fal 1291  df-nf 1391
This theorem is referenced by:  sbequ6  1707  dvelimfv  1929  nfsb4t  1932
  Copyright terms: Public domain W3C validator