Lean 语言参考

4.2. 提案🔗

命题 是接受证据的有意义的陈述。 无意义的陈述不是命题,但错误的陈述才是。 所有命题均按 Prop 分类。

命题具有以下属性:

定义证明无关性

同一命题的任何两个证明都是完全可以互换的。

运行时无关性

命题将从编译的代码中删除。

必然性

命题可以量化任何宇宙中的类型。

限制性淘汰

除了 subsingletons 之外,命题不能被消元为非命题类型。

外延性

任何两个逻辑上等价的命题都可以用 propext 公理证明相等。

🔗axiom
propext {a b : Prop} : (a b) a = b
propext {a b : Prop} : (a b) a = b

The axiom of propositional extensionality. It asserts that if propositions a and b are logically equivalent (that is, if a can be proved from b and vice versa), then a and b are equal, meaning a can be replaced with b in all contexts.

The standard logical connectives provably respect propositional extensionality. However, an axiom is needed for higher order expressions like P a where P : Prop Prop is unknown, as well as for equality. Propositional extensionality is intuitionistically valid.