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

Theorem nfnae 1770
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 1767 . 2  |-  F/ z A. x  x  =  y
21nfn 1706 1  |-  F/ z  -.  A. x  x  =  y
Colors of variables: wff set class
Syntax hints:   -. wn 3   A.wal 1396   F/wnf 1509
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510
This theorem is referenced by:  sbequ6  1831  dvelimfv  2064  nfsb4t  2067
  Copyright terms: Public domain W3C validator