Logiweb aspects of lemma positiveBase in pyk

Up Help

The predefined "pyk" aspect

define pyk of lemma positiveBase 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 p unicode small o unicode small s unicode small i unicode small t unicode small i unicode small v unicode small e unicode capital b unicode small a unicode small s unicode small e unicode end of text end unicode text end text end define

The predefined "tex" aspect

define tex of lemma positiveBase as text unicode start of text unicode capital p unicode small o unicode small s unicode small i unicode small t unicode small i unicode small v unicode small e unicode capital b unicode small a unicode small s unicode small e unicode end of text end unicode text end text end define

The user defined "the statement aspect" aspect

define statement of lemma positiveBase as system Q infer all metavar var m end metavar indeed all metavar var x end metavar indeed not0 0 <= metavar var x end metavar imply not0 not0 0 = metavar var x end metavar infer not0 0 <= metavar var x end metavar ^ metavar var m end metavar imply not0 not0 0 = metavar var x end metavar ^ metavar var m end metavar end define

The user defined "the proof aspect" aspect

define proof of lemma positiveBase 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 x end metavar indeed not0 0 <= metavar var x end metavar imply not0 not0 0 = metavar var x end metavar infer lemma positiveBase base conclude not0 0 <= metavar var x end metavar ^ 0 imply not0 not0 0 = metavar var x end metavar ^ 0 cut lemma positiveBase indu modus ponens not0 0 <= metavar var x end metavar imply not0 not0 0 = metavar var x end metavar conclude not0 0 <= metavar var x end metavar ^ metavar var m end metavar imply not0 not0 0 = metavar var x end metavar ^ metavar var m end metavar imply not0 0 <= metavar var x end metavar ^ metavar var m end metavar + 1 imply not0 not0 0 = metavar var x end metavar ^ metavar var m end metavar + 1 cut lemma induction modus ponens not0 0 <= metavar var x end metavar ^ 0 imply not0 not0 0 = metavar var x end metavar ^ 0 modus ponens not0 0 <= metavar var x end metavar ^ metavar var m end metavar imply not0 not0 0 = metavar var x end metavar ^ metavar var m end metavar imply not0 0 <= metavar var x end metavar ^ metavar var m end metavar + 1 imply not0 not0 0 = metavar var x end metavar ^ metavar var m end metavar + 1 conclude not0 0 <= metavar var x end metavar ^ metavar var m end metavar imply not0 not0 0 = metavar var x end metavar ^ metavar var m end metavar end quote state proof state cache var c end expand end define