define pyk of lemma +1IsPositive(N) as text unicode start of text unicode small l unicode small e unicode small m unicode small m unicode small a unicode space unicode plus sign unicode one unicode capital i unicode small s 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 left parenthesis unicode capital n unicode right parenthesis unicode end of text end unicode text end text end define
define tex of lemma +1IsPositive(N) as text unicode start of text unicode left parenthesis unicode plus sign unicode one unicode right parenthesis unicode capital i unicode small s 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 left parenthesis unicode capital n unicode right parenthesis unicode end of text end unicode text end text end define
define statement of lemma +1IsPositive(N) as system Q infer all metavar var m end metavar indeed Nat( metavar var m end metavar ) endorse not0 0 <= metavar var m end metavar + 1 imply not0 not0 0 = metavar var m end metavar + 1 end define
define proof of lemma +1IsPositive(N) as lambda var c dot lambda var x dot proof expand quote system Q infer all metavar var m end metavar indeed Nat( metavar var m end metavar ) endorse axiom nonnegative(N) modus probans Nat( metavar var m end metavar ) conclude 0 <= metavar var m end metavar cut lemma leqPlus1 modus ponens 0 <= metavar var m end metavar conclude not0 0 <= metavar var m end metavar + 1 imply not0 not0 0 = metavar var m end metavar + 1 end quote state proof state cache var c end expand end define
The pyk compiler, version 0.grue.20060417+ by Klaus Grue,