[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 in-keys
m + nused ≤ # zbrar ⊦ key ∈ keys(zbrar, m, nused) ↔ (∃ n. n < nused ∧ zbrar[m + n].key = key)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
keys-shift-left
,
payload-keys
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 17
Used lemmas:
keys-rec
,
keys-base
,
Used spec theorems:
Used simplifier rules:
set-basic
/node-index/
In-empty
nat-basic
/
nls-fst
set-basic
/node-index/
In-insert
nat-basic
/
zero-01
nat
/
lels
nat-basic
/
add-base
nat
/
succ-01
nat-basic
/
succ
set-basic
/node-index/
size-zero-01
nat-basic
/
f
set-basic
/node-index/
ne-01
nat-basic
/
s-04
nat-basic
/
a
nat-basic
/
c