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

#(content.stream from (n0 + n) + m) = ∞, n0 + n = m0 * VFS_PAGE_SIZE + n2, files1 -- ino = files0 -- ino, VFS_PAGE_SIZE = n4 + n2 + m, files1[ino] = mkfile(m2, md0, # links(ino, dirs), content0), files0[ino] = mkfile(m2, md0, m4, content), afs-cons(dirs, files1), ino ∈ files1, ino ∈ files0, m0 * VFS_PAGE_SIZE ≤ n1, n + m ≤ # buf, n ≤ # buf, n1 ≤ # buf + n0, n0 + n ≤ n1, m0 * VFS_PAGE_SIZE ≤ # buf + n0 ⊦ #((⌜buf⌝ from n) to m) = ∞, #(((content.stream to n0) + (⌜buf⌝ to n) to n0 + n) from m0 * VFS_PAGE_SIZE) = ∞, n4 + m = 0, content.stream from (n0 + n) + n4 + m = content.stream from (n0 + n) + m from n4

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 88:
n0 + n = m0 * VFS_PAGE_SIZE + n2, files1 -- ino = files0 -- ino, VFS_PAGE_SIZE = n4 + n2 + m, files0[ino] = mkfile(m2, md0, m4, content), files1[ino] = mkfile(m2, md0, # links(ino, dirs), content0), afs-cons(dirs, files1), ino ∈ files0, ino ∈ files1, m0 * VFS_PAGE_SIZE ≤ # buf + n0, n0 + n ≤ n1, n1 ≤ # buf + n0, n ≤ # buf, n + m ≤ # buf, m0 * VFS_PAGE_SIZE ≤ n1 ⊦ #(((content.stream to n0) + (⌜buf⌝ to n) to n0 + n) from m0 * VFS_PAGE_SIZE) = ∞, #((⌜buf⌝ from n) to m) = ∞, n4 + m = 0, content.stream from (n0 + n) + n4 + m = content.stream from (n0 + n) + m from n4

Rule argument

Additional information

Used simplifier rules: ⊦ #(content.stream from n) = ∞; (s)