Re: [isabelle] Adding lemmas to HOL?

They look indeed interesting, I'll probably add them in some form or another.


On 27/05/2016 12:05, Christoph Dittmann wrote:

I am looking for lemmas that show that from every pair of lists you can
split off a maximal common prefix or suffix. I am looking for this:

lemma maximal_common_prefix:
  shows "âps xs' ys'. xs = ps @ xs' â ys = ps @ ys'
         â (xs' = [] â ys' = [] â hd xs' â hd ys')"
  by (induct xs ys rule: list_induct2', blast, blast, blast)
     (metis (no_types, hide_lams) append_Cons append_Nil list.sel(1))

corollary maximal_common_suffix:
  shows "âss xs' ys'. xs = xs' @ ss â ys = ys' @ ss
         â (xs' = Nil â ys' = Nil â last xs' â last ys')"
  using maximal_common_prefix[of "rev xs" "rev ys"]
  unfolding rev_swap rev_append by (metis last_rev rev_is_Nil_conv)

The proofs work, but I would have expected that these statements already
exist somewhere in src/HOL/List.thy.  Unfortunately, I couldn't find
these or something similar.  I would be glad if someone corrected me.

These two lemmas look to me like they could be useful for many proofs
because they give a general way to decompose two lists.

So my question is, what is the process to propose new lemmas for HOL?
Do these two lemmas look reasonable enough (assuming they don't already


Attachment: smime.p7s
Description: S/MIME Cryptographic Signature

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.