proposition: Lemma shiftl_land : forall a b n, (land a b) << n == land (a << n) (b << n).
proof: Proof. intros. bitwise. now rewrite !shiftl_spec, land_spec. Qed.
imports: Bool ZAxioms ZMulOrder ZPow ZDivFloor ZSgnAbs ZParity NZLog