# HG changeset patch
# User nipkow
# Date 1100328454 -3600
# Node ID bd4611956c7ba7519dcef710c4110ebbdaa1418e
# Parent  e0e9bf44afad0440ac59e81f5c4a8b336b27a603
More lemmas

diff -r e0e9bf44afad -r bd4611956c7b src/HOL/Finite_Set.thy
--- a/src/HOL/Finite_Set.thy	Fri Nov 12 20:55:04 2004 +0100
+++ b/src/HOL/Finite_Set.thy	Sat Nov 13 07:47:34 2004 +0100
@@ -123,6 +123,10 @@
   apply (simp only: finite_Un, blast)
   done
 
+lemma finite_Union[simp, intro]:
+ "\<lbrakk> finite A; !!M. M \<in> A \<Longrightarrow> finite M \<rbrakk> \<Longrightarrow> finite(\<Union>A)"
+by (induct rule:finite_induct) simp_all
+
 lemma finite_empty_induct:
   "finite A ==>
   P A ==> (!!a A. finite A ==> a:A ==> P A ==> P (A - {a})) ==> P {}"
diff -r e0e9bf44afad -r bd4611956c7b src/HOL/List.thy
--- a/src/HOL/List.thy	Fri Nov 12 20:55:04 2004 +0100
+++ b/src/HOL/List.thy	Sat Nov 13 07:47:34 2004 +0100
@@ -372,6 +372,10 @@
  (ys = [] & x#xs = zs | (EX ys'. x#ys' = ys & xs = ys'@zs))"
 by(cases ys) auto
 
+lemma append_eq_Cons_conv: "(ys@zs = x#xs) =
+ (ys = [] & zs = x#xs | (EX ys'. ys = x#ys' & ys'@zs = xs))"
+by(cases ys) auto
+
 
 text {* Trivial rules for solving @{text "@"}-equations automatically. *}
 
@@ -786,6 +790,41 @@
   done
 qed
 
+lemma length_filter_conv_card:
+ "length(filter p xs) = card{i. i < length xs & p(xs!i)}"
+proof (induct xs)
+  case Nil thus ?case by simp
+next
+  case (Cons x xs)
+  let ?S = "{i. i < length xs & p(xs!i)}"
+  have fin: "finite ?S" by(fast intro: bounded_nat_set_is_finite)
+  show ?case (is "?l = card ?S'")
+  proof (cases)
+    assume "p x"
+    hence eq: "?S' = insert 0 (Suc ` ?S)"
+      by(auto simp add: nth_Cons image_def split:nat.split elim:lessE)
+    have "length (filter p (x # xs)) = Suc(card ?S)"
+      using Cons by simp
+    also have "\<dots> = Suc(card(Suc ` ?S))" using fin
+      by (simp add: card_image inj_Suc)
+    also have "\<dots> = card ?S'" using eq fin
+      by (simp add:card_insert_if) (simp add:image_def)
+    finally show ?thesis .
+  next
+    assume "\<not> p x"
+    hence eq: "?S' = Suc ` ?S"
+      by(auto simp add: nth_Cons image_def split:nat.split elim:lessE)
+    have "length (filter p (x # xs)) = card ?S"
+      using Cons by simp
+    also have "\<dots> = card(Suc ` ?S)" using fin
+      by (simp add: card_image inj_Suc)
+    also have "\<dots> = card ?S'" using eq fin
+      by (simp add:card_insert_if)
+    finally show ?thesis .
+  qed
+qed
+
+
 subsection {* @{text concat} *}
 
 lemma concat_append [simp]: "concat (xs @ ys) = concat xs @ concat ys"
@@ -1181,6 +1220,10 @@
 
 declare zip_Cons [simp del]
 
+lemma zip_Cons1:
+ "zip (x#xs) ys = (case ys of [] \<Rightarrow> [] | y#ys \<Rightarrow> (x,y)#zip xs ys)"
+by(auto split:list.split)
+
 lemma length_zip [simp]:
 "!!xs. length (zip xs ys) = min (length xs) (length ys)"
 apply (induct ys, simp)
@@ -1415,6 +1458,17 @@
 lemma upt_conv_Nil [simp]: "j <= i ==> [i..j(] = []"
 by (subst upt_rec) simp
 
+lemma upt_eq_Nil_conv[simp]: "([i..j(] = []) = (j = 0 \<or> j <= i)"
+by(induct j)simp_all
+
+lemma upt_eq_Cons_conv:
+ "!!x xs. ([i..j(] = x#xs) = (i < j & i = x & [i+1..j(] = xs)"
+apply(induct j)
+ apply simp
+apply(clarsimp simp add: append_eq_Cons_conv)
+apply arith
+done
+
 lemma upt_Suc_append: "i <= j ==> [i..(Suc j)(] = [i..j(]@[j]"
 -- {* Only needed if @{text upt_Suc} is deleted from the simpset. *}
 by simp
@@ -1723,6 +1777,20 @@
 lemma sublist_nil [simp]: "sublist [] A = []"
 by (auto simp add: sublist_def)
 
+lemma length_sublist:
+  "length(sublist xs I) = card{i. i < length xs \<and> i : I}"
+by(simp add: sublist_def length_filter_conv_card cong:conj_cong)
+
+lemma sublist_shift_lemma_Suc:
+  "!!is. map fst (filter (%p. P(Suc(snd p))) (zip xs is)) =
+         map fst (filter (%p. P(snd p)) (zip xs (map Suc is)))"
+apply(induct xs)
+ apply simp
+apply (case_tac "is")
+ apply simp
+apply simp
+done
+
 lemma sublist_shift_lemma:
      "map fst [p:zip xs [i..i + length xs(] . snd p : A] =
       map fst [p:zip xs [0..length xs(] . snd p + i : A]"
@@ -1743,9 +1811,36 @@
 apply (simp del: append_Cons add: append_Cons[symmetric] sublist_append)
 done
 
+lemma set_sublist: "!!I. set(sublist xs I) = {xs!i|i. i<size xs \<and> i \<in> I}"
+apply(induct xs)
+ apply simp
+apply(auto simp add:sublist_Cons nth_Cons split:nat.split elim: lessE)
+ apply(erule lessE)
+  apply auto
+apply(erule lessE)
+apply auto
+done
+
+lemma set_sublist_subset: "set(sublist xs I) \<subseteq> set xs"
+by(auto simp add:set_sublist)
+
+lemma notin_set_sublistI[simp]: "x \<notin> set xs \<Longrightarrow> x \<notin> set(sublist xs I)"
+by(auto simp add:set_sublist)
+
+lemma in_set_sublistD: "x \<in> set(sublist xs I) \<Longrightarrow> x \<in> set xs"
+by(auto simp add:set_sublist)
+
 lemma sublist_singleton [simp]: "sublist [x] A = (if 0 : A then [x] else [])"
 by (simp add: sublist_Cons)
 
+
+lemma distinct_sublistI[simp]: "!!I. distinct xs \<Longrightarrow> distinct(sublist xs I)"
+apply(induct xs)
+ apply simp
+apply(auto simp add:sublist_Cons)
+done
+
+
 lemma sublist_upt_eq_take [simp]: "sublist l {..<n} = take n l"
 apply (induct l rule: rev_induct, simp)
 apply (simp split: nat_diff_split add: sublist_append)
diff -r e0e9bf44afad -r bd4611956c7b src/HOL/Nat.thy
--- a/src/HOL/Nat.thy	Fri Nov 12 20:55:04 2004 +0100
+++ b/src/HOL/Nat.thy	Sat Nov 13 07:47:34 2004 +0100
@@ -109,7 +109,7 @@
 
 text {* Injectiveness of @{term Suc} *}
 
-lemma inj_Suc: "inj Suc"
+lemma inj_Suc: "inj_on Suc N"
   apply (unfold Suc_def)
   apply (rule inj_onI)
   apply (drule inj_on_Abs_Nat [THEN inj_onD])