Theorem biimpcd 159

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

Hypothesis

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

Assertion

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

Proof of Theorem biimpcd

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

This proof depends on syntax axioms:   -> wi 4   <-> wb 105

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106

This proof depends on definitions:  df-bi 117

This theorem is used by:  biimpac  298  3impexpbicom  1488  ax16  1866  ax16i  1911  nelneq  2339  nelneq2  2340  nelne1  2510  nelne2  2511  spc2gv  2916  spc3gv  2918  nssne1  3306  nssne2  3307  ifbothdc  3675  ifpprsnssdc  3820  difsn  3852  iununir  4096  nbrne1  4149  nbrne2  4150  ss1o0el1  4334  mosubopt  4840  issref  5170  ssimaex  5764  chfnrn  5820  ffnfv  5866  f1elima  5979  dftpos4  6534  tfr1onlemsucaccv  6612  tfrcllemsucaccv  6625  snon0  7249  en2prde  7539  exmidonfinlem  7545  enq0sym  7799  prop  7842  prubl  7853  negf1o  8709  0fz1  10449  elfzmlbp  10539  swrdnd  11431  maxleast  11979  negfi  11994  isprm2  12895  nprmdvds1  12918  oddprmdvds  13133  assamulgscmlem2  15042  ushgredgedg  16467  ushgredgedgloop  16469  loopclwwlkn1b  16660  clwwlkext2edg  16663  eupth2lem3lem4fi  16714  exmidsbthrlem  17067