[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
,
Proof step 7 from proof RED-correct (
previous step
)
〈RED1(t; tn0): kappa0 〉 tn0 = some(t3), 〈RED1(t; tn0)〉 tn0 = some(t3), 〈RED(t3; t0): kappa0 〉 t0 = t1, t => t3, ¬ t =>* t1 ∨ t1 => t' ⊦ 〈RED(t3; t'): kappa0 〉 t' = t1
Heuristic contract and execute applied rule execute call
And closed the goal!
Rule argument
[fmaposlist-arg: (pos: left 3, pos: right 1)]
Additional information
[[CONCRETESIMPRULES : ()]]