Table of ContentsTable of Contents Mathbox for Jonathan Ben-Naim < Previous   Next >
Related theorems
Unicode version

Theorem bnj768 12705
Description: /\-manipulation.
Hypothesis
Ref Expression
bnj768.1 |- ((th /\ ch /\ ps /\ ph) -> ta)
Assertion
Ref Expression
bnj768 |- ((ph /\ ps /\ ch /\ th) -> ta)

Proof of Theorem bnj768
StepHypRef Expression
1 bnj704 12639 . 2 |- ((ph /\ ps /\ ch /\ th) -> (th /\ ch /\ ps /\ ph))
2 bnj768.1 . 2 |- ((th /\ ch /\ ps /\ ph) -> ta)
31, 2syl 12 1 |- ((ph /\ ps /\ ch /\ th) -> ta)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ syn-bnj17 12019
This theorem is referenced by:  bnj831 12785
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 164  df-an 242  df-3an 860  df-bnj17 12020
Copyright terms: Public domain