One thing I think is important about Coq is that it really is meant to be interactive. Even after a fair amount of usage I still find it somewhat tricky to just read a proof, especially a nontrivial one. A good IDE will show you a panel that includes all your hypothesis and requirements so far, updating as you run each line
nail ~= intros
wat ~= discriminate
etc.It boggles the mind why the author would make up fanciful new names for the fundamental tactics in this "how to" article.
If you are giving a talk on a theorem proving programing language you're gonna want to make it fun
But the most important thing to understand about Coq is that it's meant to be read in an IDE. The IDE will show you, at each step, what has been proved and what remains to be proved. The "tactics" you see above basically mean, "At this point in the proof, we can make progress by substituting Hv. And in context, this will make sense.
But without being able to see the proof state at each step, Coq can be incredibly cryptic.
Theorem NestedTreeContains1:
Proof.nail.
wreck t.
- wat.
- wreck H into Ht1, Hv and Ht2.
Qed.Theorem, forall, qed look fairly likely. Are there built-in operations in coq called 'wat' and 'wreck'?