proposition: Lemma Lget_app : forall (A:Set) (a:A) l i, Lget i (l ++ a :: nil) = if Nat.eqb i (length l) then Some a else Lget i l.
proof: Proof. induction l;simpl Lget;simpl length. - intros [ | i];simpl;reflexivity. - intros [ | i];simpl. + reflexivity. + auto. Qed.
imports: List BinPos