define pyk of lemma reciprocalF nonzero 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 r unicode small e unicode small c unicode small i unicode small p unicode small r unicode small o unicode small c unicode small a unicode small l unicode capital f unicode space unicode small n unicode small o unicode small n unicode small z unicode small e unicode small r unicode small o unicode end of text end unicode text end text end define
define tex of lemma reciprocalF nonzero as text unicode start of text unicode capital r unicode small e unicode small c unicode small i unicode small p unicode small r unicode small o unicode small c unicode small a unicode small l unicode capital f unicode small n unicode small o unicode small n unicode small z unicode small e unicode small r unicode small o unicode end of text end unicode text end text end define
define statement of lemma reciprocalF nonzero as system Q infer all metavar var m end metavar indeed all metavar var fx end metavar indeed not0 [ metavar var fx end metavar ; metavar var m end metavar ] = 0 infer [ 1f/ metavar var fx end metavar ; metavar var m end metavar ] = 1/ [ metavar var fx end metavar ; metavar var m end metavar ] end define
define proof of lemma reciprocalF nonzero 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 fx end metavar indeed not0 [ metavar var fx end metavar ; metavar var m end metavar ] = 0 infer 1rule ifThenElse false modus ponens not0 [ metavar var fx end metavar ; metavar var m end metavar ] = 0 conclude if( [ metavar var fx end metavar ; metavar var m end metavar ] = 0 , 0 , 1/ [ metavar var fx end metavar ; metavar var m end metavar ] ) = 1/ [ metavar var fx end metavar ; metavar var m end metavar ] cut axiom reciprocalF conclude [ 1f/ metavar var fx end metavar ; metavar var m end metavar ] = if( [ metavar var fx end metavar ; metavar var m end metavar ] = 0 , 0 , 1/ [ metavar var fx end metavar ; metavar var m end metavar ] ) cut lemma eqTransitivity modus ponens [ 1f/ metavar var fx end metavar ; metavar var m end metavar ] = if( [ metavar var fx end metavar ; metavar var m end metavar ] = 0 , 0 , 1/ [ metavar var fx end metavar ; metavar var m end metavar ] ) modus ponens if( [ metavar var fx end metavar ; metavar var m end metavar ] = 0 , 0 , 1/ [ metavar var fx end metavar ; metavar var m end metavar ] ) = 1/ [ metavar var fx end metavar ; metavar var m end metavar ] conclude [ 1f/ metavar var fx end metavar ; metavar var m end metavar ] = 1/ [ metavar var fx end metavar ; metavar var m end metavar ] end quote state proof state cache var c end expand end define
The pyk compiler, version 0.grue.20060417+ by Klaus Grue,