| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > modal-b | Structured version Visualization version GIF version | ||
| Description: The analogue in our predicate calculus of the Brouwer axiom (B) of modal logic S5. (Contributed by NM, 5-Oct-2005.) |
| Ref | Expression |
|---|---|
| modal-b | ⊢ (𝜑 → ∀𝑥 ¬ ∀𝑥 ¬ 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axc7 2317 | . 2 ⊢ (¬ ∀𝑥 ¬ ∀𝑥 ¬ 𝜑 → ¬ 𝜑) | |
| 2 | 1 | con4i 114 | 1 ⊢ (𝜑 → ∀𝑥 ¬ ∀𝑥 ¬ 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1538 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-10 2141 ax-12 2177 |
| This theorem depends on definitions: df-bi 207 df-ex 1780 |
| This theorem is referenced by: bj-modalbe 36689 |
| Copyright terms: Public domain | W3C validator |