Logiweb aspects of lemma positiveTripled in pyk

Up Help

The predefined "pyk" aspect

define pyk of lemma positiveTripled 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 t unicode small r unicode small i unicode small p unicode small l unicode small e unicode small d unicode end of text end unicode text end text end define

The predefined "tex" aspect

define tex of lemma positiveTripled 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 t unicode small r unicode small i unicode small p unicode small l unicode small e unicode small d unicode end of text end unicode text end text end define

The user defined "the statement aspect" aspect

define statement of lemma positiveTripled as system Q infer all metavar var x end metavar indeed not0 0 <= 1/ 1 + 1 + 1 * metavar var x end metavar imply not0 not0 0 = 1/ 1 + 1 + 1 * metavar var x end metavar infer not0 0 <= metavar var x end metavar imply not0 not0 0 = metavar var x end metavar end define

The user defined "the proof aspect" aspect

define proof of lemma positiveTripled as lambda var c dot lambda var x dot proof expand quote system Q infer all metavar var x end metavar indeed not0 0 <= 1/ 1 + 1 + 1 * metavar var x end metavar imply not0 not0 0 = 1/ 1 + 1 + 1 * metavar var x end metavar infer lemma 0<3 conclude not0 0 <= 1 + 1 + 1 imply not0 not0 0 = 1 + 1 + 1 cut lemma positiveFactors modus ponens not0 0 <= 1 + 1 + 1 imply not0 not0 0 = 1 + 1 + 1 modus ponens not0 0 <= 1/ 1 + 1 + 1 * metavar var x end metavar imply not0 not0 0 = 1/ 1 + 1 + 1 * metavar var x end metavar conclude not0 0 <= 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar imply not0 not0 0 = 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar cut axiom timesAssociativity conclude 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar cut lemma eqSymmetry modus ponens 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar conclude 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar cut lemma positiveNonzero modus ponens not0 0 <= 1 + 1 + 1 imply not0 not0 0 = 1 + 1 + 1 conclude not0 1 + 1 + 1 = 0 cut lemma reciprocal modus ponens not0 1 + 1 + 1 = 0 conclude 1 + 1 + 1 * 1/ 1 + 1 + 1 = 1 cut lemma eqMultiplication modus ponens 1 + 1 + 1 * 1/ 1 + 1 + 1 = 1 conclude 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = 1 * metavar var x end metavar cut lemma times1Left conclude 1 * metavar var x end metavar = metavar var x end metavar cut lemma eqTransitivity4 modus ponens 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar modus ponens 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = 1 * metavar var x end metavar modus ponens 1 * metavar var x end metavar = metavar var x end metavar conclude 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = metavar var x end metavar cut lemma subLessRight modus ponens 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar = metavar var x end metavar modus ponens not0 0 <= 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar imply not0 not0 0 = 1 + 1 + 1 * 1/ 1 + 1 + 1 * metavar var x end metavar conclude not0 0 <= metavar var x end metavar imply not0 not0 0 = metavar var x end metavar end quote state proof state cache var c end expand end define