In a proof of one lemma I eventually reached a state, where
I have a premise
H: 0 = 2
and I have to prove
false
.
Question : how to infer that the premise H
is false to conclude the proof?
The discriminate
tactic can deal with situations like that. I believe that easy
also works, as does congruence
, which are a bit more general than discriminate
.
If you want to understand how it works "behind the scenes", this answer may be useful.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.