[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 63 from proof write-inv-post (previous step)

files1 -- ino = files0 -- ino, files0[ino] = mkfile(m1, md1, n2, content0), files1[ino] = mkfile(m1, md1, # links(ino, dirs), content1), content0.stream from m1 = σ⊥, n3 < m1, afs-cons(dirs, files1), ino ∈ files1, ino ∈ files0, n0 + n ≤ m1, n ≤ # buf, n1 ≤ # buf + n0, n0 + n ≤ n1 ⊦ (n3 < n0 ∨ n0 + n ≤ n3 ⊃ getbyte(n3, content0);buf[n3 - n0]) = ((content0.stream to n0) + (⌜buf⌝ to n) + (content0.stream from n0 + n))[n3], n = 0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 64:
⊦ ⌜m⌝ < # σ0 → (σ0 + σ2)[m] = σ0[m]
Proof step 65:
files1 -- ino = files0 -- ino, files1[ino] = mkfile(m1, md1, # links(ino, dirs), content1), files0[ino] = mkfile(m1, md1, n2, content0), content0.stream from m1 = σ⊥, n3 < m1, afs-cons(dirs, files1), ino ∈ files0, ino ∈ files1, n0 + n ≤ n1, n1 ≤ # buf + n0, n ≤ # buf, n0 + n ≤ m1 ⊦ (n3 < n0 ∨ n0 + n ≤ n3 ⊃ getbyte(n3, content0);buf[n3 - n0]) = ((content0.stream to n0) + (⌜buf⌝ to n) + (content0.stream from n0 + n))[n3], n = 0, ⌜n3⌝ < #(content0.stream to n0)

Rule argument

spec: stream, inst: buffer-inf name: get-append-ls seq: ⊦ ⌜m⌝ < # σ0 → (σ0 + σ2)[m] = σ0[m] subst: [m, σ2, σ0] → [n3, (⌜buf⌝ to n) + (content0.stream from n0 + n), content0.stream to n0] flags: <all paths>

Additional information

Used simplifier rules: ⊦ # content.stream = ∞; (s)% ⊦ ¬ ∞ < n∞; (s)%¬ # σ0 < ⌜n⌝ ⊦ #(σ0 to n) = ⌜n⌝ ; (s)% ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)%m < n, ¬ # σ0 < ⌜n⌝ ⊦ (σ0 to n)[m] = σ0[m]; (s)% ⊦ content.stream[n] = getbyte(n, content); (s) Used terms: n3, (⌜buf⌝ to n) + (content0.stream from n0 + n), content0.stream to n0