Theorem syl9r 67

Description: A nested syllogism inference with different antecedents. (Contributed by NM, 5-Aug-1993.)

Hypotheses

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

Assertion

Ref	Expression
syl9r	|- (th -> (ph -> (ps -> ta)))

Proof of Theorem syl9r

Step	Hyp	Ref	Expression
1		syl9r.1	. . 3 |- (ph -> (ps -> ch))
2		syl9r.2	. . 3 |- (th -> (ch -> ta))
3	1, 2	syl9 66	. 2 |- (ph -> (th -> (ps -> ta)))
4	3	com12 27	1 |- (th -> (ph -> (ps -> ta)))

Syntax hints:   -> wi 4

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

This theorem is referenced by:  sylan9r  390  pm2.85dc  810  looinvdc  820  pclem6  1264  nfimd  1474  19.23t  1564  fununi  4910  dfimafn  5165  funimass3  5226  nnsub  7733