[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 8 from proof rename-root (previous step)

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

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 9:
psynced0 ↔ path' ∈ root0, err = ESUCCESS, err0 = err1, psynced0, root = (root0 -- path)[path', tree0], tree = root0[path'], tree0 = root0[path], root0.dir?, pre-renam(path, path', err, user, root0, fs, ofh) ⊦ [fs := fs -- tree.fid; psynced := ?] root.dir?, tree.dir?, tree.fid ∈ root.fids, tree.fid ∈ ofh.fids
Proof step 18:
psynced0 ↔ path' ∈ root0, err = ESUCCESS, err0 = err1, root = (root0 -- path)[path', tree0], tree = root0[path'], tree0 = root0[path], root0.dir?, pre-renam(path, path', err, user, root0, fs, ofh) ⊦ [skip; psynced := ?] root.dir?, psynced0 ∧ ¬ tree.dir? ∧ ¬ tree.fid ∈ ofh.fids ∧ ¬ tree.fid ∈ root.fids

Rule argument

pos: right 1

Proof step 8 from proof rename-root (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information