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

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

Proof of Theorem mp2and
StepHypRef Expression
1 mp2and.2 . 2 |- (ph -> ch)
2 mp2and.1 . . 3 |- (ph -> ps)
3 mp2and.3 . . 3 |- (ph -> ((ps /\ ch) -> th))
42, 3mpand 524 . 2 |- (ph -> (ch -> th))
51, 4mpd 46 1 |- (ph -> th)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196
This theorem is referenced by:  euuni 1954  tfindsg2 2403  zltp1let 4597  infxpidmlem12 4944  stadd 5687  stadd3 5689  atcvatlem 5770
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