[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 vals-at
⊦ n < # fis → (fis .vals)[n] = fis[n] .2
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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: 11
Used lemmas:
getvals-rec-01
,
Used spec theorems:
list-del
/javavalues/
get-rec
Used simplifier rules:
nat
/
ls-le-simp
nat
/
succ-01
nat-basic2
/
oz
list-del
/fieldinit-assoclista/
get-succ
nat
/
elim-pred-c
list
/javavalues/
e-01
list
/javavalues/
c-07
list
/javavalues/
app-02-ant
list
/javavalues/
e
list
/javavalues/
a
list-del
/fieldinit-assoclista/
get-zero-01
pair
/fieldinit/
inj
list-del
/javavalues/
get-zero-01
nat-basic2
/
c
nat-basic2
/
a
nat
/
lels
nat-basic2
/
s
list
/fieldinit-assoclista/
len-02
list
/fieldinit-assoclista/
len
list
/fieldinit-assoclista/
e-01
list
/fieldinit-assoclista/
a
list
/fieldinit-assoclista/
c
list-data
/fieldinit-assoclista/
l
nat-basic1
/
f
pair
/fieldinit/
elim