proposition: Lemma sextend_interp_empty: forall i, RAWBITVECTOR_LIST.sextend (map (Lit.interp rho) []) i = map (Lit.interp rho) (sextend_lit [] i).
proof: Proof. simpl. intro i. induction i. - intros. now simpl. - intros. simpl. unfold RAWBITVECTOR_LIST.sextend in *. simpl. rewrite IHi. 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 H. } now rewrite H. Qed.
imports: Int63 PArray SMT_classes ZArith Misc State SMT_terms BVList Psatz Bool List BoolEq NZParity Nnat BinPos BinNat Pnat Init.Peano ProofIrrelevance