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

Theorem baibr 507
Description: Move conjunction outside of biconditional.
Hypothesis
Ref Expression
baibr.1 |- (ph <-> (ps /\ ch))
Assertion
Ref Expression
baibr |- (ps -> (ch <-> ph))

Proof of Theorem baibr
StepHypRef Expression
1 baibr.1 . . 3 |- (ph <-> (ps /\ ch))
21baib 506 . 2 |- (ps -> (ph <-> ch))
32bicomd 399 1 |- (ps -> (ch <-> ph))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196
This theorem is referenced by:  exmoeu2 1040  ssnelpss 1751  canth 2945  kmlem14 3593  iscard 3659  cvexchlem 5759
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-an 198
metamath.org