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

files0[m] = mkfile(m1, md, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), err = ESUCCESS, files = files0[m, mkfile(m1, md, # links(m, dirs), content0 upto m1)], ino = 0, ino0 = m0 + n0, ino1 = m0, inode = mkinode(m, md, false, # links(m, dirs), 0, m1), ¬ isdir, dom of < ino3, afs-cons(dirs, files0), of-cons(of, dirs, files0), fd ∈ of, m ∈ files0, n0 ≤ # buf0 ⊦ n0 = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW, m1 % VFS_PAGE_SIZE ≠ 0 ∧ m1 / VFS_PAGE_SIZE ∈ content0, of-cons(of, dirs, files) ∧ dom of < ino3 ∧ afs-cons(dirs, files)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 367:
⊦ of-cons(of0, dirs0, files0) → (of-cons(of1, dirs1, files1) ↔ (∀ n. (n ∈ of0 → of0[n].ino ∈ files0) → n ∈ of1 → of1[n].ino ∈ files1))
Proof step 368:
files0[m] = mkfile(m1, md, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), dom of < ino3, afs-cons(dirs, files0), of-cons(of, dirs, files0), of-cons(of, dirs, files0[m, mkfile(m1, md, # links(m, dirs), content0 upto m1)]), fd ∈ of, m ∈ files0, n0 ≤ # buf0 ⊦ n0 = 0, afs-cons(dirs, files0[m, mkfile(m1, md, # links(m, dirs), content0 upto m1)]), mode ≠ MODE_W ∧ mode ≠ MODE_RW, m1 % VFS_PAGE_SIZE ≠ 0 ∧ m1 / VFS_PAGE_SIZE ∈ content0

Rule argument

Additional information

Used simplifier rules: of-cons-reduce: ⊦ of-cons(of0, dirs0, files0) → ( of-cons(of1, dirs1, files1) ↔ (∀ n. (n ∈ of0 → of0[n].ino ∈ files0) → n ∈ of1 → of1[n].ino ∈ files1));% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)