[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 keys-drop-lower
n ≠ 0, m + n + nused ≤ # zbrar ⊦ keys(zbrar[m, zbr], m + n, nused) = keys(zbrar, m + n, nused)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
keys-mod
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
keys-rec
,
keys-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
succ
nat
/
lels
nat
/
fle
nat-basic
/
l
nat-basic
/
l-02
array
/zbranch-array/
Size-put
array
/zbranch-array/
cngetput
nat-basic
/
eq-02
nat
/
succ-01
nat-basic
/
a
nat-basic
/
c
nat-basic
/
oz