*To*: isabelle-users at cl.cam.ac.uk*Subject*: Re: [isabelle] Showing that type 'int' is infinite*From*: John Matthews <matthews at galois.com>*Date*: Thu, 1 Feb 2007 14:15:49 -0800*In-reply-to*: <5829379E-F319-484F-B356-5F62819E14F0@galois.com>*References*: <5829379E-F319-484F-B356-5F62819E14F0@galois.com>

lemma infinite_UNIV: "inj (f::nat => 'a) ==> infinite (UNIV::'a set)" using range_inj_infinite finite_subset subset_UNIV by blast lemmas int_infinite[simp] = infinite_UNIV[OF inj_int] -john On Jan 31, 2007, at 5:38 PM, John Matthews wrote:

I have a subgoal of the form 1. "~ (finite (UNIV :: int set))"However, I can't find a corresponding theorem using find_theoremsin Isabelle/HOL. Nor was find_theorems produce successful on theterms "card (UNIV :: int set)" or "setsum ?f (UNIV :: int set)".What is the best way to prove this subgoal? Thanks, -john

**References**:**[isabelle] Showing that type 'int' is infinite***From:*John Matthews

- Previous by Date: Re: [isabelle] Pure and CPure non-compatible
- Next by Date: Re: [isabelle] parser translation for sets
- Previous by Thread: Re: [isabelle] Showing that type 'int' is infinite
- Next by Thread: [isabelle] parser translation for sets
- Cl-isabelle-users February 2007 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