Theorem hba1 2329

Description: The setvar 𝑥 is not free in ∀𝑥𝜑. This corresponds to the axiom (4) of modal logic. Example in Appendix in [Megill] p. 450 (p. 19 of the preprint). Also Lemma 22 of [Monk2] p. 114. (Contributed by NM, 24-Jan-1993.) (Proof shortened by Wolf Lammen, 12-Oct-2021.)

Assertion

Ref	Expression
hba1	⊢ (∀𝑥𝜑 → ∀𝑥∀𝑥𝜑)

Proof of Theorem hba1

Step	Hyp	Ref	Expression
1		nfa1 2190	. 2 ⊢ Ⅎ𝑥∀𝑥𝜑
2	1	nf5ri 2234	1 ⊢ (∀𝑥𝜑 → ∀𝑥∀𝑥𝜑)

This proof depends on syntax axioms:   → wi 4  ∀wal 1567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-10 2179  ax-12 2215

This proof depends on definitions:  df-bi 210  df-or 862  df-ex 1812  df-nf 1816

This theorem is used by:  axi5r  2727  axial  2728  bj-19.41al  37685  bj-wnf1  37748  hbntal  45675  hbimpg  45676  hbimpgVD  46025  hbalgVD  46026  hbexgVD  46027  ax6e2eqVD  46028  e2ebindVD  46033  vk15.4jVD  46035  quantgodelALT  48024