Proof by intimidation

There is little to say about this module: FMPC is just a macro for Axiom, which in turn is a macro for Parameter. We used this syntax to express holes in a proof. The current .v source do not contain any occurrence of FMPC, since all holes have been removed.

Well known facts

We also added a version of Axiom and named it "Well_Known".

Examples

FMPC square_mono:(n,p:nat)(le n p)->
                     (le (square n) (square p)).

Well_Known square_mono_strict:
       (n,p:nat)(le n p)->(le (square n) (square p)).
Click here to see the source.