*To*: Sven Schneider <svens at cs.tu-berlin.de>*Subject*: Re: [isabelle] Finite Datatype*From*: Tobias Nipkow <nipkow at in.tum.de>*Date*: Fri, 06 Jun 2008 17:08:33 +0200*Cc*: cl-isabelle-users at lists.cam.ac.uk*In-reply-to*: <4847EFA0.10209@cs.tu-berlin.de>*References*: <4847EFA0.10209@cs.tu-berlin.de>*User-agent*: Thunderbird 1.5.0.7 (X11/20060909)

is there a simple way to proof the following statement?I have a proof but it contains a case-disinction over all elements inthe datatype. This is inacceptable for the actual dataype which containsseveral thousands of elements; the proof would require to much time.theory Test imports Main begin datatype A = A0 | A1 datatype Label = B0 A A instance Label :: "finite"

Tobias

**Follow-Ups**:**Re: [isabelle] Finite Datatype***From:*Tjark Weber

**References**:**[isabelle] Finite Datatype***From:*Sven Schneider

- Previous by Date: Re: [isabelle] Isabelle problem
- Next by Date: Re: [isabelle] Isabelle problem
- Previous by Thread: [isabelle] Finite Datatype
- Next by Thread: Re: [isabelle] Finite Datatype
- Cl-isabelle-users June 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