[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 RED1-lem
⊦ 〈RED1(t; tn)〉 (tn = none ⊃ irred(t); t => tn .t)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
RED-complete
,
RED-correct
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 38
Used lemmas:
TOPRED-lem
,
decl-01
,
Used spec theorems:
reduce
/
irred-def
Used simplifier rules:
reduce
/
no-ap-irred
reduce
/
reduce-topreduce
reduce
/
irred-top-01
reduce
/
irred-top
reduce
/
fun-value-and-arg-reduces-imp-app-reduces
term_or_none
/
disj
term_or_none
/
sel
reduce
/
fun-reduces-imp-app-reduces
term
/
size-03
nat-basic2
/
succ
nat-basic2
/
s
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
term
/
test-03
term
/
elim