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

n0 + n = m0 * VFS_PAGE_SIZE + n2, files1 -- ino = files0 -- ino, VFS_PAGE_SIZE = n4 + n2 + m, files0[ino] = mkfile(m2, md0, m4, content), files1[ino] = mkfile(m2, md0, # links(ino, dirs), content0), afs-cons(dirs, files1), ino ∈ files0, ino ∈ files1, m0 * VFS_PAGE_SIZE ≤ # buf + n0, n0 + n ≤ n1, n1 ≤ # buf + n0, n ≤ # buf, n + m ≤ # buf, m0 * VFS_PAGE_SIZE ≤ n1 ⊦ ((content.stream to n0) + (⌜buf⌝ to n) to m0 * VFS_PAGE_SIZE) + (((content.stream to n0) + (⌜buf⌝ to n) to n0 + n) from m0 * VFS_PAGE_SIZE) + ((⌜buf⌝ from n) to m) = (content.stream to n0) + (⌜buf⌝ to n + m), n4 + m = 0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 92:
⊦ m ≤ n ∧ ¬ # σ0 < ⌜n⌝ → (σ0 to n) from m = (σ0 from m) to (n - m)
Proof step 93:
n0 + n = m0 * VFS_PAGE_SIZE + n2, files1 -- ino = files0 -- ino, VFS_PAGE_SIZE = n4 + n2 + m, files1[ino] = mkfile(m2, md0, # links(ino, dirs), content0), files0[ino] = mkfile(m2, md0, m4, content), afs-cons(dirs, files1), ino ∈ files1, ino ∈ files0, m0 * VFS_PAGE_SIZE ≤ n1, n + m ≤ # buf, n ≤ # buf, n1 ≤ # buf + n0, n0 + n ≤ n1, m0 * VFS_PAGE_SIZE ≤ # buf + n0, m0 * VFS_PAGE_SIZE ≤ n0 + n ⊦ n4 + m = 0, ((content.stream to n0) + (⌜buf⌝ to n) to m0 * VFS_PAGE_SIZE) + (((content.stream to n0) + (⌜buf⌝ to n) from m0 * VFS_PAGE_SIZE) to (n0 + n - m0 * VFS_PAGE_SIZE)) + ((⌜buf⌝ from n) to m) = (content.stream to n0) + (⌜buf⌝ to n + m), #((content.stream to n0) + (⌜buf⌝ to n)) < ⌜n0 + n⌝

Rule argument

spec: stream, inst: buffer-inf name: swap-to-from seq: ⊦ m ≤ n ∧ ¬ # σ0 < ⌜n⌝ → (σ0 to n) from m = (σ0 from m) to (n - m) subst: [m, n, σ0] → [m0 * VFS_PAGE_SIZE, n0 + n, (content.stream to n0) + (⌜buf⌝ to n)] flags: <all paths>

Additional information

Used simplifier rules: ⊦ #(σ0 + σ2) = # σ0 + # σ2; (s)% ⊦ # content.stream = ∞; (s)% ⊦ ¬ ∞ < n∞; (s)%¬ # σ0 < ⌜n⌝ ⊦ #(σ0 to n) = ⌜n⌝ ; (s)% ⊦ # ⌜buf⌝ = ⌜# buf⌝ ; (s)% ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)% ⊦ m ≤ n → (n < m ↔ false); (s)%append-assoc: ⊦ (σ0 + σ3) + σ4 = σ0 + σ3 + σ4; from specification stream[buffer-inf]% ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ + ⌜n1⌝ ↔ n + m < n0 + n1; (s)% ⊦ m + n < m + n0 ↔ n < n0; (s)% ⊦ ¬ n < n; (s)%add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf%add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf% ⊦ m ≤ n ↔ ¬ n < m; (ss)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat% ⊦ m0 * m = 0 ↔ m0 = 0 ∨ m = 0; (ws)% ⊦ VFS_PAGE_SIZE ≠ 0; (s)%mult-a: ⊦ m0 * m * n = (m0 * m) * n; from specification nat-mult%mult-c: ⊦ m * n = n * m; from specification nat-mult% ⊦ ¬ m + n < m; (s) Used terms: m0 * VFS_PAGE_SIZE, n0 + n, (content.stream to n0) + (⌜buf⌝ to n)