[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 ks-RED
⊦ 〈RED(ks(n); t)〉 ((even(n) → t = K) ∧ (odd(n) → t = K _ K))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 97
Used lemmas:
ks-RED1
,
decl-04
,
decl-01
,
decl-03
,
Used spec theorems:
termfuns
/
ks-rec-01
Used simplifier rules:
nat
/
lels
nat
/
le-add
nat-even
/
otwo-02
nat-even
/
two-02
nat
/
lep
nat-basic2
/
one
nat-basic2
/
c
nat-basic2
/
a
nat
/
add-num-03
nat
/
lels-01
nat-basic1
/
twols-01
nat
/
elim-sub
nat
/
one-02
nat-even
/
zero
nat-even
/
ozero
termfuns
/
ks-K-02
value
/
val-K
term
/
inj
termfuns
/
ks-not-S
term
/
disj-01
termfuns
/
ks-K
term
/
test-03
term
/
elim
nat-even
/
oone
nat-even
/
one
term_or_none
/
sel
term
/
test-02
termfuns
/
ks-zero
term_or_none
/
disj