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

Theorem jc 119
Description: Inference joining the consequents of two premises.
Hypotheses
Ref Expression
jc.1 |- (ph -> ps)
jc.2 |- (ph -> ch)
Assertion
Ref Expression
jc |- (ph -> -. (ps -> -. ch))

Proof of Theorem jc
StepHypRef Expression
1 pm3.2im 107 . 2 |- (ps -> (ch -> -. (ps -> -. ch)))
2 jc.1 . 2 |- (ph -> ps)
3 jc.2 . 2 |- (ph -> ch)
41, 2, 3sylc 62 1 |- (ph -> -. (ps -> -. ch))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2
This theorem is referenced by:  bii 140  jca 236  msca 508
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
metamath.org