| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hbe1 | Structured version Visualization version GIF version | ||
| Description: The setvar 𝑥 is not free in ∃𝑥𝜑. Corresponds to the axiom (5) of modal logic (see also modal5 2158). (Contributed by NM, 24-Jan-1993.) |
| Ref | Expression |
|---|---|
| hbe1 | ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ex 1781 | . 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑) | |
| 2 | hbn1 2145 | . 2 ⊢ (¬ ∀𝑥 ¬ 𝜑 → ∀𝑥 ¬ ∀𝑥 ¬ 𝜑) | |
| 3 | 1, 2 | hbxfrbi 1826 | 1 ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1539 ∃wex 1780 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-10 2144 |
| This theorem depends on definitions: df-bi 207 df-ex 1781 |
| This theorem is referenced by: nfe1 2153 equs5eALT 2367 nfeqf2 2377 equs5e 2458 axie1 2697 bj-wnf2 36758 bj-nnfe1 36800 ac6s6 38218 exlimexi 44563 vk15.4j 44567 vk15.4jVD 44952 |
| Copyright terms: Public domain | W3C validator |