[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 boolvals-get
⊦ n < # vals → (booleanvalues(vals)[n] ↔ vals[n] .boolval)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
booleanarray-get
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
booleanvalues-rec
,
booleanvalues-empty
,
Used spec theorems:
list-del
/javavalues/
get-numrec
Used simplifier rules:
list-data
/javavalues/
l
nat-basic1
/
f
nat
/
succ-01
list-del
/bitlista/
get-succ
nat-basic2
/
oz
nat
/
elim-pred-c
nat
/
pred-03
list-del
/bitlista/
get-zero-01
list
/bitlista/
a
list-del
/javavalues/
get-zero-01
nat
/
lels
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
list
/javavalues/
len-02
list
/javavalues/
len
list
/javavalues/
a
list
/bitlista/
c
list
/javavalues/
c
list-data
/javavalues/
size-01
nat-basic1
/
zero-01