| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-aleximiALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of aleximi 1865 from exim 1867, which is sometimes used as an axiom in instuitionistic modal logic. (Contributed by BJ, 9-Dec-2023.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bj-aleximiALT.1 | ⊢ (𝜑 → (𝜓 → 𝜒)) |
| Ref | Expression |
|---|---|
| bj-aleximiALT | ⊢ (∀𝑥𝜑 → (∃𝑥𝜓 → ∃𝑥𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-aleximiALT.1 | . . 3 ⊢ (𝜑 → (𝜓 → 𝜒)) | |
| 2 | 1 | alimi 1844 | . 2 ⊢ (∀𝑥𝜑 → ∀𝑥(𝜓 → 𝜒)) |
| 3 | exim 1867 | . 2 ⊢ (∀𝑥(𝜓 → 𝜒) → (∃𝑥𝜓 → ∃𝑥𝜒)) | |
| 4 | 2, 3 | syl 18 | 1 ⊢ (∀𝑥𝜑 → (∃𝑥𝜓 → ∃𝑥𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1568 ∃wex 1812 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 |
| This proof depends on definitions: df-bi 210 df-ex 1813 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |