How to prove theorems about mutual inductive types by using tactics in Coq?
Consider following mutual inductive proposition
Ltac matches applications of constructors of a type
I want to write a tactic that applies a tactic to every hypothesis that is at least a one-level deep application of constructors. For example, apply the tactic to 0 = m and S n = m, but not n = m.
Is there way to match this in Ltac without enumerating all the possible constructors?
Applying lemma using Vectors in Coq
I have proved the following