Theorem 3adant3r 1266

Description: Deduction adding a conjunct to antecedent. (Contributed by NM, 8-Jan-2006.)

Hypothesis

Ref	Expression
3adant1l.1	⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)

Assertion

Ref	Expression
3adant3r	⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜏)) → 𝜃)

Proof of Theorem 3adant3r

Step	Hyp	Ref	Expression
1		3adant1l.1	. . . 4 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)
2	1	3com13 1239	. . 3 ⊢ ((𝜒 ∧ 𝜓 ∧ 𝜑) → 𝜃)
3	2	3adant1r 1262	. 2 ⊢ (((𝜒 ∧ 𝜏) ∧ 𝜓 ∧ 𝜑) → 𝜃)
4	3	3com13 1239	1 ⊢ ((𝜑 ∧ 𝜓 ∧ (𝜒 ∧ 𝜏)) → 𝜃)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1009

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem depends on definitions:  df-bi 117  df-3an 1011

This theorem is referenced by:  addassnqg  7743  mulassnqg  7745  prarloc  7864  ltpopr  7956  ltexprlemfl  7970  ltexprlemfu  7972  addasssrg  8117  axaddass  8233  apmul1  9112  ltmul2  9180  lemul2  9181  dvdscmulr  12570  dvdsmulcr  12571  modremain  12679  ndvdsadd  12681  rpexp12i  12916  xblcntrps  15497  xblcntr  15498