HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem mpand 524
Description: A deduction based on modus ponens.
Hypotheses
Ref Expression
mpand.1 |- (ph -> ps)
mpand.2 |- (ph -> ((ps /\ ch) -> th))
Assertion
Ref Expression
mpand |- (ph -> (ch -> th))

Proof of Theorem mpand
StepHypRef Expression
1 mpand.1 . 2 |- (ph -> ps)
2 mpand.2 . . 3 |- (ph -> ((ps /\ ch) -> th))
32exp3a 292 . 2 |- (ph -> (ps -> (ch -> th)))
41, 3mpd 46 1 |- (ph -> (ch -> th))
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196
This theorem is referenced by:  mp2and 526  orduniorsuc 2337  nnge1t 4439  occllem6 5185  osumlem4 5533  sumdmd 5787
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-an 198
metamath.org