[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 23 from proof writepage-prepost (previous step)

# buf = VFS_PAGE_SIZE, ((m0 =>mkfile(n0, md, m, σ) * F))(files), afs-cons(dirs, files), m0 ∈ files ⊦ [fail#(; ; err); asynced := ?] ( err = ESUCCESS ∧ ((m0 =>mkfile(n0, md, m, (σ to n * VFS_PAGE_SIZE) + ⌜buf⌝ + (σ from VFS_PAGE_SIZE * n + VFS_PAGE_SIZE)) * F))(files) ∨ ⌊err⌋ )

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 24:
# buf = VFS_PAGE_SIZE, ((m0 =>mkfile(n0, md, m, σ) * F))(files), afs-cons(dirs, files), m0 ∈ files ⊦ [choose err0 with ⌊err0⌋ in err := err0; asynced := ?] ( err = ESUCCESS ∧ ((m0 =>mkfile(n0, md, m, (σ to n * VFS_PAGE_SIZE) + ⌜buf⌝ + (σ from VFS_PAGE_SIZE * n + VFS_PAGE_SIZE)) * F))(files) ∨ ⌊err⌋ )

Rule argument

pos: right 1

Additional information

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