define pyk of lemma <<==Transitivity as text unicode start of text unicode small l unicode small e unicode small m unicode small m unicode small a unicode space unicode less than unicode less than unicode equal sign unicode equal sign unicode capital t unicode small r unicode small a unicode small n unicode small s unicode small i unicode small t unicode small i unicode small v unicode small i unicode small t unicode small y unicode end of text end unicode text end text end define
define tex of lemma <<==Transitivity as text unicode start of text unicode less than unicode less than unicode equal sign unicode equal sign unicode capital t unicode small r unicode small a unicode small n unicode small s unicode small i unicode small t unicode small i unicode small v unicode small i unicode small t unicode small y unicode end of text end unicode text end text end define
define statement of lemma <<==Transitivity as system Q infer all metavar var rx end metavar indeed all metavar var ry end metavar indeed all metavar var rz end metavar indeed not0 metavar var rx end metavar << metavar var ry end metavar imply metavar var rx end metavar == metavar var ry end metavar infer not0 metavar var ry end metavar << metavar var rz end metavar imply metavar var ry end metavar == metavar var rz end metavar infer not0 metavar var rx end metavar << metavar var rz end metavar imply metavar var rx end metavar == metavar var rz end metavar end define
define proof of lemma <<==Transitivity as lambda var c dot lambda var x dot proof expand quote system Q infer all metavar var rx end metavar indeed all metavar var ry end metavar indeed all metavar var rz end metavar indeed metavar var rx end metavar << metavar var ry end metavar infer metavar var ry end metavar << metavar var rz end metavar infer lemma <
GRD-2006-09-15.UTC:09:33:20.992497
=
MJD-53993.TAI:09:33:53.992497
=
LGT-4665029633992497e-6