[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 comp-next
⊦ arraycomp(r1, i1, r2, i2, i, st0) ∧ r1 ≠ r2 → arraycomp(r1, i1, r2, i2, i + 1, st0[r2 -- (i2 + i) ', st0[r1 -- (i1 + i) ']])
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: 0
Proof steps: 4
Used lemmas:
arrayComp
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-04
int-basic1
/
ls-01
int-abs
/
forward-le-05
int-abs
/
lels-02
int-abs
/
forward-le-01
int-basic2
/
add-in
storekey
/
inj-04
refkey
/
inj-01
javastore
/
lookup-if
javastore
/
look-ins
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
succ-02
int-abs
/
lels
int-abs
/
lels-01