[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 255 from proof refine-truncate (previous step)

files0[ino2] = mkfile(m2 * VFS_PAGE_SIZE + n0, md0, # links(ino2, dirs), content0), root.dir?, m2 * VFS_PAGE_SIZE + n0 < n, n0 < VFS_PAGE_SIZE, m1 * VFS_PAGE_SIZE + n1 < n, dom of < ino3, n1 < VFS_PAGE_SIZE, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files0), afs-cons(dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto (m2 * VFS_PAGE_SIZE + n0))]), fids-cons(root, abs-files(files0), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files0), of-cons(of, dirs, files0), of-cons(of, dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto (m2 * VFS_PAGE_SIZE + n0))]), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files0), ino2 ∈ files0, ROOT_INO ∈ dirs, m2 * VFS_PAGE_SIZE + n0 ≤ m1 * VFS_PAGE_SIZE + n1, psynced0 → asynced0 ⊦ zero = (m1 * VFS_PAGE_SIZE < m2 * VFS_PAGE_SIZE + n0 ∧ m1 ∈ content0 ⊃ content0[m1];zeropage)[n1], root[path].dir?, ino2 ∈ dirs, n0 ≠ 0 ∧ m2 ∈ content0

User applied rule case distinction

And obtained the following new goals

Proof step 256:
files0[ino2] = mkfile(m2 * VFS_PAGE_SIZE + n0, md0, # links(ino2, dirs), content0), root.dir?, n1 < VFS_PAGE_SIZE, dom of < ino3, m1 * VFS_PAGE_SIZE + n1 < n, n0 < VFS_PAGE_SIZE, m2 * VFS_PAGE_SIZE + n0 < n, m1 * VFS_PAGE_SIZE < m2 * VFS_PAGE_SIZE + n0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto (m2 * VFS_PAGE_SIZE + n0))]), afs-cons(dirs, files0), fids-cons(root, abs-files(files0), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files0), of-cons(of, dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto (m2 * VFS_PAGE_SIZE + n0))]), of-cons(of, dirs, files0), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files0), ROOT_INO ∈ dirs, ino2 ∈ files0, m1 ∈ content0, m2 * VFS_PAGE_SIZE + n0 ≤ m1 * VFS_PAGE_SIZE + n1, psynced0 → asynced0 ⊦ zero = content0[m1][n1], root[path].dir?, ino2 ∈ dirs, n0 ≠ 0 ∧ m2 ∈ content0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ n < VFS_PAGE_SIZE → (zeropage)[n] = zero; (s)