Interactive Theorem Proving in Logic Education：A Coq Formalization of ZFC Set T...
summary
A Coq deep embedding of ZFC and a textbook-style deduction system plus a small automation layer produce a mini ZFC prover that hides Coq internals and exposes a few textbook-flavored tactics. The implementation is ~2,600 LOC with the propositional solver and automation in ~400 LOC and a 300-line tutorial. Undergraduate novices (8 of 15 volunteers) formalize mathematical induction and Peano arithmetic in an afternoon producing ~65-line proofs (instructors 67 lines), using tactics like TAuto and conclusion_already_proved to finish proofs.
AI-written summary · about