[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 13 from proof inv-renam (previous step)

err = ESUCCESS, err0 = err1, root.dir?, fids-cons(root, fs, ofh), pre-renam(path, path', err, user, root, fs, ofh) ⊦ ⟪let tree0 = root[path], psynced0 = path' ∈ root, tree = root[path'] in {root := (root -- path)[path', tree0]; if psynced0 ∧ ¬ tree.dir? ∧ ¬ tree.fid ∈ ofh.fids ∧ ¬ tree.fid ∈ root.fids then fs := fs -- tree.fid}; psynced := ?⟫ true

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Proof step 14:
psynced0 ↔ path' ∈ root, err = ESUCCESS, err0 = err1, tree = root[path'], tree0 = root[path], root.dir?, fids-cons(root, fs, ofh), pre-renam(path, path', err, user, root, fs, ofh) ⊦ ⟪root := (root -- path)[path', tree0]; if psynced0 ∧ ¬ tree.dir? ∧ ¬ tree.fid ∈ ofh.fids ∧ ¬ tree.fid ∈ root.fids then fs := fs -- tree.fid; psynced := ?⟫ true

Proof step 13 from proof inv-renam (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information