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

Theorem pm2.61d1 128
Description: Inference eliminating an antecedent.
Hypotheses
Ref Expression
pm2.61d1.1 |- (ph -> (ps -> ch))
pm2.61d1.2 |- (-. ps -> ch)
Assertion
Ref Expression
pm2.61d1 |- (ph -> ch)

Proof of Theorem pm2.61d1
StepHypRef Expression
1 pm2.61d1.1 . 2 |- (ph -> (ps -> ch))
2 pm2.61d1.2 . . 3 |- (-. ps -> ch)
32a1i 8 . 2 |- (ph -> (-. ps -> ch))
41, 3pm2.61d 127 1 |- (ph -> ch)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3
This theorem is referenced by:  pm2.61nii 131  ja 137  mosubopt 2793  nlimsucg 3102  funfv 3755  eceqopreq 4297  alephon 4837  uzwo4OLD 6158  ndmioo 6307
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
Copyright terms: Public domain