*To*: George Karabotsos <g_karab at encs.concordia.ca>*Subject*: Re: [isabelle] Help with finite set comprehension proof*From*: Tobias Nipkow <nipkow at in.tum.de>*Date*: Sat, 12 Jul 2008 14:48:45 +0200*Cc*: isabelle <isabelle-users at cl.cam.ac.uk>*In-reply-to*: <op.ud47vjp25wmoza@localhost>*References*: <op.ud47vjp25wmoza@localhost>*User-agent*: Thunderbird 2.0.0.9 (Macintosh/20071031)

lemma enum3: "{x::int. 1 <= x & x <= 3} = {1,2,3}" by auto lemma "(\<Sum> {x. 1 <= x & x <= (3::int)}) = 6" by(simp add:enum3) Regards Tobias George Karabotsos schrieb:

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:*Perry James

**References**:**[isabelle] Help with finite set comprehension proof***From:*George Karabotsos

- Previous by Date: [isabelle] Help with finite set comprehension proof
- Next by Date: Re: [isabelle] Help with finite set comprehension proof
- Previous by Thread: [isabelle] Help with finite set comprehension proof
- 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