Logiweb(TM)

Logiweb aspects of lemma fromNotLess in pyk

Up Help

The predefined "pyk" aspect

define pyk of lemma fromNotLess 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 f unicode small r unicode small o unicode small m unicode capital n unicode small o unicode small t unicode capital l unicode small e unicode small s unicode small s unicode end of text end unicode text end text end define

The predefined "tex" aspect

define tex of lemma fromNotLess as text unicode start of text unicode small f unicode small r unicode small o unicode small m unicode capital n unicode small o unicode small t unicode capital l unicode small e unicode small s unicode small s unicode end of text end unicode text end text end define

The user defined "the statement aspect" aspect

define statement of lemma fromNotLess as system Q infer all metavar var x end metavar indeed all metavar var y end metavar indeed not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar infer metavar var y end metavar <= metavar var x end metavar end define

The user defined "the proof aspect" aspect

define proof of lemma fromNotLess as lambda var c dot lambda var x dot proof expand quote system Q infer all metavar var x end metavar indeed all metavar var y end metavar indeed not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar infer metavar var x end metavar <= metavar var y end metavar infer 1rule repetition modus ponens not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar conclude not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar cut prop lemma remove double neg modus ponens not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar conclude metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar cut 1rule mp modus ponens metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar modus ponens metavar var x end metavar <= metavar var y end metavar conclude not0 not0 metavar var x end metavar = metavar var y end metavar cut prop lemma remove double neg modus ponens not0 not0 metavar var x end metavar = metavar var y end metavar conclude metavar var x end metavar = metavar var y end metavar cut lemma eqSymmetry modus ponens metavar var x end metavar = metavar var y end metavar conclude metavar var y end metavar = metavar var x end metavar cut lemma eqLeq modus ponens metavar var y end metavar = metavar var x end metavar conclude metavar var y end metavar <= metavar var x end metavar cut all metavar var x end metavar indeed all metavar var y end metavar indeed 1rule deduction modus ponens all metavar var x end metavar indeed all metavar var y end metavar indeed not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar infer metavar var x end metavar <= metavar var y end metavar infer metavar var y end metavar <= metavar var x end metavar conclude not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar imply metavar var x end metavar <= metavar var y end metavar imply metavar var y end metavar <= metavar var x end metavar cut not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar infer 1rule mp modus ponens not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar imply metavar var x end metavar <= metavar var y end metavar imply metavar var y end metavar <= metavar var x end metavar modus ponens not0 not0 metavar var x end metavar <= metavar var y end metavar imply not0 not0 metavar var x end metavar = metavar var y end metavar conclude metavar var x end metavar <= metavar var y end metavar imply metavar var y end metavar <= metavar var x end metavar cut prop lemma auto imply conclude metavar var y end metavar <= metavar var x end metavar imply metavar var y end metavar <= metavar var x end metavar cut axiom leqTotality conclude not0 metavar var x end metavar <= metavar var y end metavar imply metavar var y end metavar <= metavar var x end metavar cut prop lemma from disjuncts modus ponens not0 metavar var x end metavar <= metavar var y end metavar imply metavar var y end metavar <= metavar var x end metavar modus ponens metavar var x end metavar <= metavar var y end metavar imply metavar var y end metavar <= metavar var x end metavar modus ponens metavar var y end metavar <= metavar var x end metavar imply metavar var y end metavar <= metavar var x end metavar conclude metavar var y end metavar <= metavar var x end metavar end quote state proof state cache var c end expand end define

The pyk compiler, version 0.grue.20060417+ by Klaus Grue,
GRD-2006-09-15.UTC:09:33:20.992497 = MJD-53993.TAI:09:33:53.992497 = LGT-4665029633992497e-6