[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
,
Proof step 1 from proof inv-leb-size (conclusion)
⊦ awbuf-inv(avol, bleb) ∧ n < # avol ∧ avol[n] = mapped(buf) → ¬ LEB_SIZE < # buf
System applied rule normalize
And obtained the following new goals
Proof step 2
:
avol[n] = mapped(buf), LEB_SIZE < # buf, n < # avol, awbuf-inv(avol, bleb) ⊦
Rule argument
Additional information