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

of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of ⊦ ⟪{inode := getinode(ino, dirs, files); err := ESUCCESS} or fail#(; ; err); if err = ESUCCESS then n := inode.size + n; if err = ESUCCESS then of[fd].pos := n⟫ (of-cons(of, dirs, files) ∧ dom of < ino0)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 26:
of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of ⊦ ⟪inode := getinode(ino, dirs, files); err := ESUCCESS; if err = ESUCCESS then n := inode.size + n; if err = ESUCCESS then of[fd].pos := n⟫ (of-cons(of, dirs, files) ∧ dom of < ino0)
Proof step 39:
of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, dom of < ino0, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of ⊦ ⟪fail#(; ; err); if err = ESUCCESS then n := inode.size + n; if err = ESUCCESS then of[fd].pos := n⟫ (of-cons(of, dirs, files) ∧ dom of < ino0)

Proof step 25 from proof inv-seek (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information