Theorem nfequid-o 36924

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. (The proof uses only ax-4 1812, ax-7 2011, ax-c9 36904, and ax-gen 1798. This shows that this can be proved without ax6 2384, even though Theorem equid 2015 cannot. A shorter proof using ax6 2384 is obtainable from equid 2015 and hbth 1806.) Remark added 2-Dec-2015 NM: This proof does implicitly use ax6v 1972, which is used for the derivation of axc9 2382, unless we consider ax-c9 36904 the starting axiom rather than ax-13 2372. (Contributed by NM, 13-Jan-2011.) (Revised by Mario Carneiro, 12-Oct-2016.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
nfequid-o	⊢ Ⅎ𝑦 𝑥 = 𝑥

Proof of Theorem nfequid-o

Step	Hyp	Ref	Expression
1		hbequid 36923	. 2 ⊢ (𝑥 = 𝑥 → ∀𝑦 𝑥 = 𝑥)
2	1	nf5i 2142	1 ⊢ Ⅎ𝑦 𝑥 = 𝑥

Syntax hints:  Ⅎwnf 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-c9 36904

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-nf 1787

This theorem is referenced by: (None)