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

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

User applied rule insert equation

And obtained the following new goals

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

Rule argument

pos: left 2 flags: discard

Proof step 12 from proof write-inv-post (previous step)

User applied rule insert equation

And obtained the following new goals

Rule argument

Additional information