[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 valid-idx-update-key
⊦ valid-idx(kar, ar, n) ∧ kar[m] = key-index(key0, m0) → valid-idx(kar[m, key-index(key, m0)], ar, n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
bin-min-heap-prepost
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 11
Used lemmas:
valid-idx
,
Used spec theorems:
Used simplifier rules:
array
/key-index-array/
Size-put
key-index
/
elim
elem-index
/
elim
key-index
/
inj
array
/key-index-array/
Put-same
nat-basic
/
lf-02
key-index
/
sel-01
nat-basic
/
f
nat
/
fle
elem-index
/
sel-02
array
/key-index-array/
Put-other