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

Theorem hbnae 1767
Description: All variables are effectively bound in a distinct variable specifier. Lemma L19 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
hbnae  |-  ( -. 
A. x  x  =  y  ->  A. z  -.  A. x  x  =  y )

Proof of Theorem hbnae
StepHypRef Expression
1 hbae 1764 . 2  |-  ( A. x  x  =  y  ->  A. z A. x  x  =  y )
21hbn 1700 1  |-  ( -. 
A. x  x  =  y  ->  A. z  -.  A. x  x  =  y )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4   A.wal 1393
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-fal 1401
This theorem is referenced by:  hbnaes  1769  equs5  1875  sbal2  2071
  Copyright terms: Public domain W3C validator