Table of ContentsTable of Contents Mathbox for Jonathan Ben-Naim < Previous   Next >
Related theorems
Unicode version

Theorem bnj1119 12929
Description: First-order logic and set theory.
Assertion
Ref Expression
bnj1119 |- (((ph -> ps) /\ (-. ph -> ps)) -> ps)

Proof of Theorem bnj1119
StepHypRef Expression
1 pm4.77 468 . 2 |- (((ph -> ps) /\ (-. ph -> ps)) <-> ((ph \/ -. ph) -> ps))
2 exmid 717 . . 3 |- (ph \/ -. ph)
3 pm3.35 386 . . 3 |- (((ph \/ -. ph) /\ ((ph \/ -. ph) -> ps)) -> ps)
42, 3mpan 759 . 2 |- (((ph \/ -. ph) -> ps) -> ps)
51, 4sylbi 216 1 |- (((ph -> ps) /\ (-. ph -> ps)) -> ps)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 239   /\ wa 240
This theorem is referenced by:  bnj1120 12930
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 164  df-or 241  df-an 242
Copyright terms: Public domain