Theorem mpanl1 438

Description: An inference based on modus ponens. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Wolf Lammen, 7-Apr-2013.)

Hypotheses

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

Assertion

Ref	Expression
mpanl1	⊢ ((𝜓 ∧ 𝜒) → 𝜃)

Proof of Theorem mpanl1

Step	Hyp	Ref	Expression
1		mpanl1.1	. . 3 ⊢ 𝜑
2	1	jctl 314	. 2 ⊢ (𝜓 → (𝜑 ∧ 𝜓))
3		mpanl1.2	. 2 ⊢ (((𝜑 ∧ 𝜓) ∧ 𝜒) → 𝜃)
4	2, 3	sylan 283	1 ⊢ ((𝜓 ∧ 𝜒) → 𝜃)

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

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem is used by:  mpanl12  440  ercnv  6828  rec11api  9086  divdiv23apzi  9098  recp1lt1  9232  divgt0i  9243  divge0i  9244  ltreci  9245  lereci  9246  lt2msqi  9247  le2msqi  9248  msq11i  9249  ltdiv23i  9259  fnn0ind  9767  elfzp1b  10515  elfzm1b  10516  sqrt11i  11914  sqrtmuli  11915  sqrtmsq2i  11917  sqrtlei  11918  sqrtlti  11919