Theorem wl-impchain-com-3.2.1 33281

Description: This theorem is in fact a copy of com3r 87. The proof is an example of how to arrive at arbitrary permutations of antecedents, using only swapping theorems. The recursion principle is to first swap the correct antecedent to the position just before the consequent, and then employ a theorem handling an implication chain of length one less to reorder the others. (Contributed by Wolf Lammen, 17-Nov-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
wl-impchain-com-3.2.1.h1	|- ( th -> ( ch -> ( ps -> ph ) ) )

Assertion

Ref	Expression
wl-impchain-com-3.2.1	|- ( ps -> ( th -> ( ch -> ph ) ) )

Proof of Theorem wl-impchain-com-3.2.1

Step	Hyp	Ref	Expression
1		wl-impchain-com-3.2.1.h1	. . 3 |- ( th -> ( ch -> ( ps -> ph ) ) )
2	1	wl-impchain-com-2.3 33279	. 2 |- ( th -> ( ps -> ( ch -> ph ) ) )
3	2	wl-impchain-com-1.2 33275	1 |- ( ps -> ( th -> ( ch -> ph ) ) )

Syntax hints:   -> wi 4

This theorem was proved from axioms:  ax-mp 5  ax-luk1 33241  ax-luk2 33242  ax-luk3 33243

This theorem is referenced by: (None)