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

Theorem mpd3an23 915
Description: An inference based on modus ponens.
Hypotheses
Ref Expression
mpd3an23.1 |- (ph -> ps)
mpd3an23.2 |- (ph -> ch)
mpd3an23.3 |- ((ph /\ ps /\ ch) -> th)
Assertion
Ref Expression
mpd3an23 |- (ph -> th)

Proof of Theorem mpd3an23
StepHypRef Expression
1 mpd3an23.3 . 2 |- ((ph /\ ps /\ ch) -> th)
2 id 59 . 2 |- (ph -> ph)
3 mpd3an23.1 . 2 |- (ph -> ps)
4 mpd3an23.2 . 2 |- (ph -> ch)
51, 2, 3, 4syl3anc 856 1 |- (ph -> th)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ w3a 773
This theorem is referenced by:  euuni 2871  qbtwnxr 6217  grpinvid 8009  shftefif1olem 8661  shftefif1olemOLD 8662  chsot 9506
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 147  df-an 225  df-3an 775
Copyright terms: Public domain