| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 3orel1 | Structured version Visualization version GIF version | ||
| Description: Partial elimination of a triple disjunction by denial of a disjunct. (Contributed by Scott Fenton, 26-Mar-2011.) |
| Ref | Expression |
|---|---|
| 3orel1 | ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓 ∨ 𝜒) → (𝜓 ∨ 𝜒))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3orass 1089 | . 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜑 ∨ (𝜓 ∨ 𝜒))) | |
| 2 | orel1 888 | . 2 ⊢ (¬ 𝜑 → ((𝜑 ∨ (𝜓 ∨ 𝜒)) → (𝜓 ∨ 𝜒))) | |
| 3 | 1, 2 | biimtrid 242 | 1 ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓 ∨ 𝜒) → (𝜓 ∨ 𝜒))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∨ wo 847 ∨ w3o 1085 |
| 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-or 848 df-3or 1087 |
| This theorem is referenced by: 3orel2 1485 3orel2OLD 1486 |
| Copyright terms: Public domain | W3C validator |