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

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

Proof of Theorem mpan2d
StepHypRef Expression
1 mpan2d.1 . 2 |- (ph -> ch)
2 mpan2d.2 . . 3 |- (ph -> ((ps /\ ch) -> th))
32exp3a 292 . 2 |- (ph -> (ps -> (ch -> th)))
41, 3mpid 48 1 |- (ph -> (ps -> th))
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196
This theorem is referenced by:  alephle 3689  peano2uz 4602  flgzt 4626  shsel1t 5286
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