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

# buf0 = n4 + n0 + n1, # σ = ∞, VFS_PAGE_SIZE = n5 + n0 + n1, ((m0 =>mkfile(n2, md, m1, σ) * F))(files), afs-cons(dirs, files), m0 ∈ files, n0 + n1 ≤ VFS_PAGE_SIZE, n0 ≤ VFS_PAGE_SIZE, n0 + n1 ≤ # buf0, m + n1 ≤ # buf1 ⊦ #((⌜buf1⌝ from m) to n1) = ∞, σ from VFS_PAGE_SIZE * n3 + VFS_PAGE_SIZE = σ from n3 * VFS_PAGE_SIZE + n0 + n1 from n5

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 59:
⊦ ¬ # σ0 < ⌜m + n⌝ → σ0 from m from n = σ0 from m + n
Proof step 60:
# σ = ∞, # buf0 = n4 + n0 + n1, VFS_PAGE_SIZE = n5 + n0 + n1, ((m0 =>mkfile(n2, md, m1, σ) * F))(files), afs-cons(dirs, files), m0 ∈ files, m + n1 ≤ # buf1, n0 + n1 ≤ # buf0, n0 ≤ VFS_PAGE_SIZE, n0 + n1 ≤ VFS_PAGE_SIZE ⊦ #((⌜buf1⌝ from m) to n1) = ∞, σ from VFS_PAGE_SIZE * n3 + VFS_PAGE_SIZE = σ from (n3 * VFS_PAGE_SIZE + n0 + n1) + n5, # σ < ⌜(n3 * VFS_PAGE_SIZE + n0 + n1) + n5⌝

Rule argument

spec: stream, inst: buffer-inf name: from-from seq: ⊦ ¬ # σ0 < ⌜m + n⌝ → σ0 from m from n = σ0 from m + n subst: [n, m, σ0] → [n5, n3 * VFS_PAGE_SIZE + n0 + n1, σ] flags: <all paths>

Additional information

Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ ¬ ∞ < n∞; (s) Used terms: n5, n3 * VFS_PAGE_SIZE + n0 + n1, σ