Simplifying the proof of NoRetractToModalProposition.paradox in Hurkens.v by dropping the artificial need for monad laws. Tactic eauto decided to be dependent on the laws but there is a shorter proof without them.
Simplifying the proof of NoRetractToModalProposition.paradox in
Hurkens.v by dropping the artificial need for monad laws. Tactic eauto
decided to be dependent on the laws but there is a shorter proof
without them.

[Interestingly, eauto is not able to find the short proof. This is a
situation of the form

subgoal 1:  H : ?A |- P x
subgoal 2:  H : M ?A |- M (forall x, P x)

where addressing the second subgoal would find the right instance of
?A, but this instance is too hard to find by addressing first the
first subgoal.]

gares/coq,JasonGross/coq,Matafou/coq,ppedrot/coq,ppedrot/coq,ejgallego/coq,letouzey/coq-wip,Zimmi48/coq,Matafou/coq,JasonGross/coq,gares/coq,Zimmi48/coq,silene/coq,letouzey/coq-wip,maximedenes/coq,maximedenes/coq,ppedrot/coq,william-lawvere/coq,gares/coq,Ptival/coq,gares/coq,gares/coq,Lionel-Rieg/coq,ejgallego/coq,maximedenes/coq,Matafou/coq,amintimany/coq,letouzey/coq-wip,maximedenes/coq,Ptival/coq,JasonGross/coq,silene/coq,william-lawvere/coq,coq/coq,coq/coq,william-lawvere/coq,coq/coq,Ptival/coq,SkySkimmer/coq,JasonGross/coq,ejgallego/coq,SkySkimmer/coq,ppedrot/coq,Zimmi48/coq,SkySkimmer/coq,ejgallego/coq,maximedenes/coq,SkySkimmer/coq,Lionel-Rieg/coq,letouzey/coq-wip,ppedrot/coq,silene/coq,amintimany/coq,amintimany/coq,Zimmi48/coq,coq/coq,letouzey/coq-wip,Lionel-Rieg/coq