| # 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), # links(ino1, dirs0) ≠ 0, entries0 ≠ ∅, ino1 ≠ ROOT_INO, links(ino1, dirs0) ≠ ∅, m ≠ 0, root0[q].dir?, root0.dir?, dom of < ino0, abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0, ROOT_INO)(dirs0), abs(root0 -- (q + str '), 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)), 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, ⌜ino⌝ ∈ (root0 -- (q + str ')).fids, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], ¬ root0[q + str '].dir?, ¬ is-open(entries0[str], of), ¬ ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids, ¬ entries0[str] ∈ dirs0, ¬ ino1 ∈ dirs1, ¬ entries0[str] ∈ dirs1, ¬ ino ∈ files0, psynced → asynced0 ⊦ ⟨psynced := ?⟩ ( (root0 -- (q + str ')).dir? ∧ fids-cons(root0 -- (q + str '), abs-files(files0 -- entries0[str]), abs-of(of)) → abs-files(files0 -- entries0[str]) = abs-files(files0) ∧ (psynced → asynced)) |
⊦ ⌜n⌝ ∈ tree.fids ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) → n ∈ files
Used simplifier rules: fid-file: ⊦ ⌜n⌝ ∈ tree.fids ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) → n ∈ files;% ⊦ ino ∈ files -- ino0 ↔ ino ≠ ino0 ∧ ino ∈ files; (s)