Metamath Proof Explorer


Theorem orsird

Description: A lemma for not-or-not elimination, in deduction form. (Contributed by Giovanni Mascellani, 15-Sep-2017)

Ref Expression
Hypothesis orsird.1 φ¬ψχ
Assertion orsird φ¬χ

Proof

Step Hyp Ref Expression
1 orsird.1 φ¬ψχ
2 ioran ¬ψχ¬ψ¬χ
3 1 2 sylib φ¬ψ¬χ
4 3 simprd φ¬χ