[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 get-cons-succ
⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
get-cons-num
,
to-unwind-end
,
Used by units in proved state:
mon-lim-filter-count
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
one-inf
,
sel-inf
,
sel-fin
,
append-assoc
,
get-append2-fin
,
Used spec theorems:
Used simplifier rules:
list-del
/
get-succ
list
/
a
nat
/
pred-03
nat-basic2
/
oz
nat-basic2
/
a
nat-basic2
/
c
nat
/
add-01
nat-basic2
/
add-base