### coq

#### 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.

### Related Links

Let expression written as inductive relation

where is Coq aac_tactics installed?

example for introduction pattern (p1 & … & pn) does not work

What's the difference between logical (Leibniz) equality and local definition in Coq?

How to show that if squares are equal, then the operands are equal as well?

rewrite works for integer but not for rationals for Coq aac_tactics

How to use Coq aac tactics to prove equalities in the goal?

How do I prove 'S x > 0' from scratch in Coq?

Best way to handle (sub) types of the form `{ x : nat | x >= 13 /\ x <= 19 }`?

Proof of idempotence for a function clearing a list but one element

How to apply Fixpoint definitions within proofs in Coq?

Is one being penalized by using 'same_relation' (and possibly other library definitions)?

Refine and # (at) symbol in Coq 8.5pl1

Tactic to partially compute goal in Coq

Merge duplicate cases in match Coq

Coq: Unknown interpretation for negative integer expressions