[英]How do I prove this in Lean? p ∨ ¬p
I have a theorem to prove on lean,我有一个关于精益的定理要证明,
theorem T (h : ¬ A) : ¬ (A ∨ B) ∨ (¬ A ∧ B)
For which to prove, I guess, I need to use,为了证明,我想,我需要使用,
or.elim (B ∨ ¬B) (assume b: B, ...) (assume nb:¬B, ...)
For which, again, I have to prove为此,我必须再次证明
B v ¬B
So, how do I proceed with this?那么,我该如何进行呢? Is there any better method?
有没有更好的方法?
pv ¬p
is a lemma from the core library called classical.em
. pv ¬p
是来自名为classical.em
的核心库的引理。
import tactic
variables (A B : Prop)
theorem T (h : ¬ A) : ¬ (A ∨ B) ∨ (¬ A ∧ B) := by tauto!
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.