MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfequid Structured version   Visualization version   GIF version

Theorem nfequid 1940
Description: Bound-variable hypothesis builder for 𝑥 = 𝑥. This theorem tells us that any variable, including 𝑥, is effectively not free in 𝑥 = 𝑥, even though 𝑥 is technically free according to the traditional definition of free variable. (Contributed by NM, 13-Jan-2011.) (Revised by NM, 21-Aug-2017.)
Assertion
Ref Expression
nfequid 𝑦 𝑥 = 𝑥

Proof of Theorem nfequid
StepHypRef Expression
1 equid 1939 . 2 𝑥 = 𝑥
21nfth 1727 1 𝑦 𝑥 = 𝑥
Colors of variables: wff setvar class
Syntax hints:  wnf 1708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935
This theorem depends on definitions:  df-bi 197  df-ex 1705  df-nf 1710
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator