Is there a minimal complete set of tactics in Coq?
I have seen a lot of Coq tactics that are overlapping each other in function. For example, when you have the exact conclusion in the hypothesis, you can use assumption , apply , exact , trivial , and maybe others. Other examples include destruct and induction for non-inductive types(??). My question is: Is there a minimal set of basic tactics (that excludes auto , and its like) that is complete, in the sense that this set can be used to prove any Coq-provable theorems about functions of natural numbers? The tactics in this minimal complete set would be ideally basic, so that each perform one