{"width":"100%","description":"A. Flat CPO Definition task := forall (x y : option nat) (n : nat), x = Some n -> x = y \\/ x = None -> x = y. x = y \\/ x = None \u306b\u3064\u3044\u3066\u5834\u5408\u5206\u3051\u3059\u308b\u306e\u304c\u7c21\u5358\u3067\u3059\u3002x = y \u306e\u5834\u5408\u306f\u81ea\u660e\u3067\u3001x = None \u306e\u5834\u5408\u306f\u3082\u3046\u4e00\u3064\u306e\u4eee\u5b9a x = Some n \u3068\u5408\u308f\u305b\u308b\u3068\u77db\u76fe\u304c\u51fa\u307e\u3059\u3002 Require Import Problem. Theorem solution : task. Proof. unfold task. intros x y n H [H' | H']. \u2026","version":"1.0","title":"TopProver Sprint Round 13","type":"rich","categories":[],"url":"https://lkozima.hatenablog.com/entry/2020/09/27/220048","image_url":null,"blog_url":"https://lkozima.hatenablog.com/","provider_name":"Hatena Blog","author_name":"lkozima","published":"2020-09-27 22:00:48","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flkozima.hatenablog.com%2Fentry%2F2020%2F09%2F27%2F220048\" title=\"TopProver Sprint Round 13 - \u8ad6\u7406\u3068\u304b\u8a08\u7b97\u6a5f\u3068\u304b\u6570\u5b66\u3068\u304b\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"\u8ad6\u7406\u3068\u304b\u8a08\u7b97\u6a5f\u3068\u304b\u6570\u5b66\u3068\u304b","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/lkozima/","height":"190"}