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

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

Proof of Theorem anbi1
StepHypRef Expression
1 id 59 . 2 |- ((ph <-> ps) -> (ph <-> ps))
21anbi1d 615 1 |- ((ph <-> ps) -> ((ph /\ ch) <-> (ps /\ ch)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223
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-an 225
Copyright terms: Public domain