I am new to Coq. I have a record type and one definition:
Record t : Type := T {
width : nat;
}.
Definition indent shift f :=
match f with
| T w => T
(w + shift)
end.
I want to proof a trivial lemma:
Lemma lemma :
forall (a:t) n, width a <= width (indent n a).
after unfolding indent
subgoal becomes:
(width a <= width match a with
| {| width := w |} => {| width := w + n |}
end)
How to simplify term?