1 files changed, 1 insertions, 40 deletions

diff --git a/src/Galois/BaseSystem.v b/src/Galois/BaseSystem.v
index b9821ded0..835cea5f9 100644
--- a/src/Galois/BaseSystem.v
+++ b/src/Galois/BaseSystem.v
@@ -1,52 +1,13 @@
 Require Import List.
+Require Import Util.ListUtil.
 Require Import ZArith.ZArith ZArith.Zdiv.
 Require Import Omega.
 
-Ltac nth_tac' := 
-  intros; simpl in *; unfold error,value in *; repeat progress (match goal with
-    | [  |- context[match nth_error ?xs ?i with Some _ => _ | None => _ end ] ] => case_eq (nth_error xs i); intros
-    | [ |- context[if lt_dec ?a ?b then _ else _] ] => destruct (lt_dec a b)
-    | [ H: context[if lt_dec ?a ?b then _ else _] |- _ ] => destruct (lt_dec a b)
-    | [ H: _ /\ _ |- _ ] => destruct H
-    | [ H: Some _ = Some _ |- _ ] => injection H; clear H; intros; subst
-    | [ H: None = Some _  |- _ ] => inversion H
-    | [ H: Some _ = None |- _ ] => inversion H
-    | [ |- Some _ = Some _ ] => apply f_equal
-  end); eauto; try (autorewrite with list in *); try omega; eauto.
-Lemma nth_error_map : forall A B (f:A->B) i xs y,
-  nth_error (map f xs) i = Some y ->
-  exists x, nth_error xs i = Some x /\ f x = y.
-Proof.
-  induction i; destruct xs; nth_tac'.
-Qed.
-
-Lemma nth_error_seq : forall i start len,
-  nth_error (seq start len) i =
-  if lt_dec i len
-  then Some (start + i)
-  else None.
-  induction i; destruct len; nth_tac'; erewrite IHi; nth_tac'.
-Qed.
-
-Lemma nth_error_length_error : forall A i (xs:list A), nth_error xs i = None ->
-  i >= length xs.
-Proof.
-  induction i; destruct xs; nth_tac'; try specialize (IHi _ H); omega.
-Qed.
-
-Ltac nth_tac := 
-  repeat progress (try nth_tac'; try (match goal with
-    | [ H: nth_error (map _ _) _ = Some _ |- _ ] => destruct (nth_error_map _ _ _ _ _ _ H); clear H
-    | [ H: nth_error (seq _ _) _ = Some _ |- _ ] => rewrite nth_error_seq in H
-    | [H: nth_error _ _ = None |- _ ] => specialize (nth_error_length_error _ _ _ H); intro; clear H
-  end)).
-
 Local Open Scope Z.
 
 Lemma pos_pow_nat_pos : forall x n, 
   Z.pos x ^ Z.of_nat n > 0.
   do 2 (intros; induction n; subst; simpl in *; auto with zarith).
-  SearchAbout Pos.succ.
   rewrite <- Pos.add_1_r, Zpower_pos_is_exp.
   apply Zmult_gt_0_compat; auto; reflexivity.
 Qed.