[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-keyrange-in-ri-data
n < nused, nused ≤ # zbrar ⊦ adr ∈ key-range(zbrar, n, nused, ri) → adr ∈ ri
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 21
Used lemmas:
range
,
Used spec theorems:
store+set
/node-index/
Data-in
node-index-restrict
/
at-le
Used simplifier rules:
nat-basic
/
f
nat-basic
/
zero
node-index-restrict
/
at-le
oelem
/nat-set/
irreflexivity
nat-basic
/
s-04
nat
/
succ-01
nat
/
elim-pred-c
node-index-restrict
/
at-gt
store+set
/node-index/
In-data-in
nat-basic
/
succ-03
nat
/
fle
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
node-index-restrict
/
in-gt
node-index-restrict
/
in-le