Metamath Proof Explorer


Theorem or32

Description: A rearrangement of disjuncts. (Contributed by NM, 18-Oct-1995) (Proof shortened by Andrew Salmon, 26-Jun-2011)

Ref Expression
Assertion or32 φψχφχψ

Proof

Step Hyp Ref Expression
1 orass φψχφψχ
2 or12 φψχψφχ
3 orcom ψφχφχψ
4 1 2 3 3bitri φψχφχψ