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

files[m] = mkfile(m0, md0, # links(m, dirs), content), fs = abs-files(files), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, m, dirs, files), of-cons(of, dirs, files), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files), ROOT_INO ∈ dirs, m ∈ files, ¬ root[path].dir?, ¬ m ∈ dirs, psynced → asynced0 ⊦ pw(user, path, root, fs) ∧ ⟨err0 := ESUCCESS; if err0 = ESUCCESS then if root[path].dir? then root[path].meta := md else let fid = root[path].fid in fs[fid] := mkfile(md, fs[fid].content); psynced := ?⟩ (fs = abs-files(files[m, mkfile(m0, md, # links(m, dirs), content)]) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ ESUCCESS = err0)

Heuristic dl case distinction applied rule case distinction

And obtained the following new goals

Proof step 98:
⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (pw(user, p, tree, abs-files(files)) ↔ pw(user, meta(ε, m, dirs, files)))
Proof step 99:
files[m] = mkfile(m0, md0, # links(m, dirs), content), fs = abs-files(files), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, m, dirs, files), of-cons(of, dirs, files), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files), m ∈ files, ROOT_INO ∈ dirs, psynced → asynced0 ⊦ ⟨err0 := ESUCCESS; if err0 = ESUCCESS then if root[path].dir? then root[path].meta := md else let fid = root[path].fid in fs[fid] := mkfile(md, fs[fid].content); psynced := ?⟩ (fs = abs-files(files[m, mkfile(m0, md, # links(m, dirs), content)]) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ ESUCCESS = err0), root[path].dir?, m ∈ dirs

Rule argument

pos: right 1

Additional information

Used simplifier rules: pw: ⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → ( pw(user, p, tree, abs-files(files)) ↔ pw(user, meta(ε, m, dirs, files)));%¬ ino ∈ dirs ⊦ ino ∈ files → meta(ε, ino, dirs, files) = files[ino].meta; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)