Metamath Proof Explorer
Description: Associative law for conjunction applied to antecedent (eliminates
syllogism). (Contributed by NM, 15-Nov-2002)
|
|
Ref |
Expression |
|
Hypothesis |
anassrs.1 |
⊢ ( ( 𝜑 ∧ ( 𝜓 ∧ 𝜒 ) ) → 𝜃 ) |
|
Assertion |
anassrs |
⊢ ( ( ( 𝜑 ∧ 𝜓 ) ∧ 𝜒 ) → 𝜃 ) |
Proof
Step |
Hyp |
Ref |
Expression |
1 |
|
anassrs.1 |
⊢ ( ( 𝜑 ∧ ( 𝜓 ∧ 𝜒 ) ) → 𝜃 ) |
2 |
1
|
exp32 |
⊢ ( 𝜑 → ( 𝜓 → ( 𝜒 → 𝜃 ) ) ) |
3 |
2
|
imp31 |
⊢ ( ( ( 𝜑 ∧ 𝜓 ) ∧ 𝜒 ) → 𝜃 ) |