Relations between well-known bounds for the minimum distance of binary cyclic codes such as BCH bound (dBCH), HT bound (dHT) and new bounds dA, dB proposed recently by Shen et al. are investigated. We prove firstly dBCH dA and secondly dHT dB. We also give binary cyclic codes which satisfy dA dHT.