Theorem jaoa 970

Description: Inference disjoining and conjoining the antecedents of two implications. (Contributed by Stefan Allan, 1-Nov-2008.)

Hypotheses

Ref	Expression
jaao.1	⊢ (𝜑 → (𝜓 → 𝜒))
jaao.2	⊢ (𝜃 → (𝜏 → 𝜒))

Assertion

Ref	Expression
jaoa	⊢ ((𝜑 ∨ 𝜃) → ((𝜓 ∧ 𝜏) → 𝜒))

Proof of Theorem jaoa

Step	Hyp	Ref	Expression
1		jaao.1	. . 3 ⊢ (𝜑 → (𝜓 → 𝜒))
2	1	adantrd 496	. 2 ⊢ (𝜑 → ((𝜓 ∧ 𝜏) → 𝜒))
3		jaao.2	. . 3 ⊢ (𝜃 → (𝜏 → 𝜒))
4	3	adantld 495	. 2 ⊢ (𝜃 → ((𝜓 ∧ 𝜏) → 𝜒))
5	2, 4	jaoi 870	1 ⊢ ((𝜑 ∨ 𝜃) → ((𝜓 ∧ 𝜏) → 𝜒))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∨ wo 860

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861

This theorem is used by:  pm4.79  1021  19.40b  1918  2eu3  2681  abslt  15371  absle  15372  unconn  23595  abslts  28451  dfon2lem4  36284  clsk1indlem3  44797