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

VFS_PAGE_SIZE = n0 + n2, files0[m0] = mkfile(m, md0, # links(m0, dirs), content0), n0 ≠ 0, n1 ≠ 0, n2 ≠ 0, n2 < VFS_PAGE_SIZE, afs-cons(dirs, files0), m0 ∈ files0, m1 ∈ content0 ⊦ [asynced := ?] ( ( (content0.stream to m1 * VFS_PAGE_SIZE) + ((⌜content0[m1]⌝ to n2) + (σ⊥ to n0)) + (content0.stream from VFS_PAGE_SIZE * m1 + VFS_PAGE_SIZE) to VFS_PAGE_SIZE * m1 + VFS_PAGE_SIZE) + σ⊥ to n1 + m1 * VFS_PAGE_SIZE + n2 = (content0.stream to m1 * VFS_PAGE_SIZE + n2) + (σ⊥ to n1))

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 53:
⊦ n ∈ content ∧ # content[n] = VFS_PAGE_SIZE → ⌜content[n]⌝ = (content.stream from n * VFS_PAGE_SIZE) to VFS_PAGE_SIZE
Proof step 54:
# content0[m1] = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + n2, files0[m0] = mkfile(m, md0, # links(m0, dirs), content0), n2 < VFS_PAGE_SIZE, afs-cons(dirs, files0), m0 ∈ files0, m1 ∈ content0 ⊦ [asynced := ?] ( ( (content0.stream to m1 * VFS_PAGE_SIZE) + (((content0.stream from m1 * VFS_PAGE_SIZE) to VFS_PAGE_SIZE to n2) + (σ⊥ to n0)) + (content0.stream from VFS_PAGE_SIZE * m1 + VFS_PAGE_SIZE) to VFS_PAGE_SIZE * m1 + VFS_PAGE_SIZE) + σ⊥ to n1 + m1 * VFS_PAGE_SIZE + n2 = (content0.stream to m1 * VFS_PAGE_SIZE + n2) + (σ⊥ to n1)), n0 = 0, n1 = 0, n2 = 0

Rule argument

spec: afs-stream name: at-content-stream seq: ⊦ n ∈ content ∧ # content[n] = VFS_PAGE_SIZE → ⌜content[n]⌝ = (content.stream from n * VFS_PAGE_SIZE) to VFS_PAGE_SIZE subst: [n, content] → [m1, content0] flags: <all paths>

Additional information

Used simplifier rules: ⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n0, content) ∧ n ∈ content → # content[n] = VFS_PAGE_SIZE; (s)% ⊦ #(content.stream from n) = ∞; (s)% ⊦ ⌜m⌝ < ∞; (s)% ⊦ # content.stream = ∞; (s) Used terms: m1, content0