I was wondering if there is a way to introduce an entirely new variable during the proof of a theorem in Coq?
For a complete example, consider the following property from here about the evenness of the length of a list.
Inductive ev_list {X:Type}: list X -> Prop :=
| el_nil : ev_list []
| el_cc : forall x y l, ev_list l -> ev_list (x :: y :: l).
Now I want to prove that for any list l
if its length
is even, then ev_list l
holds:
Lemma ev_length__ev_list': forall X (l : list X), ev (length l) -> ev_list l.
Proof.
intros X l H.
which gives:
1 subgoals
X : Type
l : list X
H : ev (length l)
______________________________________(1/1)
ev_list l
Now, I'd like to "define" a new free variable n
and a hypothesis n = length l
. In hand-written math, I think we can do this, and then do induction about n
. But is there a way to do the same in Coq?
Note. the reasons I ask are that:
I don't want to introduce this
n
artificially into the statement of the theorem itself, as is done in the page linked earlier, which IMHO is unnatural.I tried to
induction H.
, but it seems not working. Coq wasn't able to do case analysis onlength l
'sev
-ness, and no induction hypothesis (IH) was generated.
Thanks.