In extensional Type Theory definitional (i.e. computational) equality is not distinguished from propositional equality, which requires proof.

• 在外延类型论中定义性(就是计算性)等式不区别于需要证明的命题性等式。