[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 remtau-nottau-1 (conclusion) (back to tree)

⌜n⌝ < # α ^ ⊦ α ^[n] ≠ τ

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof remtau-nottau-1 (previous step) (back to tree)

α ^[n] = τ, ⌜n⌝ < # α ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof remtau-nottau-1 (previous step) (back to tree)

α ^[n] = τ, ⌜n⌝ < # α ^ ⊦

Heuristic structural induction applied rule structural induction

And obtained the following new goals

Rule argument

term: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 4 from proof remtau-nottau-1 (previous step) (back to tree)

⌜al⌝ ^[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 [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s)

Proof step 5 from proof remtau-nottau-1 (previous step) (back to tree)

⌜a + al0⌝ ^[n] = τ, ⌜n⌝ < # ⌜a + al0⌝ ^, ∀ n. ¬(⌜al0⌝ ^[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⌝ ^; 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) ⊦ a + x = a ' + x; (s)

Proof step 6 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[n] = τ, ⌜n⌝ < # ⌜a '⌝ ^ + # ⌜al0⌝ ^, ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 7 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[0] = τ, ⌜0⌝ < # ⌜a '⌝ ^ + # ⌜al0⌝ ^, ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜0⌝ < n∞ ↔ n∞ ≠ ⌜0⌝ ; (s)

Proof step 8 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[0] = τ, # ⌜a '⌝ ^ + # ⌜al0⌝ ^ ≠ ⌜0⌝ , ∀ n0. ⌜al0⌝ ^[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 simplifier rules: ⊦ (⌜a '⌝ + σ)[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: a

Proof step 9 from proof remtau-nottau-1 (previous step) (back to tree)

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

Lemma remtau-one

Proof step 10 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[0] = τ, a = τ, # ⌜a '⌝ ^ + # ⌜al0⌝ ^ ≠ ⌜0⌝ , ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; ⊦ # σ = ⌜0⌝ ↔ σ = []; (s) 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) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)

Proof step 11 from proof remtau-nottau-1 (previous step) (back to tree)

⌜al0⌝ ^[0] = τ, ⌜al0⌝ ^ ≠ [], ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^ ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: 0

Additional information

Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) Used terms: 0

Proof step 12 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[n0 +1] = τ, ⌜n0 +1⌝ < # ⌜a '⌝ ^ + # ⌜al0⌝ ^, ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^, ∀ a, al0. ¬((⌜a '⌝ ^ + ⌜al0⌝ ^)[n0] = τ ∧ ⌜n0⌝ < # ⌜a '⌝ ^ + # ⌜al0⌝ ^ ∧ (∀ n0. ⌜al0⌝ ^[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⌝ + ⌜n⌝ ; (s) ⊦ m +1 = m + 1; (s)

Proof step 13 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[n0 + 1] = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜a '⌝ ^ + # ⌜al0⌝ ^, ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^, ∀ a0, al. (⌜a0 '⌝ ^ + ⌜al⌝ ^)[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜a0 '⌝ ^ + # ⌜al⌝ ^ ∨ ¬(∀ n0. ⌜al⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al⌝ ^) ⊦

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 14 from proof remtau-nottau-1 (previous step) (back to tree)

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

Lemma remtau-one

Proof step 15 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ ^ + ⌜al0⌝ ^)[n0 + 1] = τ, a = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜a '⌝ ^ + # ⌜al0⌝ ^, ∀ a0, al. (⌜a0 '⌝ ^ + ⌜al⌝ ^)[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜a0 '⌝ ^ + # ⌜al⌝ ^ ∨ ¬(∀ n0. ⌜al⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al⌝ ^), ∀ n0. ⌜al0⌝ ^[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) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)

Proof step 16 from proof remtau-nottau-1 (previous step) (back to tree)

⌜al0⌝ ^[n0 + 1] = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜al0⌝ ^, ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^, ∀ a0, al. (⌜a0 '⌝ ^ + ⌜al⌝ ^)[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜a0 '⌝ ^ + # ⌜al⌝ ^ ∨ ¬(∀ n0. ⌜al⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al⌝ ^) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: n0 + 1

Additional information

Used simplifier rules: ⊦ ⌜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 Used terms: n0 + 1

Proof step 17 from proof remtau-nottau-1 (previous step) (back to tree)

(⌜a '⌝ + ⌜al0⌝ ^)[n0 + 1] = τ, a ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜a '⌝ + # ⌜al0⌝ ^, ∀ a0, al. (⌜a0 '⌝ ^ + ⌜al⌝ ^)[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜a0 '⌝ ^ + # ⌜al⌝ ^ ∨ ¬(∀ n0. ⌜al⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al⌝ ^), ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s)

Proof step 18 from proof remtau-nottau-1 (previous step) (back to tree)

⌜al0⌝ ^[n0] = τ, a ≠ τ, ⌜n0⌝ < # ⌜al0⌝ ^, ∀ n0. ⌜al0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al0⌝ ^, ∀ a0, al. (⌜a0 '⌝ ^ + ⌜al⌝ ^)[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜a0 '⌝ ^ + # ⌜al⌝ ^ ∨ ¬(∀ n0. ⌜al⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜al⌝ ^) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: n0

Additional information

Used terms: n0

Proof step 19 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n] = τ, ⌜n⌝ < # ⌜af⌝ ^ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 20 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜0⌝ < # ⌜af⌝ ^ ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. af(n) ≠ τ

Additional information

Used formulas: ∃ n. af(n) ≠ τ

Proof step 21 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜0⌝ < # ⌜af⌝ ^, ∃ n. af(n) ≠ τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)

Proof step 22 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n) ≠ τ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 23 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(0) ≠ τ ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Additional information

Used formulas: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Proof step 24 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝ , ⌜af⌝ ^ ≠ [], af(0) ≠ τ ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 2, flags: discard

Additional information

Used simplifier rules: remtau-nontau-lem: ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^; ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]

Proof step 25 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(0) ≠ τ, ⌜af⌝ ≠ af(0) + ⌜λ n. af(n + 1)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:cons-inf, seq: ⊦ a + ⌜nf⌝ = ⌜λ n. (n = 0 ⊃ a;nf(n -1))⌝ , subst:[a, nf] → [af(0), λ n. af(n + 1)], <all paths>

Additional information

Used terms: af(0), λ n. af(n + 1)

Proof step 26 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ a + ⌜nf⌝ = ⌜λ n. (n = 0 ⊃ a;nf(n -1))⌝

A spec-lemma

Proof step 27 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(0) ≠ τ, ⌜af⌝ ≠ ⌜λ n. (n = 0 ⊃ af(0);af(n -1 + 1))⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ n -1 = n - 1; (s)

Proof step 28 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(0) ≠ τ, af(n) ≠ (n = 0 ⊃ af(0);af((n - 1) + 1)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 29 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n) ≠ af((n - 1) + 1), af(0) ≠ τ, n ≠ 0 ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 30 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 +1) ≠ τ, ∀ af. ¬(⌜af⌝ ^[0] = τ ∧ ⌜af⌝ ^ ≠ [] ∧ af(n0) ≠ τ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s)

Proof step 31 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, ∀ af0. ⌜af0⌝ ^[0] ≠ τ ∨ ⌜af0⌝ ^ = [] ∨ af0(n0) = τ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: λ n. af(n + 1) abort: F discard: T computed: F

Additional information

Used terms: λ n. af(n + 1)

Proof step 32 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ∨ af(n0 + 1) = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 33 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Additional information

Used formulas: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Proof step 34 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝ , ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 2, flags: discard

Additional information

Proof step 35 from proof remtau-nottau-1 (previous step) (back to tree)

(af(0) + ⌜λ n. af(n + 1)⌝ )^[0] = τ, (af(0) + ⌜λ n. af(n + 1)⌝ )^ ≠ [], af(n0 + 1) ≠ τ, ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-nontau, seq: ⊦ a ≠ τ → (a + β)^ = a + β ^, subst:[a, β] → [af(0), ⌜λ n. af(n + 1)⌝ ], <all paths>

Additional information

Used simplifier rules: remtau-append: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s) Used terms: af(0), ⌜λ n. af(n + 1)⌝

Proof step 36 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ a ≠ τ → (a + β)^ = a + β ^

Lemma remtau-nontau

Proof step 37 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, ⌜af⌝ ≠ af(0) + ⌜λ n. af(n + 1)⌝ , ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:cons-inf, seq: ⊦ a + ⌜nf⌝ = ⌜λ n. (n = 0 ⊃ a;nf(n -1))⌝ , subst:[a, nf] → [af(0), λ n. af(n + 1)], <all paths>

Additional information

Used terms: af(0), λ n. af(n + 1)

Proof step 38 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ a + ⌜nf⌝ = ⌜λ n. (n = 0 ⊃ a;nf(n -1))⌝

A spec-lemma

Proof step 39 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, ⌜af⌝ ≠ ⌜λ n. (n = 0 ⊃ af(0);af(n -1 + 1))⌝ , ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ n -1 = n - 1; (s)

Proof step 40 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n0 + 1) ≠ τ, af(n) ≠ (n = 0 ⊃ af(0);af((n - 1) + 1)), ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 41 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n) ≠ af((n - 1) + 1), af(n0 + 1) ≠ τ, n ≠ 0, ⌜λ n. af(n + 1)⌝ ^[0] ≠ τ ∨ ⌜λ n. af(n + 1)⌝ ^ = [] ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

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 42 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜0⌝ < # ⌜af⌝ ^ ⊦ ∃ n. af(n) ≠ τ

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: af = (λ n. τ)

Additional information

Used formulas: af = (λ n. τ)

Proof step 43 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, af = (λ n. τ), ⌜0⌝ < # ⌜af⌝ ^ ⊦ ∃ n. af(n) ≠ τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)

Proof step 44 from proof remtau-nottau-1 (previous step) (back to tree)

⌜λ n. τ⌝ ^[0] = τ, ⌜λ n. τ⌝ ^ ≠ [] ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-inftau, seq: ⊦ ⌜λ n. τ⌝ ^ = [], subst:, <all paths>

Additional information

Used terms:

Proof step 45 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ ⌜λ n. τ⌝ ^ = []

Lemma remtau-inftau

Proof step 46 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, af ≠ (λ n. τ), ⌜0⌝ < # ⌜af⌝ ^ ⊦ ∃ n. af(n) ≠ τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)

Proof step 47 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[0] = τ, ⌜af⌝ ^ ≠ [], af(n) ≠ τ ⊦ ∃ n. af(n) ≠ τ

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n

Additional information

Used terms: n

Proof step 48 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 +1] = τ, ⌜n0 +1⌝ < # ⌜af⌝ ^, ∀ af. ¬(⌜af⌝ ^[n0] = τ ∧ ⌜n0⌝ < # ⌜af⌝ ^) ⊦

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⌝ + ⌜n⌝ ; (s) ⊦ m +1 = m + 1; (s)

Proof step 49 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. af(n) ≠ τ

Additional information

Used formulas: ∃ n. af(n) ≠ τ

Proof step 50 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∃ n. af(n) ≠ τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 51 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 52 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Additional information

Used formulas: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Proof step 53 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝ , af(0) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 2, flags: discard

Additional information

Proof step 54 from proof remtau-nottau-1 (previous step) (back to tree)

(af(0) + ⌜λ n. af(n + 1)⌝ )^[n0 + 1] = τ, af(0) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # (af(0) + ⌜λ n. af(n + 1)⌝ )^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-nontau, seq: ⊦ a ≠ τ → (a + β)^ = a + β ^, subst:[a, β] → [af(0), ⌜λ n. af(n + 1)⌝ ], <all paths>

Additional information

Used terms: af(0), ⌜λ n. af(n + 1)⌝

Proof step 55 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ a ≠ τ → (a + β)^ = a + β ^

Lemma remtau-nontau

Proof step 56 from proof remtau-nottau-1 (previous step) (back to tree)

(af(0) + ⌜λ n. af(n + 1)⌝ ^)[n0 + 1] = τ, af(0) ≠ τ, ⌜n0⌝ + ⌜1⌝ < #(af(0) + ⌜λ n. af(n + 1)⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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 + σ = ⌜a '⌝ + σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s)

Proof step 57 from proof remtau-nottau-1 (previous step) (back to tree)

⌜λ n. af(n + 1)⌝ ^[n0] = τ, af(0) ≠ τ, ⌜n0⌝ < # ⌜λ n. af(n + 1)⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: λ n. af(n + 1)

Additional information

Used terms: λ n. af(n + 1)

Proof step 58 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, ⌜af⌝ ≠ af(0) + ⌜λ n. af(n + 1)⌝ , ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + σ = ⌜a '⌝ + σ; (s)

Proof step 59 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, ⌜af⌝ ≠ ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ , ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ0, σ1] → [⌜af⌝ , ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ ], <all paths>

Additional information

Used terms: ⌜af⌝ , ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝

Proof step 60 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])

A spec-lemma

Proof step 61 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, # ⌜af⌝ ≠ #(⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ ) ∨ (∃ n. ¬(⌜n⌝ < # ⌜af⌝ → ⌜af⌝ [n] = (⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ )[n])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] 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 ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 62 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, af(n) ≠ (⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ )[n], ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[σ, σ1, m] → [⌜af(0) '⌝ , ⌜λ n. af(n + 1)⌝ , n], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ a '[0] = a; (s) Used terms: ⌜af(0) '⌝ , ⌜λ n. af(n + 1)⌝ , n

Proof step 63 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 64 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, af(n) ≠ (⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ )[n], ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ¬ ⌜n⌝ < # ⌜af(0) '⌝ , ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)

Proof step 65 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(0) ≠ τ, af(n) ≠ af((n - 1) + 1), n ≠ 0, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

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 66 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 +1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af, n0. ¬(⌜af⌝ ^[n0 + 1] = τ ∧ af(n1) ≠ τ ∧ ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^ ∧ (∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m +1 = m + 1; (s)

Proof step 67 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Additional information

Used formulas: ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝

Proof step 68 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, ⌜af⌝ = af(0) + ⌜λ n. af(n + 1)⌝ , af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 2, flags: discard

Additional information

Proof step 69 from proof remtau-nottau-1 (previous step) (back to tree)

(af(0) + ⌜λ n. af(n + 1)⌝ )^[n0 + 1] = τ, af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # (af(0) + ⌜λ n. af(n + 1)⌝ )^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-nontau, seq: ⊦ a ≠ τ → (a + β)^ = a + β ^, subst:[a, β] → [af(0), ⌜λ n. af(n + 1)⌝ ], <all paths>

Additional information

Used terms: af(0), ⌜λ n. af(n + 1)⌝

Proof step 70 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ a ≠ τ → (a + β)^ = a + β ^

Lemma remtau-nontau

Proof step 71 from proof remtau-nottau-1 (previous step) (back to tree)

(af(0) + ⌜λ n. af(n + 1)⌝ )^[n0 + 1] = τ, af(0) = τ, af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # (af(0) + ⌜λ n. af(n + 1)⌝ )^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-append: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; 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) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)

Proof step 72 from proof remtau-nottau-1 (previous step) (back to tree)

⌜λ n. af(n + 1)⌝ ^[n0 + 1] = τ, af(0) = τ, af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜λ n. af(n + 1)⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: λ n. af(n + 1), n0 abort: F discard: T computed: T

Additional information

Used terms: λ n. af(n + 1), n0

Proof step 73 from proof remtau-nottau-1 (previous step) (back to tree)

(af(0) + ⌜λ n. af(n + 1)⌝ ^)[n0 + 1] = τ, af(0) ≠ τ, af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < #(af(0) + ⌜λ n. af(n + 1)⌝ ^), ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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 + σ = ⌜a '⌝ + σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s)

Proof step 74 from proof remtau-nottau-1 (previous step) (back to tree)

⌜λ n. af(n + 1)⌝ ^[n0] = τ, af(0) ≠ τ, af(n1 + 1) ≠ τ, ⌜n0⌝ < # ⌜λ n. af(n + 1)⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: λ n. af(n + 1)

Additional information

Used terms: λ n. af(n + 1)

Proof step 75 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, ⌜af⌝ ≠ af(0) + ⌜λ n. af(n + 1)⌝ , ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + σ = ⌜a '⌝ + σ; (s)

Proof step 76 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, ⌜af⌝ ≠ ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ , ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ0, σ1] → [⌜af⌝ , ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ ], <all paths>

Additional information

Used terms: ⌜af⌝ , ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝

Proof step 77 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])

A spec-lemma

Proof step 78 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, # ⌜af⌝ ≠ #(⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ ) ∨ (∃ n. ¬(⌜n⌝ < # ⌜af⌝ → ⌜af⌝ [n] = (⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ )[n])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] 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 ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 79 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, af(n) ≠ (⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ )[n], ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[σ, σ1, m] → [⌜af(0) '⌝ , ⌜λ n. af(n + 1)⌝ , n], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ a '[0] = a; (s) Used terms: ⌜af(0) '⌝ , ⌜λ n. af(n + 1)⌝ , n

Proof step 80 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]

A spec-lemma

Proof step 81 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, af(n) ≠ (⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ )[n], ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ¬ ⌜n⌝ < # ⌜af(0) '⌝ , ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^), ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)

Proof step 82 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n1 + 1) ≠ τ, af(n) ≠ af((n - 1) + 1), n ≠ 0, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^, ∀ af0, n. ⌜af0⌝ ^[n + 1] ≠ τ ∨ af0(n1) = τ ∨ ¬ ⌜n⌝ + ⌜1⌝ < # ⌜af0⌝ ^ ∨ ¬(∀ af0. ⌜af0⌝ ^[n] ≠ τ ∨ ¬ ⌜n⌝ < # ⌜af0⌝ ^) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 83 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦ ∃ n. af(n) ≠ τ

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: af = (λ n. τ)

Additional information

Used formulas: af = (λ n. τ)

Proof step 84 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af = (λ n. τ), ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦ ∃ n. af(n) ≠ τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 85 from proof remtau-nottau-1 (previous step) (back to tree)

⌜λ n. τ⌝ ^[n0 + 1] = τ, ⌜n0⌝ + ⌜1⌝ < # ⌜λ n. τ⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-inftau, seq: ⊦ ⌜λ n. τ⌝ ^ = [], subst:, <all paths>

Additional information

Used simplifier rules: ⊦ # [] = ⌜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 Used terms:

Proof step 86 from proof remtau-nottau-1 (previous step) (back to tree)

⊦ ⌜λ n. τ⌝ ^ = []

Lemma remtau-inftau

Proof step 87 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af ≠ (λ n. τ), ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦ ∃ n. af(n) ≠ τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 88 from proof remtau-nottau-1 (previous step) (back to tree)

⌜af⌝ ^[n0 + 1] = τ, af(n) ≠ τ, ⌜n0⌝ + ⌜1⌝ < # ⌜af⌝ ^, ∀ af0. ⌜af0⌝ ^[n0] ≠ τ ∨ ¬ ⌜n0⌝ < # ⌜af0⌝ ^ ⊦ ∃ n. af(n) ≠ τ

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n

Additional information

Used terms: n

Proof Tree for remtau-nottau-1 (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