[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-xhg
⊦ valid-idx(kar, ar, n) ∧ m0 < n ∧ m1 < n ∧ kar[m0] = key-index(key1, n1) ∧ kar[m1] = key-index(key0, n0) → valid-idx(kar[m0, key-index(key0, n0)][m1, key-index(key1, n1)], ar[n0, ar[n0].idx:= m0][n1, ar[n0, ar0[n0].idx:= m0][n1].idx:= m1], n)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
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: 5
Proof steps: 31
Used lemmas:
valid-idx
,
Used spec theorems:
Used simplifier rules:
key-index
/
elim
elem-index
/
elim
nat-basic
/
f
key-index
/
sel-01
array
/key-index-array/
cgetput
array
/key-index-array/
Size-put
elem-index
/
upd-02
array
/index-array-base/
cgetput
nat
/
ls-le-simp
array
/index-array-base/
Size-put
array
/key-index-array/
Put-same
nat
/
le-ls-simp
array
/index-array-base/
ngp-06
nat
/
fle
nat
/
lels
key-index
/
inj
array
/key-index-array/
Put-other
array
/index-array-base/
Put-other
elem-index
/
inj
array
/index-array-base/
Put-same
nat-basic
/
lf-02