proposition: Lemma prop_shr_be: forall a, RAWBITVECTOR_LIST._shr_be (map (Lit.interp rho) a) = (map (Lit.interp rho) (_shr_lit_be a)).
proof: Proof. intro a. case_eq a; intros. - now simpl. - unfold RAWBITVECTOR_LIST._shr_be, _shr_lit_be. simpl. rewrite map_app. simpl. assert (Lit.interp rho (Lit._false) = false). { specialize (Lit.interp_false rho wf_rho). intros. rewrite <- not_true_iff_false. unfold not in *. intros. now apply H0. } now rewrite H0. Qed.
imports: Int63 PArray SMT_classes ZArith Misc State SMT_terms BVList Psatz Bool List BoolEq NZParity Nnat BinPos BinNat Pnat Init.Peano ProofIrrelevance