[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 3 from proof datasize-empbuf-h (previous step)

m ≤ # buf + n ⊦ datasize(buf + mkempbuf(n), m) = datasize(buf, min(# buf, m))

User applied rule structural induction

And obtained the following new goals

Proof step 4:
m ≤ # buf0 ⊦ datasize(buf0 + buf1, m) = datasize(buf0, m)
Proof step 5:
⊦ datasize(buf, 0) = 0
Proof step 6:
m0 +1 ≤ # buf + n, ∀ buf, n. m0 ≤ # buf + n → datasize(buf + mkempbuf(n), m0) = datasize(buf, min(# buf, m0)) ⊦ datasize(buf + mkempbuf(n), m0 +1) = datasize(buf, min(# buf, m0 +1))

Rule argument

indvar: m

Additional information

Used simplifier rules: datasize-append-lower-h: m ≤ # buf0 ⊦ datasize(buf0 + buf1, m) = datasize(buf0, m);%datasize-base: ⊦ datasize(buf, 0) = 0;%nat freely generated by 0, +1;;% ⊦ 0 ≤ m; (s)%append-a: ⊦ (buf + buf0) + buf1 = buf + buf0 + buf1; from specification array-splice[buffer]% ⊦ min(n, 0) = 0; (s)