[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 218 from proof write-term (previous step)

files1[m] = mkfile(m3, md1, # links(m, dirs), content1), of[fd] = mkfile(m, mode, m0), files0[m] = mkfile(m2, md0, # links(m, dirs), content0), ino ≠ 0, n ≠ 0, m2 < m0 + ino, afs-cons(dirs, files0), afs-cons(dirs, files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)]), of-cons(of, dirs, files0), m ∈ files0, fd ∈ of, m ∈ files1, n ≤ # buf0 ⊦ ⟪fail#(; ; err); asynced := ?; if err ≠ ESUCCESS then ino := (m0 ≤ m2 ⊃ m2 - m0;0), err := ESUCCESS; of[fd].pos := m0 + ino⟫ true, m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0, mode ≠ MODE_W ∧ mode ≠ MODE_RW

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 219:
files0[m] = mkfile(m2, md0, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), files1[m] = mkfile(m3, md1, # links(m, dirs), content1), m2 < m0 + ino, afs-cons(dirs, files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)]), afs-cons(dirs, files0), of-cons(of, dirs, files0), m ∈ files1, fd ∈ of, m ∈ files0, n ≤ # buf0 ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; asynced := ?; if err ≠ ESUCCESS then ino := (m0 ≤ m2 ⊃ m2 - m0;0), err := ESUCCESS; of[fd].pos := m0 + ino⟫ true, ino = 0, n = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW, m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail#(; ; ERR){choose ERR0 with ⌊ERR0⌋ in ERR := ERR0};