Metamath Proof Explorer


Theorem anan

Description: Multiple commutations in conjunction. (Contributed by Peter Mazsa, 7-Mar-2020)

Ref Expression
Assertion anan φψχφθτψθφχτ

Proof

Step Hyp Ref Expression
1 an4 φψχφθτφψφθχτ
2 anandi φψθφψφθ
3 ancom φψθψθφ
4 2 3 bitr3i φψφθψθφ
5 4 anbi1i φψφθχτψθφχτ
6 anass ψθφχτψθφχτ
7 1 5 6 3bitri φψχφθτψθφχτ