[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 RED-correct
〈RED(t; t')〉 t' = t1 ⊦ t =>* t1 ∧ irred(t1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
RED-iff-reduce
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 34
Used lemmas:
kappa-RED1
,
RED1-lem
,
decl-03
,
Used spec theorems:
reduce
/
irred-def
reduce
/
reduce-def
Used simplifier rules:
reduce
/
reduction-is-reflexive
nat-basic2
/
c
nat-basic2
/
a
reduce
/
it-rec
reduce
/
irred-no-step
term_or_none
/
disj
term_or_none
/
elim
nat-basic2
/
succ