[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 restrict-le1
⊦ key0 < key1 → ri |≤ key0 |≤ key1 = ri |≤ key0
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: 3
Proof steps: 7
Used lemmas:
at-le
,
in-le
,
Used spec theorems:
store
/node-index/
k-Extension
Used simplifier rules:
oelem
/key-order/
ls-le
oelem
/key-order/
nll
oelem
/key-order/
transitivity