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

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

Proof of Theorem baib
StepHypRef Expression
1 ibar 487 . 2 |- (ps -> (ch <-> (ps /\ ch)))
2 baib.1 . 2 |- (ph <-> (ps /\ ch))
31, 2syl6rbbr 417 1 |- (ps -> (ph <-> ch))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196
This theorem is referenced by:  baibr 507  nlimon 2369  ltresr 4052  leltt 4278  nn0subt 4587  znnsubt 4595  seqcauchy 5106  sh2 5126  dmdbr2 5733
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