[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 isempty-elim-left0
n = # buf0, m ≤ # buf1 ⊦ isempty(buf0 + buf1, n, m) ↔ isempty(buf1, 0, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
isempty-elim-left
,
isempty-elim-right
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
isempty-ext
,
Used spec theorems:
array-splice
/buffer/
append-at
Used simplifier rules:
nat
/
lep-02
array-splice
/buffer/
append-len
nat
/
le-def
nat-basic
/
add-base
nat
/
lez
nat
/
ls-le-simp
array-splice
/buffer/
append-atp2
array-splice
/buffer/
append-a
nat
/
lels
nat-basic
/
l-01
nat
/
fle-01
nat
/
le-ls-simp
nat
/
elim-sub
nat
/
fle
nat-basic
/
f
nat-basic
/
l
nat-basic
/
c
nat-basic
/
a
nat
/
lep