Massimo Zaniboni
unread,Jul 14, 2017, 8:09:03 AM7/14/17You do not have permission to delete messages in this group
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to
Hi,
I'm new of Isabelle, and I like it very much. I tried successfully some proofs, but now I'm stuck with this apparently simple proof:
lemma THE_exist:
fixes P :: "'a ⇒ bool"
assumes a1: "∃ a . a = (THE b . P b)"
shows "∃ a . P a"
sorry
My most promising partial attempt is this:
lemma THE_exist:
fixes P :: "'a ⇒ bool"
assumes a1: "∃ a . a = (THE b . P b)"
shows "∃ a . P a"
proof -
from a1 have "∃ a . a = (SOME b . P b)" by auto
from this obtain a where a: "a = (SOME b . P b)" by auto
(* TODO trying to use this lemma of the library:
lemma some_eq_ex: "P (SOME x. P x) ⟷ (∃x. P x)"
by (blast intro: someI)
*)
qed
Any hint will be very appreciated!
Massimo