Theorem syldanl 603

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 412	. . 3 ⊢ (𝜑 → (𝜓 → 𝜒))
3	2	imdistani 568	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝜑 ∧ 𝜒))
4		syldanl.2	. 2 ⊢ (((𝜑 ∧ 𝜒) ∧ 𝜃) → 𝜏)
5	3, 4	sylan 581	1 ⊢ (((𝜑 ∧ 𝜓) ∧ 𝜃) → 𝜏)

Syntax hints:   → wi 4   ∧ wa 395

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

This theorem depends on definitions:  df-bi 207  df-an 396

This theorem is referenced by:  sylanl2  682  oen0  8515  oeordsuc  8523  erth  8691  phplem2  9132  lo1bdd2  15477  grplmulf1o  18980  grplactcnv  19010  trust  24204  efrlim  26946  efrlimOLD  26947  suppgsumssiun  33148  evlextv  33701  fedgmullem2  33790  submateq  33969  heibor1lem  38144  idlnegcl  38357  igenmin  38399  eqvrelth  39030  sticksstones22  42621  binomcxplemnotnn0  44801  vonioolem1  47126  vonicclem1  47129  smfsuplem1  47257  smflimsuplem4  47269