Theorem hbequid 36485

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 does not use ax-c10 36462.) (Contributed by NM, 13-Jan-2011.) (Proof shortened by Wolf Lammen, 23-Mar-2014.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
hbequid	⊢ (𝑥 = 𝑥 → ∀𝑦 𝑥 = 𝑥)

Proof of Theorem hbequid

Step	Hyp	Ref	Expression
1		ax-c9 36466	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (¬ ∀𝑦 𝑦 = 𝑥 → (𝑥 = 𝑥 → ∀𝑦 𝑥 = 𝑥)))
2		ax7 2023	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦 = 𝑥 → 𝑥 = 𝑥))
3	2	pm2.43i 52	. . . 4 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑥)
4	3	alimi 1813	. . 3 ⊢ (∀𝑦 𝑦 = 𝑥 → ∀𝑦 𝑥 = 𝑥)
5	4	a1d 25	. 2 ⊢ (∀𝑦 𝑦 = 𝑥 → (𝑥 = 𝑥 → ∀𝑦 𝑥 = 𝑥))
6	1, 5, 5	pm2.61ii 186	1 ⊢ (𝑥 = 𝑥 → ∀𝑦 𝑥 = 𝑥)

Syntax hints:   → wi 4  ∀wal 1536

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-c9 36466

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782

This theorem is referenced by:  nfequid-o  36486  equidq  36500