[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 abs-fillcount-empty-echdr
⊦ n < # pebs ∧ apebs[n] = mkpeb(empty, avhdr, buf, m, false) ∧ pebs[n] = mkpeb(buf0, m0, false) ∧ abs(pebs, apebs) → m0 = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: forward,
Comment:
Used by:
Used by units in proved state:
ubi-io-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 3
Used lemmas:
abs-vidhdr
,
abs-echdr
,
abs-peb
,
abs
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
lf-01
nat-basic
/
f
peb
/
sel-05
apeb
/
sel-08
peb
/
sel-06
apeb
/
sel-04