|   | Mathbox for BJ | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-orim2 | Structured version Visualization version GIF version | ||
| Description: Proof of orim2 970 from the axiomatic definition of disjunction (olc 869, orc 868, jao 963) and minimal implicational calculus. (Contributed by BJ, 4-Apr-2021.) (Proof modification is discouraged.) | 
| Ref | Expression | 
|---|---|
| bj-orim2 | ⊢ ((𝜑 → 𝜓) → ((𝜒 ∨ 𝜑) → (𝜒 ∨ 𝜓))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | orc 868 | . 2 ⊢ (𝜒 → (𝜒 ∨ 𝜓)) | |
| 2 | olc 869 | . . 3 ⊢ (𝜓 → (𝜒 ∨ 𝜓)) | |
| 3 | 2 | imim2i 16 | . 2 ⊢ ((𝜑 → 𝜓) → (𝜑 → (𝜒 ∨ 𝜓))) | 
| 4 | jao 963 | . 2 ⊢ ((𝜒 → (𝜒 ∨ 𝜓)) → ((𝜑 → (𝜒 ∨ 𝜓)) → ((𝜒 ∨ 𝜑) → (𝜒 ∨ 𝜓)))) | |
| 5 | 1, 3, 4 | mpsyl 68 | 1 ⊢ ((𝜑 → 𝜓) → ((𝜒 ∨ 𝜑) → (𝜒 ∨ 𝜓))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∨ wo 848 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |