简体   繁体   English

如何在 Coq 中证明 (0 = 2) -> false?

[英]How to prove that (0 = 2) -> false in Coq?

In a proof of one lemma I eventually reached a state, where在一个引理的证明中,我最终达到了 state,其中

I have a premise我有一个前提

H: 0 = 2

and I have to prove我必须证明

false . false的。

Question : how to infer that the premise H is false to conclude the proof?问题:如何推断前提H为假以得出证明?

The discriminate tactic can deal with situations like that. discriminate策略可以处理这样的情况。 I believe that easy also works, as does congruence , which are a bit more general than discriminate .我相信easy也有效, congruence也有效,它们比discriminate更普遍。

If you want to understand how it works "behind the scenes", this answer may be useful.如果您想了解它是如何“在幕后”工作的,这个答案可能会很有用。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM