[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-outofbounds
m ≤ m1 ⊦ valid-idx(kar, ar, m + 1) ∧ ar[m0] = elemindex(a, m1) → ¬ key-index(key, m0) ∈ keyset(kar, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
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: 2
Proof steps: 5
Used lemmas:
key-set-extract-index
,
valid-idx
,
Used spec theorems:
Used simplifier rules:
set-basic
/keyindex-set/
size-zero-01
set-basic
/keyindex-set/
ne-01
nat-basic
/
s-04
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat
/
lels-03
nat-basic
/
ls-02
nat-basic
/
lf-02
key-index
/
sel-01
nat-basic
/
f
nat-basic
/
lf
nat
/
fle
nat-basic
/
trans
elem-index
/
sel-02
nat-basic
/
succ
nat-basic
/
ref