Theorem ad5ant125OLD 1390

Description: Obsolete version of ad5ant125 1389 as of 13-Jun-2026. Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) (Proof shortened by Wolf Lammen, 23-Jun-2022.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

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

Assertion

Ref	Expression
ad5ant125OLD	⊢ (((((𝜑 ∧ 𝜓) ∧ 𝜏) ∧ 𝜂) ∧ 𝜒) → 𝜃)

Proof of Theorem ad5ant125OLD

Step	Hyp	Ref	Expression
1		ad5ant.1	. . . 4 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → 𝜃)
2	1	3expia 1138	. . 3 ⊢ ((𝜑 ∧ 𝜓) → (𝜒 → 𝜃))
3	2	2a1d 27	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝜏 → (𝜂 → (𝜒 → 𝜃))))
4	3	imp41 430	1 ⊢ (((((𝜑 ∧ 𝜓) ∧ 𝜏) ∧ 𝜂) ∧ 𝜒) → 𝜃)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1102

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-3an 1104

This theorem is used by: (None)