Logiweb aspects of lemma eventually=f to sameF helper in pyk

Up Help

The predefined "pyk" aspect

define pyk of lemma eventually=f to sameF helper 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 e unicode small v unicode small e unicode small n unicode small t unicode small u unicode small a unicode small l unicode small l unicode small y unicode equal sign unicode small f unicode space unicode small t unicode small o unicode space unicode small s unicode small a unicode small m unicode small e unicode capital f unicode space unicode small h unicode small e unicode small l unicode small p unicode small e unicode small r unicode end of text end unicode text end text end define

The predefined "tex" aspect

define tex of lemma eventually=f to sameF helper as text unicode start of text unicode left parenthesis unicode capital e unicode small v unicode small e unicode small n unicode small t unicode small u unicode small a unicode small l unicode small l unicode small y unicode equal sign unicode small f unicode right parenthesis unicode two unicode small s unicode small a unicode small m unicode small e unicode capital f unicode left parenthesis unicode capital h unicode small e unicode small l unicode small p unicode small e unicode small 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 eventually=f to sameF helper as system Q infer all metavar var m end metavar indeed all metavar var n end metavar indeed all metavar var ep end metavar indeed all metavar var fx end metavar indeed all metavar var fy end metavar indeed for all objects metavar var m end metavar indeed metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] imply not0 0 <= metavar var ep end metavar imply not0 not0 0 = metavar var ep end metavar imply metavar var n end metavar <= metavar var m end metavar imply not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | <= metavar var ep end metavar imply not0 not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = metavar var ep end metavar end define

The user defined "the proof aspect" aspect

define proof of lemma eventually=f to sameF helper as lambda var c dot lambda var x dot proof expand quote system Q infer all metavar var m end metavar indeed all metavar var n end metavar indeed all metavar var ep end metavar indeed all metavar var fx end metavar indeed all metavar var fy end metavar indeed for all objects metavar var m end metavar indeed metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] infer lemma a4 at metavar var m end metavar modus ponens for all objects metavar var m end metavar indeed metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] conclude metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] cut not0 0 <= metavar var ep end metavar imply not0 not0 0 = metavar var ep end metavar infer metavar var n end metavar <= metavar var m end metavar infer 1rule mp modus ponens metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] modus ponens metavar var n end metavar <= metavar var m end metavar conclude [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] cut lemma positiveToLeft(Eq)(1 term) modus ponens [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] conclude [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] = 0 cut lemma sameNumerical modus ponens [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] = 0 conclude | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = | 0 | cut lemma |0|=0 conclude | 0 | = 0 cut lemma eqTransitivity modus ponens | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = | 0 | modus ponens | 0 | = 0 conclude | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = 0 cut lemma eqSymmetry modus ponens | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = 0 conclude 0 = | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | cut lemma subLessLeft modus ponens 0 = | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | modus ponens not0 0 <= metavar var ep end metavar imply not0 not0 0 = metavar var ep end metavar conclude not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | <= metavar var ep end metavar imply not0 not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = metavar var ep end metavar cut all metavar var m end metavar indeed all metavar var n end metavar indeed all metavar var ep end metavar indeed all metavar var fx end metavar indeed all metavar var fy end metavar indeed 1rule deduction modus ponens all metavar var m end metavar indeed all metavar var n end metavar indeed all metavar var ep end metavar indeed all metavar var fx end metavar indeed all metavar var fy end metavar indeed for all objects metavar var m end metavar indeed metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] infer not0 0 <= metavar var ep end metavar imply not0 not0 0 = metavar var ep end metavar infer metavar var n end metavar <= metavar var m end metavar infer not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | <= metavar var ep end metavar imply not0 not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = metavar var ep end metavar conclude for all objects metavar var m end metavar indeed metavar var n end metavar <= metavar var m end metavar imply [ metavar var fx end metavar ; metavar var m end metavar ] = [ metavar var fy end metavar ; metavar var m end metavar ] imply not0 0 <= metavar var ep end metavar imply not0 not0 0 = metavar var ep end metavar imply metavar var n end metavar <= metavar var m end metavar imply not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | <= metavar var ep end metavar imply not0 not0 | [ metavar var fx end metavar ; metavar var m end metavar ] + - [ metavar var fy end metavar ; metavar var m end metavar ] | = metavar var ep end metavar end quote state proof state cache var c end expand end define