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

# links(ino, dirs) = m0, files1[ino] = mkfile(m, md0, # links(ino, dirs), content), buf-opt = none, files2 = files1, inode = mkinode(ino, md0, false, # links(ino, dirs), 0, m), afs-cons(dirs, files1), ino ∈ files1 ⊦ [afs_truncate#(m, m / VFS_PAGE_SIZE; buf-opt, inode, bv, err, dirs, files1, asynced)] ( files2 ~ files1 ∧ (⌊err⌋ ∨ err = ESUCCESS) → afs-cons(dirs, files1) → (err = ESUCCESS ⊃ files1[ino].content.stream from m = σ⊥ ∧ (∀ n0, n1, buf. n1 ≤ # buf → write-inv(n0, n0 + n1, mkinode(ino, md0, false, m0, 0, m), buf, 0, dirs, files1, files1)) ∧ files2 -- ino = files1 -- ino ;⌊err⌋ ) ∧ inode = mkinode(ino, md0, false, m0, 0, m))

User applied rule split right

And obtained the following new goals

Proof step 16:
⟨afs_truncate#(m, m / VFS_PAGE_SIZE; buf-opt, inode, bv, err, dirs, files1, asynced)⟩ (buf-opt = buf-opt0 ∧ inode = inode0 ∧ (bv ↔ bv0) ∧ err = err0 ∧ dirs = dirs0 ∧ files1 = files ∧ (asynced ↔ asynced0)), # links(ino, dirs) = m0, files1[ino] = mkfile(m, md0, # links(ino, dirs), content), buf-opt = none, files2 = files1, inode = mkinode(ino, md0, false, # links(ino, dirs), 0, m), afs-cons(dirs0, files), afs-cons(dirs, files1), files2 ~ files, ino ∈ files1, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ (err0 = ESUCCESS ⊃ files[ino].content.stream from m = σ⊥ ∧ (∀ n0, n1, buf. n1 ≤ # buf → write-inv(n0, n0 + n1, mkinode(ino, md0, false, m0, 0, m), buf, 0, dirs0, files, files)) ∧ files2 -- ino = files -- ino ;⌊err0⌋ ) ∧ inode0 = mkinode(ino, md0, false, m0, 0, m)

Rule argument

pos: right 1

Proof step 15 from proof truncate-inv (previous step)

User applied rule split right

And obtained the following new goals

Rule argument

Additional information