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

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

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 51:
⊦ n ∈ content ∧ # content[n] = VFS_PAGE_SIZE → ⌜content[n]⌝ = (content.stream from n * VFS_PAGE_SIZE) to VFS_PAGE_SIZE
Proof step 52:
# content0[m0] = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + n1, files1[ino0] = mkfile(m, md0, # links(ino0, dirs), content0), n1 < VFS_PAGE_SIZE, afs-cons(dirs, files1), ino0 ∈ files1, m0 ∈ content0 ⊦ [asynced := ?] ( ( (content0.stream to m0 * VFS_PAGE_SIZE) + (((content0.stream from m0 * VFS_PAGE_SIZE) to VFS_PAGE_SIZE to n1) + (σ⊥ to n0)) + (content0.stream from VFS_PAGE_SIZE * m0 + VFS_PAGE_SIZE) to VFS_PAGE_SIZE * m0 + VFS_PAGE_SIZE) + σ⊥ from m0 * VFS_PAGE_SIZE + n1 = σ⊥), n0 = 0, n1 = 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] → [m0, 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: m0, content0