[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 infapp-one-to-succ2
⊦ (a ' + nf).take(n + 2) = a ' + nf.take(n + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
add-list-fun-def
,
to-succ2-nf
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
a
nat-basic
/
c
list
/
c
nat-basic
/
one-01
list-del
/
one-03
list
/
len-02
nat-basic
/
oz
nat
/
add-01
nat-basic
/
add-base
list
/
len-01
list
/
a