[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 payload-copy-right-upper
n + nused < # zbrar ⊦ payload(copy(zbrar, n, zbrar, n + 1, nused), n + 1, nused) = payload(zbrar, n, 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: 9
Proof steps: 22
Used lemmas:
payload-drop-lower
,
payload-rec
,
payload-base
,
Used spec theorems:
array-copy
/zbranch-array/
copy-rec
Used simplifier rules:
array-copy
/zbranch-array/
Copy-zero
nat
/
lels
nat
/
fle
nat
/
cancel-01
nat-mult
/
two-02
nat
/
le-num-06
nat
/
lep-02
array-copy
/zbranch-array/
at-copy
nat-mult
/
twols
nat
/
elim-sub
nat-mult
/
twole-02
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
one
nat-mult
/
numeral-25
nat-basic
/
nls-fst
zbranch
/
elim-03
zbranch
/
test-05
array-copy
/zbranch-array/
size-copy
nat
/
le-def
nat-basic
/
f
nat-basic
/
lf
oelem
/nat-set/
transitivity
nat
/
add-num-03
nat-basic
/
succ
nat-basic
/
l
nat-basic
/
one
nat-basic
/
l-01
oelem
/nat-set/
irreflexivity
nat-basic
/
a
nat-basic
/
c