[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 642 from proof fsync-pages-keep-abs (previous step)

# buf = VFS_PAGE_SIZE, content[n0] = content1[n0], files1[m] = mkfile(m9, md2, m10, content1), files0[m] = mkfile(m0, md, m1, content), icache[m] = mkientry(boolvar, mkinode(m3, md0, false, m4, m5, m6)), pcache[datakey(m, n)] = mkpentry(true, buf), n * VFS_PAGE_SIZE < m2, pcache-cons(pcache0, dirs, files1), m ∈ icache, m ∈ files0, datakey(m, n) ∈ pcache, m ∈ files1, n0 ∈ content1, n0 ∈ content, ⌊err0⌋ ⊦ content1[n0] = (content[n, buf] ⊕ mkcontent(m, pcache))[n0], datakey(m, n0) ∈ pcache, datakey(m, n0) ∈ pcache0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 643:
⊦ n ∈ content1 → (content0 ⊕ content1)[n] = content1[n]
Proof step 644:
# buf = VFS_PAGE_SIZE, pcache[datakey(m, n)] = mkpentry(true, buf), icache[m] = mkientry(boolvar, mkinode(m3, md0, false, m4, m5, m6)), files0[m] = mkfile(m0, md, m1, content), files1[m] = mkfile(m9, md2, m10, content1), content[n0] = content1[n0], n * VFS_PAGE_SIZE < m2, pcache-cons(pcache0, dirs, files1), n0 ∈ content, n0 ∈ content1, m ∈ files1, datakey(m, n) ∈ pcache, m ∈ files0, m ∈ icache, ⌊err0⌋ ⊦ content1[n0] = (content[n, buf] ⊕ mkcontent(m, pcache))[n0], datakey(m, n0) ∈ pcache0, datakey(m, n0) ∈ pcache, n0 ∈ mkcontent(m, pcache)

Rule argument

spec: cache-base name: at-overwrite-content-new seq: ⊦ n ∈ content1 → (content0 ⊕ content1)[n] = content1[n] subst: [n, content1, content0] → [n0, mkcontent(m, pcache), content[n, buf]] flags: <all paths>

Additional information

Used simplifier rules: ⊦ mkcontent(ino, pcache)[n] = pcache[datakey(ino, n)].page; (s)% ⊦ ¬ key ∈ pcache → pcache[key] = (∅)[key]; (s)% ⊦ n ∈ mkcontent(ino, pcache) ↔ datakey(ino, n) ∈ pcache; (s) Used terms: n0, mkcontent(m, pcache), content[n, buf]