proposition: Lemma implies_lsr : tests -> lsr_test.
proof: Proof. move=> H. apply/forallInt8P=> y. apply idP. apply/forallInt8P=> x. apply idP. apply/implyP=> H'. by move: (implies_shift H x y H')=> /andP [-> _]. Qed.
imports: Coq(ZArith.ZArith Extraction) mathcomp.ssreflect.ssreflect mathcomp(ssrbool eqtype ssrnat seq fintype ssrfun tuple) Bits(bits) ExtrOcamlBasic