*To*: isabelle <isabelle-users at cl.cam.ac.uk>*Subject*: [isabelle] Help with finite set comprehension proof*From*: "George Karabotsos" <g_karab at encs.concordia.ca>*Date*: Fri, 11 Jul 2008 15:46:21 -0400*Organization*: Concordia University*User-agent*: Opera Mail/9.51 (Linux)

Hello all, I am having difficutly proving the following lemma lemma "\<lbrakk> A = {x. 1 \<le> x \<and> x \<le> (3::int)}\<rbrakk> \<Longrightarrow> (\<Sum> A) = 6" These are the steps I have followed by studying the HOL/Finite_Set.thy theory but I got stuck at the last one which I have commented out. apply(auto) apply(unfold setsum_def) apply(auto) apply(unfold fold_def) apply(rule the_equality) apply(induct set: finite) thm foldSet.emptyI (* apply(rule foldSet.emptyI) *) oops Any help will be much appreciated! TIA, George

**Follow-Ups**:**Re: [isabelle] Help with finite set comprehension proof***From:*Tobias Nipkow

- Previous by Date: Re: [isabelle] &&, force, inputting facts, patterns, naming of lemmas?
- Next by Date: Re: [isabelle] Help with finite set comprehension proof
- Previous by Thread: [isabelle] TPHOLs'2008-Second Call For Participation-
- Next by Thread: Re: [isabelle] Help with finite set comprehension proof
- Cl-isabelle-users July 2008 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list