[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 46 from proof write-inv-post (previous step)

files1 -- ino = files0 -- ino, files1[ino] = mkfile(m1, md1, # links(ino, dirs), content1), files0[ino] = mkfile(m1, md1, n2, content0), n3 < n0 + n, m1 < # buf + n0, n3 < # buf + n0, m1 < n1, n3 < n1, n3 < n0, m1 < n0 + n, m1 < n0, afs-cons(dirs, files1), ino ∈ files0, ino ∈ files1, m1 ≤ n3, n0 + n ≤ n1, n1 ≤ # buf + n0, n ≤ # buf, ∀ n4. (content0.stream from m1)[n4] = zero ⊦ n = 0, zero = getbyte(n3, content0)

User applied rule all left

And obtained the following new goals

Proof step 47:
files1 -- ino = files0 -- ino, files0[ino] = mkfile(m1, md1, n2, content0), files1[ino] = mkfile(m1, md1, # links(ino, dirs), content1), (content0.stream from m1)[n3 - m1] = zero, m1 < n0, m1 < n0 + n, n3 < n0, n3 < n1, m1 < n1, n3 < # buf + n0, m1 < # buf + n0, n3 < n0 + n, afs-cons(dirs, files1), ino ∈ files1, ino ∈ files0, n ≤ # buf, n1 ≤ # buf + n0, n0 + n ≤ n1, m1 ≤ n3 ⊦ n = 0, zero = getbyte(n3, content0)

Rule argument

pos: left 19 terms: n3 - m1 abort: F discard: T computed: F

Additional information

Used terms: n3 - m1