| # entries0 = m0 + 1, # links(entries0[str], dirs0) = m + 1, files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), (root0 -- (q + str ')).dir?, root0.dir?, root0[q].dir?, dom of < ino0, abs(root0, ROOT_INO)(dirs0), abs(root0 -- (q + str '), ROOT_INO)(dirs1), afs-cons(dirs1, files0[entries0[str], mkfile(m1, md1, m, content0)]), afs-cons(dirs0, files0), fids-cons(root0 -- (q + str '), abs-files(files0 -- entries0[str]), abs-of(of)), fids-cons(root0, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs1, files0[entries0[str], mkfile(m1, md1, m, content0)]), of-cons(of, dirs0, files0), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, entries0[str] ∈ files0, ino1 ∈ dirs0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ abs-files(files0 -- entries0[str]) = abs-files(files0), entries0 = ∅, m = 0, root0[q + str '].dir?, is-open(entries0[str], of), ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids, entries0[str] ∈ dirs1, entries0[str] ∈ dirs0 |
∀ ino. ¬ ino ∈ files ∨ ¬ ino ∈ dirs, ∀ ino. ⌜ino⌝ ∈ tree.fids → ino ∈ files, abs(tree, ino0)(dirs), ino1 ∈ files, ino0 ∈ dirs ⊦ ⌜ino1⌝ ∈ tree.fids ↔ links(ino1, dirs) ≠ ∅
# links(entries0[str], dirs0) = m + 1, # entries0 = m0 + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), root0[q].dir?, root0.dir?, (root0 -- (q + str ')).dir?, dom of < ino0, abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0, ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files0[entries0[str], mkfile(m1, md1, m, content0)]), fids-cons(root0, abs-files(files0), abs-of(of)), fids-cons(root0 -- (q + str '), abs-files(files0 -- entries0[str]), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs1, files0[entries0[str], mkfile(m1, md1, m, content0)]), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), ino1 ∈ dirs0, entries0[str] ∈ files0, str ∈ entries0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ abs-files(files0 -- entries0[str]) = abs-files(files0), entries0 = ∅, m = 0, root0[q + str '].dir?, is-open(entries0[str], of), entries0[str] ∈ dirs0, entries0[str] ∈ dirs1, ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids, (∀ ino. ¬ ino ∈ files0 ∨ ¬ ino ∈ dirs1) ∧ (∀ ino. ⌜ino⌝ ∈ (root0 -- (q + str ')).fids → ino ∈ files0) ∧ abs(root0 -- (q + str '), ROOT_INO)(dirs1) ∧ entries0[str] ∈ files0 ∧ ROOT_INO ∈ dirs1
Used simplifier rules: ⊦ afs-cons(dirs, files) → ( links(ino, dirs) = ∅ ↔ (ino ∈ dirs → dirs[ino].nlink = 0) ∧ (ino ∈ files → files[ino].nlink = 0)); (ws)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s) Used terms: files0, dirs1, ROOT_INO, root0 -- (q + str '), entries0[str]