[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 sorted-shift-left
n ≤ nused, nused < # zbrar, sorted(zbrar, 0, nused + 1) ⊦ sorted(shl(zbrar, n, nused + 1), 0, nused)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
Used spec theorems:
zbranch-array-sorted
/
sorted-all
zbranch-array-sorted
/
sorted-lt
Used simplifier rules:
nat
/
lep-02
nat
/
le
nat
/
le-ls-simp
nat
/
add-01
znode-ops
/
at-shl
nat-basic
/
l-02
nat
/
le-def
znode-ops
/
size-shl
nat-basic
/
add-base
nat-basic
/
f
nat
/
fle
nat-basic
/
s-04
nat-basic
/
ls-02
oelem
/nat-set/
transitivity
nat-basic
/
succ
nat-basic
/
lf
oelem
/nat-set/
ls-le
nat
/
lels-03
nat
/
fle-01
nat-basic
/
l
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l-08
nat
/
lels
nat
/
ls-le-simp