| 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 2190). (Contributed by NM, 24-Jan-1993.) |
| Ref | Expression |
|---|---|
| hbe1 | ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ex 1810 | . 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑) | |
| 2 | hbn1 2177 | . 2 ⊢ (¬ ∀𝑥 ¬ 𝜑 → ∀𝑥 ¬ ∀𝑥 ¬ 𝜑) | |
| 3 | 1, 2 | hbxfrbi 1855 | 1 ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1568 ∃wex 1809 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-10 2176 |
| This theorem depends on definitions: df-bi 210 df-ex 1810 |
| This theorem is referenced by: nfe1 2185 nfexhe 2211 equs5eALT 2399 nfeqf2 2409 equs5e 2490 axie1 2729 bj-wnf2 37326 bj-nnfe1 37391 ac6s6 38802 nfale2 42966 exlimexi 45216 vk15.4j 45220 vk15.4jVD 45605 |
| Copyright terms: Public domain | W3C validator |