Logiweb aspects of lemma subLessLeft(R) in pyk

Up Help

The predefined "pyk" aspect

define pyk of lemma subLessLeft(R) as text unicode start of text unicode small l unicode small e unicode small m unicode small m unicode small a unicode space unicode small s unicode small u unicode small b unicode capital l unicode small e unicode small s unicode small s unicode capital l unicode small e unicode small f unicode small t unicode left parenthesis unicode capital r unicode right parenthesis unicode end of text end unicode text end text end define

The predefined "tex" aspect

define tex of lemma subLessLeft(R) as text unicode start of text unicode capital s unicode small u unicode small b unicode capital l unicode small e unicode small s unicode small s unicode capital l unicode small e unicode small f unicode small t unicode left parenthesis unicode capital r unicode right parenthesis unicode end of text end unicode text end text end define

The user defined "the statement aspect" aspect

define statement of lemma subLessLeft(R) as system Q infer all metavar var ep end metavar indeed all metavar var m end metavar indeed all metavar var fy end metavar indeed all metavar var fz end metavar indeed 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 rx end metavar << metavar var rz end metavar infer metavar var ry end metavar << metavar var rz end metavar end define

The user defined "the proof aspect" aspect

define proof of lemma subLessLeft(R) as lambda var c dot lambda var x dot proof expand quote system Q infer all metavar var ep end metavar indeed all metavar var m end metavar indeed all metavar var fy end metavar indeed all metavar var fz end metavar indeed 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 rx end metavar << metavar var rz end metavar infer metavar var fy end metavar in0 metavar var ry end metavar infer metavar var fz end metavar in0 metavar var rz end metavar infer not0 0 <= metavar var ep end metavar imply not0 not0 0 = metavar var ep end metavar infer lemma set equality nec condition(2) modus ponens metavar var rx end metavar == metavar var ry end metavar modus ponens metavar var fy end metavar in0 metavar var ry end metavar conclude metavar var fy end metavar in0 metavar var rx end metavar cut 1rule from<