MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  adantrlr Structured version   Visualization version   GIF version

Theorem adantrlr 736
Description: Deduction adding a conjunct to antecedent. (Contributed by NM, 26-Dec-2004.) (Proof shortened by Wolf Lammen, 4-Dec-2012.)
Hypothesis
Ref Expression
adantr2.1 ((𝜑 ∧ (𝜓 ∧ 𝜒)) → 𝜃)
Assertion
Ref Expression
adantrlr ((𝜑 ∧ ((𝜓 ∧ 𝜏) ∧ 𝜒)) → 𝜃)

Proof of Theorem adantrlr
StepHypRef Expression
1 simpl 488 . 2 ((𝜓 ∧ 𝜏) → 𝜓)
2 adantr2.1 . 2 ((𝜑 ∧ (𝜓 ∧ 𝜒)) → 𝜃)
31, 2sylanr1 695 1 ((𝜑 ∧ ((𝜓 ∧ 𝜏) ∧ 𝜒)) → 𝜃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401
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 402
This theorem is used by:  smoord  8378  addsrmo  11163  mulsrmo  11164  lediv12a  12215  nrmmetd  24900  pntrmax  27898  ablo4  31159  mdslmd3i  32941  atom1d  32962  fsumiunle  33468  esumiun  34774  poimirlem28  38673  fdc  38786  incsequz  38789  crngm4  39044  ps-2  40642  aacllem  51121
  Copyright terms: Public domain W3C validator