Theorem biimprcd 160

Description: Deduce a converse commuted implication from a logical equivalence. (Contributed by NM, 3-May-1994.) (Proof shortened by Wolf Lammen, 20-Dec-2013.)

Hypothesis

Ref	Expression
biimpcd.1	|- ( ph -> ( ps <-> ch ) )

Assertion

Ref	Expression
biimprcd	|- ( ch -> ( ph -> ps ) )

Proof of Theorem biimprcd

Step	Hyp	Ref	Expression
1		id 19	. 2 |- ( ch -> ch )
2		biimpcd.1	. 2 |- ( ph -> ( ps <-> ch ) )
3	1, 2	syl5ibrcom 157	1 |- ( ch -> ( ph -> ps ) )

Syntax hints:   -> wi 4   <-> wb 105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  biimparc  299  pm5.32  453  oplem1  981  ax11i  1760  equsex  1774  eleq1a  2301  ceqsalg  2828  cgsexg  2835  cgsex2g  2836  cgsex4g  2837  ceqsex  2838  spc2egv  2893  spc3egv  2895  csbiebt  3164  dfiin2g  3998  sotricim  4414  ralxfrALT  4558  iunpw  4571  opelxp  4749  ssrel  4807  ssrel2  4809  ssrelrel  4819  iss  5051  funcnvuni  5390  fun11iun  5595  tfrlem8  6470  eroveu  6781  fundmen  6967  nneneq  7026  fidifsnen  7040  prarloclem5  7695  prarloc  7698  recexprlemss1l  7830  recexprlemss1u  7831  uzin  9763  indstr  9796  elfzmlbp  10336  swrdnd  11199