Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  ccased GIF version

Theorem ccased 932
 Description: Deduction for combining cases. (Contributed by NM, 9-May-2004.)
Hypotheses
Ref Expression
ccased.1 (𝜑 → ((𝜓𝜒) → 𝜂))
ccased.2 (𝜑 → ((𝜃𝜒) → 𝜂))
ccased.3 (𝜑 → ((𝜓𝜏) → 𝜂))
ccased.4 (𝜑 → ((𝜃𝜏) → 𝜂))
Assertion
Ref Expression
ccased (𝜑 → (((𝜓𝜃) ∧ (𝜒𝜏)) → 𝜂))

Proof of Theorem ccased
StepHypRef Expression
1 ccased.1 . . . 4 (𝜑 → ((𝜓𝜒) → 𝜂))
21com12 30 . . 3 ((𝜓𝜒) → (𝜑𝜂))
3 ccased.2 . . . 4 (𝜑 → ((𝜃𝜒) → 𝜂))
43com12 30 . . 3 ((𝜃𝜒) → (𝜑𝜂))
5 ccased.3 . . . 4 (𝜑 → ((𝜓𝜏) → 𝜂))
65com12 30 . . 3 ((𝜓𝜏) → (𝜑𝜂))
7 ccased.4 . . . 4 (𝜑 → ((𝜃𝜏) → 𝜂))
87com12 30 . . 3 ((𝜃𝜏) → (𝜑𝜂))
92, 4, 6, 8ccase 931 . 2 (((𝜓𝜃) ∧ (𝜒𝜏)) → (𝜑𝜂))
109com12 30 1 (𝜑 → (((𝜓𝜃) ∧ (𝜒𝜏)) → 𝜂))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ∨ wo 680 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681 This theorem depends on definitions:  df-bi 116 This theorem is referenced by:  zmulcl  9011  gcdabs  11524  lcmabs  11603
 Copyright terms: Public domain W3C validator