[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 subarray-longer-eq-eq
⊦ subarray(ar0, 0, n + m) = subarray(ar1, 0, n + m) → (subarray(ar0, 0, n) = subarray(ar1, 0, n) ↔ true)
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: 5
Proof steps: 11
Used lemmas:
copy-exact
,
at-copy
,
size-copy
,
Subarray
,
Used spec theorems:
array
/
Extension
Used simplifier rules:
nat-basic
/
f
array
/
Size-mkarray
nat-basic
/
c
nat-basic
/
a
nat-basic
/
eq-01
nat
/
lels
nat
/
ls-le-simp
nat
/
sub-base
nat-basic
/
add-base
nat-basic
/
less-zero
nat-basic
/
l-02
nat
/
fle-01