| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hba1 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| hba1 | ⊢ (∀𝑥𝜑 → ∀𝑥∀𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfa1 2162 | . 2 ⊢ Ⅎ𝑥∀𝑥𝜑 | |
| 2 | 1 | nf5ri 2207 | 1 ⊢ (∀𝑥𝜑 → ∀𝑥∀𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1545 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-10 2152 ax-12 2189 |
| This theorem depends on definitions: df-bi 208 df-or 854 df-ex 1787 df-nf 1791 |
| This theorem is referenced by: axi5r 2703 axial 2704 bj-19.41al 36999 bj-wnf1 37062 hbntal 44997 hbimpg 44998 hbimpgVD 45347 hbalgVD 45348 hbexgVD 45349 ax6e2eqVD 45350 e2ebindVD 45355 vk15.4jVD 45357 quantgodelALT 47318 |
| Copyright terms: Public domain | W3C validator |