Polymorphic minimal propositional logic

Redo that exercise , but prove universally quantified closed statements instead of using some predeclared propositional variables.
For instance, instead of declaring P:Prop and proving the proposition P->P, prove the proposition forall P:Prop, P->P.

Solution

Look at this file

Additional question

Answer again, without using Auto.
Going home
Pierre Castéran