Theorem syldanl 614

Description: A syllogism deduction with conjoined antecedents. (Contributed by Jeff Madsen, 20-Jun-2011.)

Hypotheses

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

Assertion

Ref	Expression
syldanl	⊢ (((𝜑 ∧ 𝜓) ∧ 𝜃) → 𝜏)

Proof of Theorem syldanl

Step	Hyp	Ref	Expression
1		syldanl.1	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝜒)
2	1	ex 418	. . 3 ⊢ (𝜑 → (𝜓 → 𝜒))
3	2	imdistani 579	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝜑 ∧ 𝜒))
4		syldanl.2	. 2 ⊢ (((𝜑 ∧ 𝜒) ∧ 𝜃) → 𝜏)
5	3, 4	sylan 592	1 ⊢ (((𝜑 ∧ 𝜓) ∧ 𝜃) → 𝜏)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401

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 402

This theorem is used by:  sylanl2  694  oen0  8626  oeordsuc  8634  erth  8803  phplem2  9251  lo1bdd2  15723  grplmulf1o  19255  grplactcnv  19285  trust  24581  efrlim  27330  suppgsumssiun  33709  evlextv  34257  fedgmullem2  34345  submateq  34524  heibor1lem  38946  idlnegcl  39159  igenmin  39201  eqvrelth  39830  sticksstones22  43421  binomcxplemnotnn0  45543  vonioolem1  47905  vonicclem1  47908  smfsuplem1  48036  smflimsuplem4  48048