[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 arrayMaxWhile
st[_mode] = noval, okarray(a, int_type, st), init(st), getintarray(a, st) ≠ [] ⊦ 〈st; i =
swt
.
ArrayMax
.max(a); 〉 (st[a -- i '] .intval = max(getintarray(a, st)) ∧ 0 ≤ i ∧ i < st[a -- _length] .intval)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 49
Used lemmas:
Used spec theorems:
storearrays
/
getintarray-in
intlist
/
max-def
Used simplifier rules:
int-abs
/
lels-03
int-abs
/
sub-sub
int-abs
/
sub-le-01
int-abs
/
minus-add
int-basic1
/
ls-01
storearrays
/
getintarray-in-01
int-abs
/
ler
oelem
/intlista/
lel
int-abs
/
anti
int-abs
/
Sub-def
int-abs
/
sub-ls
int-abs
/
abssub-02
int-abs
/
abssub-01
intnat
/
labs
int-abs
/
lels
int-abs
/
succ-01
int-abs
/
numleledel-01
int-abs
/
numle-02
valuefuns
/
val2int-int-01
okfuns
/
okarray-intval
okfuns
/
okarray-04
valuefuns
/
val2int-int
int-basic1
/
forward-pos
int-abs
/
lels-02
okfuns
/
intval-01
int-abs
/
forward-lele
int-abs
/
forward-lels
int-abs
/
zero-gels-04
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-basic1
/
irref
int-abs
/
lels-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
succ-02
int-abs
/
sub-eq
okfuns
/
okarray-length-02
okfuns
/
okarray-intval-01
valuefuns
/
coerce-int
specialkeys
/
length-03
okfuns
/
okarray-05
storefuns
/
initdone-05