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

Theorem pm5.15 665
Description: Theorem *5.15 of [WhiteheadRussell] p. 124.
Assertion
Ref Expression
pm5.15 |- ((ph <-> ps) \/ (ph <-> -. ps))

Proof of Theorem pm5.15
StepHypRef Expression
1 pm5.18 659 . . . 4 |- ((ph <-> ps) <-> -. (ph <-> -. ps))
21biimpr 152 . . 3 |- (-. (ph <-> -. ps) -> (ph <-> ps))
32con1i 96 . 2 |- (-. (ph <-> ps) -> (ph <-> -. ps))
43orri 231 1 |- ((ph <-> ps) \/ (ph <-> -. ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 146   \/ wo 222
This theorem is referenced by:  sbc2or 1955
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 147  df-or 224  df-an 225
Copyright terms: Public domain