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

Theorem orbi1 682
Description: Theorem *4.37 of [WhiteheadRussell] p. 118.
Assertion
Ref Expression
orbi1 |- ((ph <-> ps) -> ((ph \/ ch) <-> (ps \/ ch)))

Proof of Theorem orbi1
StepHypRef Expression
1 id 73 . 2 |- ((ph <-> ps) -> (ph <-> ps))
21orbi1d 677 1 |- ((ph <-> ps) -> ((ph \/ ch) <-> (ps \/ ch)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   \/ wo 239
This theorem is referenced by:  orbi1r 1282  orbi1rVD 16672  sbc3orgVD 16675
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