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

isdir2 ↔ true, isdir ↔ p_inode.directory, dirs[ino1] = mkdir(m, md, # links(ino1, dirs), m1, entries), err = ESUCCESS, err0 = ESUCCESS, ino = mkdentry(str, entries[str]).ino, inode = p_inode0, isdir, p_inode = getinode(ino, dirs, files), mkdentry(str, entries[str]).dentry?, dom of < ino0, afs-cons(dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), pre-iget(ino, dirs, files), pw(user, md), px(user, md), px-parent(user, q, ROOT_INO, dirs, files), str ∈ entries, ino1 ∈ dirs, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟪if p_inode.size ≠ 0 then err := ENOTEMPTY; isdir1 := true; isdir0 := isdir; if isdir1 ∧ ¬ isdir0 then err := ENOTDIR; if ¬ isdir1 ∧ isdir0 then err := EISDIR; if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {inode := (ino1 ∈ dirs ⊃ mkinode(ino1, md, true, # links(ino1, dirs), m1, m) ;mkinode(ino1, files[ino1].meta, false, files[ino1].nlink, 0, files[ino1].size) ); dent := mkdentry(str, dirs[ino1].entries[str]); afs_rmdir#(; inode, p_inode, dent, err, dirs, files; asynced); vfs_put_inode#(p_inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), p_inode.ino = ROOT_INO

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information