*To*: cl-isabelle-users at lists.cam.ac.uk*Subject*: Re: [isabelle] apply proof method to all subgoals*From*: Lars Noschinski <noschinl at in.tum.de>*Date*: Mon, 11 Apr 2011 09:03:27 +0200*In-reply-to*: <4DA19929.4080101@cam.ac.uk>*References*: <4DA19929.4080101@cam.ac.uk>*User-agent*: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.1.16) Gecko/20110303 Icedove/3.0.11

On 10.04.2011 13:48, Alex Katovsky wrote:

This is probably a very basic question, so I apologize if I'm not reading the tutorial carefully enough. I have this lemma lemma "(∀ x . A ⟶ B) ∧ (∀ y . C ⟶ D) ∧ (∀ x . E ⟶ F)" and from this I want to generate the three subgoals 1. ⋀x. A ⟹ B 2. ⋀y. C ⟹ D 3. ⋀x. E ⟹ F

lemma "(∀ x . A ⟶ B) ∧ (∀ y . C ⟶ D) ∧ (∀ x . E ⟶ F)" proof - { have "ALL x. A -> B" <some proof> } moreover { have "ALL y. C -> D" <some proof> } moreover { have "ALL x. E -> F" <some proof> } ultimately show ?thesis by auto qed Regards, Lars

**References**:**[isabelle] apply proof method to all subgoals***From:*Alex Katovsky

- Previous by Date: Re: [isabelle] Isabelle 2011 locales
- Next by Date: [isabelle] Emacs 23/PG 4 problems on Mac
- Previous by Thread: Re: [isabelle] apply proof method to all subgoals
- Next by Thread: [isabelle] Workshop on Automated Theory Engineering (2nd CfP)
- Cl-isabelle-users April 2011 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