[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-append-elim-left0-simp
m ≤ # ar1 ⊦ subarray(ar0 + ar1, # ar0, m) = subarray(ar1, 0, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
append-a
,
append-atp2
,
Used spec theorems:
array
/
Extension
Used simplifier rules:
array-copy
/
size-subarray
array-copy
/
subarray-at
nat
/
lels
nat
/
let
nat
/
fle
nat
/
fle-01
nat-basic
/
f
nat
/
ls-le-simp
nat-basic
/
a
nat-basic
/
c
nat-basic
/
add-base