[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 1 from proof square-interval-01 (conclusion) (back to tree)

r * (r + 1.r) ≤ r0 * (r0 + 1.r) + r2 + r2, r0 * (r0 + 1.r) + r2 + r2 < (r + 1.r) * (r + 1.r + 1.r), r2 ≤ r0, 0.r ≤ r, 0.r ≤ r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof square-interval-01 (previous step) (back to tree)

r0 * (r0 + 1.r) + r2 + r2 < (r + 1.r) * (r + 1.r + 1.r), 0.r ≤ r2, 0.r ≤ r, r2 ≤ r0, r * (r + 1.r) ≤ r0 * (r0 + 1.r) + r2 + r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: distr: ⊦ r * (r0 + r1) = r * r0 + r * r1; mult-one: ⊦ 1.r * r = r; mult-ass: ⊦ (r * r0) * r1 = r * r0 * r1; mult-com: ⊦ r * r0 = r0 * r; add-comm: ⊦ r + r0 = r0 + r; from specification real-basic add-assoc: ⊦ (r + r0) + r1 = r + r0 + r1; from specification real-basic ⊦ r < r + r0 ↔ 0.r < r0; (s) ⊦ r + r0 < r + r1 ↔ r0 < r1; (s) forward-lels: ⊦ r ≤ r0 ∧ r0 < r1 → r < r1; (forward) from specification real-abs forward-lele: ⊦ r ≤ r0 ∧ r0 ≤ r1 → r ≤ r1; (forward) from specification real-abs add-c: ⊦ i + j = j + i; from specification int-basic2 add-a: ⊦ i + j + i0 = (i + j) + i0; from specification int-basic2 ⊦ (* i).r + (* j).r = (i + j).r; (s)

Proof step 3 from proof square-interval-01 (previous step) (back to tree)

(r0 * r0 + r0) + r2 + r2 < (r * 2.r + r * r) + 2.r + r, 0.r < r * 2.r + 2.r, 0.r ≤ r2, 0.r ≤ r, r2 ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, 0.r ≤ r0 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:square-interval, seq:r * (r + 1.r) ≤ r0 * (r0 + 1.r) + 2.r * r2, r0 * (r0 + 1.r) + 2.r * r2 < (r + 1.r) * (r + 2.r), r2 ≤ r0, 0.r ≤ r, 0.r ≤ r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r, subst:[r, r0, r2] → [r, r0, r2]

Additional information

Used terms: r, r0, r2

Proof step 4 from proof square-interval-01 (previous step) (back to tree)

r * (r + 1.r) ≤ r0 * (r0 + 1.r) + 2.r * r2, r0 * (r0 + 1.r) + 2.r * r2 < (r + 1.r) * (r + 2.r), r2 ≤ r0, 0.r ≤ r, 0.r ≤ r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

Lemma square-interval

Proof step 5 from proof square-interval-01 (previous step) (back to tree)

0.r < r * 2.r + 2.r, (r0 * r0 + r0) + r2 + r2 < (r * 2.r + r * r) + 2.r + r, 0.r ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, r2 ≤ r0, 0.r ≤ r, 0.r ≤ r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r, r * (r + 1.r) ≤ r0 * (r0 + 1.r) + 2.r * r2 ∧ r0 * (r0 + 1.r) + 2.r * r2 < (r + 1.r) * (r + 2.r)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: distr: ⊦ r * (r0 + r1) = r * r0 + r * r1; mult-one: ⊦ 1.r * r = r; mult-ass: ⊦ (r * r0) * r1 = r * r0 * r1; mult-com: ⊦ r * r0 = r0 * r; add-comm: ⊦ r + r0 = r0 + r; from specification real-basic add-assoc: ⊦ (r + r0) + r1 = r + r0 + r1; from specification real-basic

Proof step 6 from proof square-interval-01 (previous step) (back to tree)

(r0 * r0 + r0) + r2 + r2 < (r * 2.r + r * r) + 2.r + r, 0.r < r * 2.r + 2.r, 0.r ≤ r2, 0.r ≤ r, r2 ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, 0.r ≤ r0 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r, r * r + r ≤ (r0 * r0 + r0) + 2.r * r2 ∧ (r0 * r0 + r0) + 2.r * r2 < (r * r + r * 2.r) + r + 2.r

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Proof step 7 from proof square-interval-01 (previous step) (back to tree)

0.r < r * 2.r + 2.r, (r0 * r0 + r0) + r2 + r2 < (r * 2.r + r * r) + 2.r + r, 0.r ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, r2 ≤ r0, 0.r ≤ r, 0.r ≤ r2, ¬ r * r + r ≤ (r0 * r0 + r0) + 2.r * r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: two-def, seq: ⊦ 2.r = 1.r + 1.r, subst:, <all paths>

Additional information

Used terms:

Proof step 8 from proof square-interval-01 (previous step) (back to tree)

⊦ 2.r = 1.r + 1.r

Lemma two-def

Proof step 9 from proof square-interval-01 (previous step) (back to tree)

(r0 * r0 + r0) + r2 + r2 < (r * (1.r + 1.r) + r * r) + (1.r + 1.r) + r, 0.r < r * (1.r + 1.r) + 1.r + 1.r, 0.r ≤ r2, 0.r ≤ r, r2 ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, 0.r ≤ r0, ¬ r * r + r ≤ (r0 * r0 + r0) + (1.r + 1.r) * r2 ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: distr, seq: ⊦ r * (r0 + r1) = r * r0 + r * r1, subst:[r0, r1, r] → [1.r, 1.r, r2], <all paths>

Additional information

Used simplifier rules: mult-com: ⊦ r * r0 = r0 * r; mult-one: ⊦ 1.r * r = r; mult-ass: ⊦ (r * r0) * r1 = r * r0 * r1; mult-com: ⊦ r * r0 = r0 * r; ⊦ (* i).r + (* j).r = (i + j).r; (s) add-a: ⊦ i + j + i0 = (i + j) + i0; from specification int-basic2 add-c: ⊦ i + j = j + i; from specification int-basic2 add-comm: ⊦ r + r0 = r0 + r; from specification real-basic add-assoc: ⊦ (r + r0) + r1 = r + r0 + r1; from specification real-basic ⊦ r ≤ r0 ↔ ¬ r0 < r; (ss) ⊦ r ≤ r0 → ¬ r0 < r; (s) Used terms: 1.r, 1.r, r2

Proof step 10 from proof square-interval-01 (previous step) (back to tree)

⊦ r * (r0 + r1) = r * r0 + r * r1

Lemma distr

Proof step 11 from proof square-interval-01 (previous step) (back to tree)

0.r < r * 2.r + 2.r, (r0 * r0 + r0) + r2 + r2 < (r * 2.r + r * r) + 2.r + r, 0.r ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, r2 ≤ r0, 0.r ≤ r, 0.r ≤ r2, ¬ (r0 * r0 + r0) + 2.r * r2 < (r * r + r * 2.r) + r + 2.r ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: two-def, seq: ⊦ 2.r = 1.r + 1.r, subst:, <all paths>

Additional information

Used terms:

Proof step 12 from proof square-interval-01 (previous step) (back to tree)

⊦ 2.r = 1.r + 1.r

Lemma two-def

Proof step 13 from proof square-interval-01 (previous step) (back to tree)

(r0 * r0 + r0) + r2 + r2 < (r * (1.r + 1.r) + r * r) + (1.r + 1.r) + r, 0.r < r * (1.r + 1.r) + 1.r + 1.r, 0.r ≤ r2, 0.r ≤ r, r2 ≤ r0, r * r + r ≤ (r0 * r0 + r0) + r2 + r2, 0.r ≤ r0, ¬ (r0 * r0 + r0) + (1.r + 1.r) * r2 < (r * r + r * (1.r + 1.r)) + r + 1.r + 1.r ⊦ r < r0 + 1.r ∧ r0 < r + 1.r

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: distr, seq: ⊦ r * (r0 + r1) = r * r0 + r * r1, subst:[r0, r1, r] → [1.r, 1.r, r2], <all paths>

Additional information

Used simplifier rules: mult-com: ⊦ r * r0 = r0 * r; mult-one: ⊦ 1.r * r = r; mult-ass: ⊦ (r * r0) * r1 = r * r0 * r1; mult-com: ⊦ r * r0 = r0 * r; ⊦ (* i).r + (* j).r = (i + j).r; (s) add-a: ⊦ i + j + i0 = (i + j) + i0; from specification int-basic2 add-c: ⊦ i + j = j + i; from specification int-basic2 add-comm: ⊦ r + r0 = r0 + r; from specification real-basic add-assoc: ⊦ (r + r0) + r1 = r + r0 + r1; from specification real-basic ⊦ r < r0 ↔ ¬ r0 ≤ r; (ss) ⊦ r < r0 → (r0 ≤ r ↔ false); (as) Used terms: 1.r, 1.r, r2

Proof step 14 from proof square-interval-01 (previous step) (back to tree)

⊦ r * (r0 + r1) = r * r0 + r * r1

Lemma distr

Proof Tree for square-interval-01 (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree