Theorem syl6d 64

Description: A nested syllogism deduction. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Josh Purinton, 29-Dec-2000.) (Proof shortened by O'Cat, 2-Feb-2006.)

Hypotheses

Ref	Expression
syl6d.1	|- (ph -> (ps -> (ch -> th)))
syl6d.2	|- (ph -> (th -> ta))

Assertion

Ref	Expression
syl6d	|- (ph -> (ps -> (ch -> ta)))

Proof of Theorem syl6d

Step	Hyp	Ref	Expression
1		syl6d.1	. 2 |- (ph -> (ps -> (ch -> th)))
2		syl6d.2	. . 3 |- (ph -> (th -> ta))
3	2	a1d 22	. 2 |- (ph -> (ps -> (th -> ta)))
4	1, 3	syldd 61	1 |- (ph -> (ps -> (ch -> ta)))

Syntax hints:   -> wi 4

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7

This theorem is referenced by:  syl8  65  cbv1h  1978  sbi1  2063