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

Theorem sylanr1 695
Description: A syllogism inference. (Contributed by NM, 9-Apr-2005.)
Hypotheses
Ref Expression
sylanr1.1 (𝜑 → 𝜒)
sylanr1.2 ((𝜓 ∧ (𝜒 ∧ 𝜃)) → 𝜏)
Assertion
Ref Expression
sylanr1 ((𝜓 ∧ (𝜑 ∧ 𝜃)) → 𝜏)

Proof of Theorem sylanr1
StepHypRef Expression
1 sylanr1.1 . . 3 (𝜑 → 𝜒)
21anim1i 627 . 2 ((𝜑 ∧ 𝜃) → (𝜒 ∧ 𝜃))
3 sylanr1.2 . 2 ((𝜓 ∧ (𝜒 ∧ 𝜃)) → 𝜏)
42, 3sylan2 605 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:  adantrll  735  adantrlr  736  sbthlem9  9152  unfi  9224  pczpre  17069  cpmadugsumlemF  23249  blsscls2  24878  rpvmasumlem  27871  leopmuli  32792  chirredlem1  33049  chirredlem3  33051  pibt2  38608  mhpind  43888  dvconstbi  45579  bccbc  45590  reccot  51279  rectan  51280  aacllem  51367
  Copyright terms: Public domain W3C validator