[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 40 from proof truncate-same-iso (previous step)

VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, files0[ino0] = mkfile(m2, md0, # links(ino0, dirs), content0), afs-cons(dirs, files0), m2 / VFS_PAGE_SIZE ∈ content0, ino0 ∈ files0, ino ∈ files0 ⊦ m2 % VFS_PAGE_SIZE = 0, files0[ino].size = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .size ∧ files0[ino].meta = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .meta ∧ files0[ino].nlink = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .nlink ∧ files0[ino].content.stream to files0[ino].size = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .content .stream to (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .size

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 41:
VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, files0[ino0] = mkfile(m2, md0, # links(ino0, dirs), content0), files0[ino] = mkfile(m, md, m0, content), afs-cons(dirs, files0), ino ∈ files0, ino0 ∈ files0, m2 / VFS_PAGE_SIZE ∈ content0 ⊦ m2 % VFS_PAGE_SIZE = 0, m = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .size ∧ md = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .meta ∧ m0 = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .nlink ∧ content.stream to m = (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .content .stream to (ino = ino0 ⊃ mkfile (m2, md0, # links(ino0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(content0[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .size

Rule argument

spec: abstract-file name: elim seq: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content) subst: [af, m, md, m0, content] → [files0[ino], m, md, m0, content]

Additional information

Used simplifier rules: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content); (elim) Used terms: files0[ino], m, md, m0, content