NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  sylcom GIF version

Theorem sylcom 25
Description: Syllogism inference with commutation of antecedents. (Contributed by NM, 29-Aug-2004.) (Proof shortened by O'Cat, 2-Feb-2006.) (Proof shortened by Stefan Allan, 23-Feb-2006.)
Hypotheses
Ref Expression
sylcom.1 ⊢ (φ → (ψ → χ))
sylcom.2 ⊢ (ψ → (χ → θ))
Assertion
Ref Expression
sylcom ⊢ (φ → (ψ → θ))

Proof of Theorem sylcom
StepHypRef Expression
1 sylcom.1 . 2 ⊢ (φ → (ψ → χ))
2 sylcom.2 . . 3 ⊢ (ψ → (χ → θ))
32a2i 12 . 2 ⊢ ((ψ → χ) → (ψ → θ))
41, 3syl 15 1 ⊢ (φ → (ψ → θ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7
This theorem is used by:  syl5com  26  syl6  29  syli  33  mpbidi  207
  Copyright terms: Public domain W3C validator