[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 inv-add
# xs < h, # xs = xs_len, # ys = 0 ∨ # ys = h ⊦ ⟪caterpillar_add#(a, h; xs, xs_len, ys)⟫ (# xs < h ∧ # xs = xs_len ∧ (# ys = 0 ∨ # ys = h))
Type: A proof obligation
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: 0
Proof steps: 8
Used lemmas:
add
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
ref
list-data
/
size-01
nat-basic
/
zero
nat-basic
/
oz
list-data
/
l
list
/
c
list
/
len-05
nat-basic
/
succ
list
/
a
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c
nat-basic
/
neq-01
nat-basic
/
s-04