[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 980 from proof overwrite-write-page-clean (previous step)

files[ino] = mkfile(m2, md0, m3, content0), files[ino0] = mkfile(m4, md1, m5, content1), ino ∈ files, ino0 ∈ files, n ∈ content0[m, buf] ⊦ n ∈ content1 ⊕ mkcontent(ino0, pcache) ↔ n ∈ content1 ⊕ mkcontent(ino0, pcache[datakey(ino, m), mkpentry(false, buf)]), datakey(ino, n) = datakey(ino, m), ino0 = ino, datakey(ino, n) ∈ pcache, ino0 ∈ icache, ino ∈ icache, n ∈ content1

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 981:
⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1
Proof step 982:
files[ino0] = mkfile(m4, md1, m5, content1), files[ino] = mkfile(m2, md0, m3, content0), n ∈ content0[m, buf], ino0 ∈ files, ino ∈ files ⊦ n ∈ content1 ⊕ mkcontent(ino0, pcache) ↔ n ∈ content1 ∨ n ∈ mkcontent(ino0, pcache[datakey(ino, m), mkpentry(false, buf)]), datakey(ino, n) = datakey(ino, m), ino0 = ino, n ∈ content1, ino ∈ icache, ino0 ∈ icache, datakey(ino, n) ∈ pcache

Rule argument

spec: <toplevel> name: in-overwrite-content seq: ⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1 subst: [content1, content0, n] → [mkcontent (ino0, pcache[datakey(ino, m), mkpentry(false, buf)]), content1, n] flags: <all paths>

Additional information

Used terms: mkcontent(ino0, pcache[datakey(ino, m), mkpentry(false, buf)]), content1, n