Theorem 3orel2 1486

Description: Partial elimination of a triple disjunction by denial of a disjunct. (Contributed by Scott Fenton, 26-Mar-2011.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Eric Schmidt, 8-Oct-2025.)

Assertion

Ref	Expression
3orel2	⊢ (¬ 𝜓 → ((𝜑 ∨ 𝜓 ∨ 𝜒) → (𝜑 ∨ 𝜒)))

Proof of Theorem 3orel2

Step	Hyp	Ref	Expression
1		3orcoma 1093	. 2 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ (𝜓 ∨ 𝜑 ∨ 𝜒))
2		3orel1 1091	. 2 ⊢ (¬ 𝜓 → ((𝜓 ∨ 𝜑 ∨ 𝜒) → (𝜑 ∨ 𝜒)))
3	1, 2	biimtrid 242	1 ⊢ (¬ 𝜓 → ((𝜑 ∨ 𝜓 ∨ 𝜒) → (𝜑 ∨ 𝜒)))

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 848   ∨ w3o 1086

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 849  df-3or 1088

This theorem is referenced by:  nogesgn1o  27718  nosep1o  27726  nosupbnd1lem5  27757