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

files1 -- ino = files0 -- ino, files0[ino] = mkfile(m1, md1, n2, content0), files1[ino] = mkfile(m1, md1, # links(ino, dirs), content1), content0.stream from m1 = σ⊥, afs-cons(dirs, files1), ino ∈ files1, ino ∈ files0, n ≤ # buf, n1 ≤ # buf + n0, n0 + n ≤ n1 ⊦ n = 0, max(m1, n0 + n) = (m1 < n0 + n ⊃ n0 + n;m1) ∧ ( n3 < max(m1, n0 + n) → splice(buf, 0, (content0.stream to m1).buf, n0, n)[n3] = ((content0.stream to n0) + (⌜buf⌝ to n) + (content0.stream from n0 + n))[n3]), n0 + n ≤ # (content0.stream to m1).buf ∧ n ≠ 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 30:
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 < n1, m1 < n1, n3 < n0 + n, m1 < n0 + n, n3 < # buf + n0, m1 < # buf + n0, afs-cons(dirs, files1), ino ∈ files1, ino ∈ files0, n ≤ # buf, n1 ≤ # buf + n0, n0 + n ≤ n1 ⊦ splice(buf, 0, (content0.stream to m1).buf, n0, n)[n3] = ((content0.stream to n0) + (⌜buf⌝ to n) + (content0.stream from n0 + n))[n3], n = 0

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s)%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m + n = m + n0 ↔ n = n0; (s)% ⊦ n < m → max(n, m) = m; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)% ⊦ ⌜m⌝ .n = m; (s)%¬ # σ0 < ⌜n⌝ ⊦ #(σ0 to n) = ⌜n⌝ ; (s)% ⊦ ¬ ∞ < n∞; (s)% ⊦ # content.stream = ∞; (s)%finp(σ) ⊦ # σ.buf = (# σ).n; (s)% ⊦ finp(σ0 to m); (s)