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

fs0[ri0[inodekey(m)]] = inodenode(key0, md0, false, m1, 0, m4), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n0, md, m1, abs-content(m, fs0, ri0) upto m2)]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2])), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, m2 ≤ n0, asynced0 → boolvar0 ⊦ m2 % VFS_PAGE_SIZE = 0, abs-files(fs0, ri0)[m, mkfile(n0, md, m1, abs-content(m, fs0, ri0) upto m2)] = abs-files (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m1, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[inodekey(m), adr2])), adr1 = adr2, m = 0, buf-opt0.some?, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0

Proof step 979 used as proof-lemma