Theorem ccase2 831

Description: Inference for combining cases.

Hypotheses

Ref	Expression
ccase2.1	|- ((ph /\ ps) -> ta)
ccase2.2	|- (ch -> ta)
ccase2.3	|- (th -> ta)

Assertion

Ref	Expression
ccase2	|- (((ph \/ ch) /\ (ps \/ th)) -> ta)

Proof of Theorem ccase2

Step	Hyp	Ref	Expression
1		ccase2.1	. 2 |- ((ph /\ ps) -> ta)
2		ccase2.2	. . 3 |- (ch -> ta)
3	2	adantr 425	. 2 |- ((ch /\ ps) -> ta)
4		ccase2.3	. . 3 |- (th -> ta)
5	4	adantl 424	. 2 |- ((ph /\ th) -> ta)
6	4	adantl 424	. 2 |- ((ch /\ th) -> ta)
7	1, 3, 5, 6	ccase 829	1 |- (((ph \/ ch) /\ (ps \/ th)) -> ta)

Syntax hints:   -> wi 3   \/ wo 239   /\ wa 240

This theorem is referenced by:  add20i 6782  mulge0i 6787  nn0mulcli 7331  bccl2 8223  fctop 8920  cctop 8922

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

This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242

Copyright terms: Public domain