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

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

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 262:
⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1
Proof step 263:
files[ino0] = mkfile(m2, md0, m3, content0), ino0 ∈ files, ino ∈ files ⊦ n ∈ content0 ⊕ mkcontent(ino0, pcache) ↔ n ∈ content0 ∨ n ∈ mkcontent(ino0, pcache[datakey(ino, m), mkpentry(true, buf)]), ino0 = ino, ino ∈ icache, ino0 ∈ icache

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(true, buf)]), content0, n] flags: <all paths>

Additional information

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