[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 not-lessto-fin (conclusion) (back to tree)

n ≤ # al ⊦ ¬ # ⌜al⌝ ^ < # ⌜al to n⌝ ^

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof not-lessto-fin (previous step) (back to tree)

# ⌜al⌝ ^ < # ⌜al to n⌝ ^, n ≤ # al ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof not-lessto-fin (previous step) (back to tree)

# ⌜al⌝ ^ < # ⌜al to n⌝ ^, n ≤ # al ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: al

Additional information

Used simplifier rules: remtau-empty: ⊦ [] ^ = []; actionlist freely generated by [], +;; ⊦ # [] = 0; (s) ⊦ m ≤ 0 ↔ m = 0; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) ⊦ x to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s)

Proof step 4 from proof not-lessto-fin (previous step) (back to tree)

# ⌜a + al0⌝ ^ < # ⌜a + al0 to n⌝ ^, n ≤ #(a + al0), ∀ n. ¬(# ⌜al0⌝ ^ < # ⌜al0 to n⌝ ^ ∧ n ≤ # al0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-fin-append: ⊦ (⌜al⌝ + ⌜al2⌝ )^ = ⌜al⌝ ^ + ⌜al2⌝ ^; ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ #(σ + σ1) = # σ + # σ1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)

Proof step 5 from proof not-lessto-fin (previous step) (back to tree)

# ⌜a '⌝ ^ + # ⌜al0⌝ ^ < # ⌜a ' + al0 to n⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-one, seq: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ , subst:[a] → [a], <all paths>

Additional information

Used terms: a

Proof step 6 from proof not-lessto-fin (previous step) (back to tree)

⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝

Lemma remtau-one

Proof step 7 from proof not-lessto-fin (previous step) (back to tree)

a = τ, # ⌜a '⌝ ^ + # ⌜al0⌝ ^ < # ⌜a ' + al0 to n⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ # [] = ⌜0⌝ ; (s)

Proof step 8 from proof not-lessto-fin (previous step) (back to tree)

# ⌜al0⌝ ^ < # ⌜τ ' + al0 to n⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:append-to-gr, seq: ⊦ # x < n → x + y to n = x + (y to (n - # x)), subst:[n, y, x] → [n, al0, τ '], <all paths>

Additional information

Used simplifier rules: remtau-empty: ⊦ [] ^ = []; remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; ⊦ # a ' = 0 +1; (s) ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s) ⊦ 0 ≤ m; (s) ⊦ x to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ m ≤ m + n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a ' + y to 1 = a '; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ # [] = ⌜0⌝ ; (s) ⊦ ¬ n∞ < ⌜0⌝ ; (s) Used terms: n, al0, τ '

Proof step 9 from proof not-lessto-fin (previous step) (back to tree)

⊦ # x < n → x + y to n = x + (y to (n - # x))

A spec-lemma

Proof step 10 from proof not-lessto-fin (previous step) (back to tree)

# ⌜al0⌝ ^ < # ⌜τ ' + (al0 to (n - # τ '))⌝ ^, # τ ' < n, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-tau-lem: ⊦ (⌜τ '⌝ + α)^ = α ^; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s)

Proof step 11 from proof not-lessto-fin (previous step) (back to tree)

n ≠ 1, n ≠ 0, # ⌜al0⌝ ^ < # ⌜al0 to (n - 1)⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n, n1]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m

Proof step 12 from proof not-lessto-fin (previous step) (back to tree)

n = n1 + 1, n ≠ 1, n ≠ 0, # ⌜al0⌝ ^ < # ⌜al0 to n1⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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) ⊦ m + 1 ≠ 0; (s) ⊦ m + n = 1 ↔ m = 0 ∧ n = 1 ∨ n = 0 ∧ m = 1; (ws)

Proof step 13 from proof not-lessto-fin (previous step) (back to tree)

n1 ≠ 0, # ⌜al0⌝ ^ < # ⌜al0 to n1⌝ ^, n1 ≤ # al0, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: n1

Additional information

Used terms: n1

Proof step 14 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, # ⌜a '⌝ + # ⌜al0⌝ ^ < # ⌜a ' + al0 to n⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 15 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, ⌜1⌝ + # ⌜al0⌝ ^ < # ⌜a ' + al0 to n⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:append-to-le, seq: ⊦ n ≤ # x → x + y to n = x to n, subst:[n, y, x] → [n, al0, a '], <all paths>

Additional information

Used terms: n, al0, a '

Proof step 16 from proof not-lessto-fin (previous step) (back to tree)

⊦ n ≤ # x → x + y to n = x to n

A spec-lemma

Proof step 17 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, ⌜1⌝ + # ⌜al0⌝ ^ < # ⌜a ' + al0 to n⌝ ^, n ≤ # al0 + 1, ¬ n ≤ # a ', ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ # a ' = 0 +1; (s)

Proof step 18 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, n ≠ 0, n ≠ 1, ⌜1⌝ + # ⌜al0⌝ ^ < # ⌜a ' + al0 to n⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:append-to-gr, seq: ⊦ # x < n → x + y to n = x + (y to (n - # x)), subst:[n, y, x] → [n, al0, a '], <all paths>

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m ≠ 0 → (1 < m ↔ m ≠ 1); (ss) Used terms: n, al0, a '

Proof step 19 from proof not-lessto-fin (previous step) (back to tree)

⊦ # x < n → x + y to n = x + (y to (n - # x))

A spec-lemma

Proof step 20 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, n ≠ 0, n ≠ 1, ⌜1⌝ + # ⌜al0⌝ ^ < # ⌜a ' + (al0 to (n - # a '))⌝ ^, # a ' < n, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-nontau-lem: ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^; add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s) ⊦ m < n → n ≠ 0; (s)

Proof step 21 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, n ≠ 1, n ≠ 0, # ⌜al0⌝ ^ < # ⌜al0 to (n - 1)⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n, n1]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m

Proof step 22 from proof not-lessto-fin (previous step) (back to tree)

n = n1 + 1, a ≠ τ, n ≠ 1, n ≠ 0, # ⌜al0⌝ ^ < # ⌜al0 to n1⌝ ^, n ≤ # al0 + 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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) ⊦ m + 1 ≠ 0; (s) ⊦ m + n = 1 ↔ m = 0 ∧ n = 1 ∨ n = 0 ∧ m = 1; (ws)

Proof step 23 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, n1 ≠ 0, # ⌜al0⌝ ^ < # ⌜al0 to n1⌝ ^, n1 ≤ # al0, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: n1

Additional information

Used terms: n1

Proof step 24 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, ⌜1⌝ + # ⌜al0⌝ ^ < # ⌜a ' to n⌝ ^, n ≤ # al0 + 1, n ≤ # a ', ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s)

Proof step 25 from proof not-lessto-fin (previous step) (back to tree)

a ≠ τ, ⌜1⌝ + # ⌜al0⌝ ^ < # ⌜a ' to n⌝ ^, n ≤ # al0 + 1, n ≤ 1, ∀ n0. ¬ # ⌜al0⌝ ^ < # ⌜al0 to n0⌝ ^ ∨ ¬ n0 ≤ # al0 ⊦

User applied rule cut formula

And closed the goal!

Rule argument

fma: n = 1

Additional information

Used simplifier rules: remtau-one: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; remtau-empty: ⊦ [] ^ = []; ⊦ m ≠ n → (m ≤ n ↔ m < n); (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ 0 ≤ m; (s) ⊦ x to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ m < n → (⌜n⌝ + n∞ < ⌜m⌝ ↔ false); (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 ≤ m + n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a ' to 1 = a '; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ ↔ n∞2 < ⌜n - m⌝ ); (s) ⊦ ¬ n∞ < ⌜0⌝ ; (s) Used formulas: n = 1

Proof Tree for not-lessto-fin (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