[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem decl-01
RED1 (t; tn) { TOPRED(t; tn) ; if tn = none ∧ ap(t) then { RED1(t .1; tn) ; if tn ≠ none then tn := some(tn .t _ t .2) else if value(t .1) then { RED1(t .2; tn) ; if tn ≠ none then tn := some(t .1 _ tn .t) } } }
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
RED1-lem
,
SII-loops
,
kappa-RED1
,
ks-RED
,
ks-RED1
,
termination-RED1
,
Used by units in proved state:
Proof exists?: No