[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 booleanarray-get
⊦ okarray(r, boolean_type, st) ∧ 0 ≤ i ∧ i < st[r -- _length] .intval → (getbooleanarray(r, st)[i→n(i)] ↔ st[r -- i '] .boolval)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
two-way-sort
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
boolvals-get
,
getbooleanarray
,
getbooleanarray-def
,
Used spec theorems:
storearrays
/
get-get
Used simplifier rules:
intnat
/
i2i-pos-01
int-basic2
/
ax-04
int-basic2
/
add-a
int-basic2
/
add-c
okfuns
/
okarray-05
int-abs
/
forward-le-01
int-abs
/
forward-le-05
storearrays
/
get-length
intnat
/
labs
int-abs
/
absle
int-abs
/
abs-16
int-abs
/
lels
int-abs
/
lels-03