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

files[m] = mkfile(m1, md, # links(m, dirs), content), of[fd] = mkfile(m, mode, m0), dom of < ino2, afs-cons(dirs, files), of-cons(of, dirs, files), m ∈ files, fd ∈ of, m0 ≤ m1, n ≤ # buf ⊦ ⟪if ino ≠ 0 then err0 := ESUCCESS; of[fd].pos := of[fd].pos + ino; n := ino⟫ (of-cons(of, dirs, files) ∧ dom of < ino2), mode ≠ MODE_R ∧ mode ≠ MODE_RW

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 32:
of[fd] = mkfile(m, mode, m0), files[m] = mkfile(m1, md, # links(m, dirs), content), dom of < ino2, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of, m ∈ files, n ≤ # buf, m0 ≤ m1 ⊦ ⟪err0 := ESUCCESS; of[fd].pos := of[fd].pos + ino; n := ino⟫ (of-cons(of, dirs, files) ∧ dom of < ino2), ino = 0, mode ≠ MODE_R ∧ mode ≠ MODE_RW
Proof step 40:
of[fd] = mkfile(m, mode, m0), files[m] = mkfile(m1, md, # links(m, dirs), content), ino = 0, dom of < ino2, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of, m ∈ files, n ≤ # buf, m0 ≤ m1 ⊦ ⟪skip; of[fd].pos := of[fd].pos + ino; n := ino⟫ (of-cons(of, dirs, files) ∧ dom of < ino2), mode ≠ MODE_R ∧ mode ≠ MODE_RW

Rule argument

pos: right 1

Proof step 31 from proof inv-read (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information