Coq: remove constructor from both sides of goal
Consider the following partial proof: Theorem test : forall (n m : nat), n = m -> S n = S m. Proof. intros n m H. Executing until this point gives me the following: 1 subgoal n, m : nat H : n = m ______________________________________(1/1) S n = S m I would like to remove the Ss from the goal, obtaining the goal n = m. Is there a tactic that does this?
You are looking for the f_equal tactic.
Defining a finite automata Coq
Proving even + even = even with mutual induction using tactics
Rewriting hypothesis with a more concrete expression
Coq rewriting using lambda arguments
How to rewrite a goal using function definition?
coqtop -lv (version 8.6) no longer displaying proof subgoals?
Coq beginner - Prove a basic lemma
How to do induction differently?
Is is possible to implement a Coq tactic that inspects a HintDb? If so, how?
Need help on proving proposition in Coq
Folding back after unfolding
Could coq derive this solution automatically? Can coq manipulate algebraic expressions when performing the search for a proof?
A special case of Lob's theorem using Coq
How can I implement a coq tactic that iterates over the hypotheses?
How can I automate counting within proofs in Coq?
How to get data from an inductive type Coq