[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 42 from proof RED1-lem (conclusion)
⊦ 〈RED1(t; tn)〉 (tn = none ⊃ irred(t); t => tn .t)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 41
:
⊦ 〈RED1(t; tn)〉 (tn = none ⊃ irred(t); t => tn .t)
Rule argument
[emptyarg]
Additional information
[[CONCRETESIMPRULES : ()]]