| # kx = # ax, as ∩ ax.toSet = ∅, as ∩ log0.toSet = ∅, as ∩ range ri0[kx, ax] = ∅, ax.toSet ∩ log0.toSet = ∅, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax]), log-cons(log0, fs0), log-cons(ax, fs0[ax, fs0[ri0[kx]]] \ as), log-cons(log0, fs0[ax, fs0[ri0[kx]]] \ as), new(ax, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], orphans(fs0, ri0), fi, fo, log0 + ax), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[kx, ax]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons(fs0[ax, fs0[ri0[kx]]] \ as, ri0[kx, ax], orphans(fs0, ri0), fi, fo, log0 + ax), kx.toSet ⊆ dom ri0, asynced0 → boolvar0 ⊦ abs-dirs(fs0, ri0) = abs-dirs(fs0[ax, fs0[ri0[kx]]], ri0[kx, ax]), dups(kx), dups(ax) |
# ax = # kx ⊦ new(ax, fs) ∧ kx.toSet ⊆ dom ri ∧ ¬ dups(kx) ∧ ¬ dups(ax) ∧ ri-cons(ri, fs) → abs-dirs(fs[ax, fs[ri[kx]]], ri[kx, ax]) = abs-dirs(fs, ri)
Used simplifier rules: ⊦ dirs = abs-dirs(fs, ri) ↔ (∀ ino. ( ino ∈ dirs ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory) ∧ (ino ∈ dirs → dirs[ino] = abs-dir(ino, fs, ri))); (ss)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (s)%⊦ abs-dir(ino, fs, ri) = mkdir (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, fs[ri[inodekey(ino)]].nsubdirs, abs-children(ino, fs, ri)); (s)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ri-cons(ri, fs); (ss) Used terms: kx, ri0, ax, fs0