[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-inf (conclusion) (back to tree)

⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

finp(⌜af⌝ ^) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream-basic[actionstream], name:ex, seq: ⊦ finp(σ) ↔ (∃ x. σ = ⌜x⌝ ), subst:[σ] → [⌜af⌝ ^], <all paths>

Additional information

Used terms: ⌜af⌝ ^

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

⊦ finp(σ) ↔ (∃ x. σ = ⌜x⌝ )

A spec-lemma

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

∃ x. ⌜af⌝ ^ = ⌜x⌝ ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜af⌝ ^ = ⌜al⌝ ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule induction

And obtained the following new goals

Rule argument

indvar: # al wfpred: <

Additional information

Used simplifier rules: <; (wellfounded) Used terms: # al

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

⌜af⌝ ^ = ⌜al⌝ , ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: 0 abort: F discard: F computed: F

Additional information

Used terms: 0

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

⌜af⌝ ^ = ⌜al⌝ , ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∀ m. 0 ≤ m → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 0 ≤ m; (s)

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

⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

Additional information

Used formulas: ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

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

⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-from, seq:∀ m. m < n → af(m) = τ ⊦ ⌜af⌝ ^ = (⌜af⌝ from n)^, subst:[n, af] → [m0, af], <all paths>

Additional information

Used terms: m0, af

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

∀ m. m < n → af(m) = τ ⊦ ⌜af⌝ ^ = (⌜af⌝ from n)^

Lemma remtau-from

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

⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∀ m. m < m0 → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

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

⌜af⌝ ^ = ⌜al⌝ , af(m0) ≠ τ, af(m) ≠ τ, af(m1) ≠ τ, m1 < m0, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: m1

Additional information

Used terms: m1

Proof step 14 from proof remtau-inf (previous step) (back to tree)

(⌜af⌝ from m0)^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s)

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

⌜af from m0⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:intrace-expand, seq: ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ , subst:[nf] → [af from m0], <all paths>

Additional information

Used terms: af from m0

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

⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝

A spec-lemma

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

(((af from m0))(0) + ⌜λ n. ((af from m0))(n + 1)⌝ )^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: af(m0) = hd(al)

Additional information

Used formulas: af(m0) = hd(al)

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

⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = hd(al), af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜hd(al) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = hd(al), af(m) ≠ τ, hd(al) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[actionstream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [al, a, al1]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a, y

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

⌜a '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = a, al = a + al1, a ≠ τ, af(m) ≠ τ, al ≠ [], ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [al0, af0] → [al1, λ n0. af(m0 + n0 + 1)]

Additional information

Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a + x = a ' + x; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) Used terms: al1, λ n0. af(m0 + n0 + 1)

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: m1 + 1 + m0 abort: F discard: F computed: F

Additional information

Used terms: m1 + 1 + m0

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∀ m. m1 + 1 + m0 ≤ m → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, ∀ m. m < m0 → af(m) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: m2 - 1 - m0 abort: F discard: T computed: F

Additional information

Used terms: m2 - 1 - m0

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, m2 - 1 - m0 < m0 → af(m2 - 1 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

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 + 1 ↔ ¬ n < m; (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ ¬ m + n < m; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + 1 ≤ n ↔ m < n; (s) n0 ≤ n ⊦ m ≤ n - n0 ↔ m + n0 ≤ n; (s)

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, ¬ m0 + m0 < m2 → af(m2 - 1 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

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] → [m2, m3]

Additional information

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

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , m2 = m3 + 1, af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m2 ≠ 0, m1 + m0 < m2, ¬ m0 + m0 < m2 → af(m3 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

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 + 1 ↔ ¬ n < m; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + 1 ≠ 0; (s)

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m3 + 1) ≠ τ, m1 + m0 ≤ m3, m3 < m0 + m0 → af(m3 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [m3, m0, n0]

Additional information

Used simplifier rules: ⊦ m ≤ n ↔ ¬ n < m; (ss) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n → n ≠ 0; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: m3, m0, n0

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , m3 = n0 + m0, af(m) ≠ τ, af(m0) ≠ τ, af(m3 + 1) ≠ τ, m1 + m0 ≤ m3, m0 ≤ m3, m3 < m0 + m0 → af(n0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

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 + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m ≤ m + n; (s)

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

⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af((n0 + m0) + 1) ≠ τ, m1 ≤ n0, n0 < m0 → af(n0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: n0

Additional information

Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n0

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

⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) ≠ hd(al), af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[actionstream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [al, a, al1]

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜[]⌝ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a, y

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

⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 1, left 3, right 1

Additional information

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

af(m) ≠ τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

User applied rule induction

And obtained the following new goals

Rule argument

indvar: m wfpred: <

Additional information

Used simplifier rules: <; (wellfounded) Used terms: m

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

af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: m abort: F discard: F computed: T

Additional information

Used terms: m

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

af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), af(m) ≠ τ ∧ (∀ m0. m0 < m → af(m0) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

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

af(m0) ≠ τ, af(m) ≠ τ, m0 < m, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [m0, af] → [m0, af]

Additional information

Used terms: m0, af

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

af(m0) ≠ τ, af(m) ≠ τ, m0 < m, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

af(m0) ≠ τ, af(m) ≠ τ, af(m1) ≠ τ, m0 < m, ∀ m. m < m1 → af(m) = τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: m1 abort: F discard: T computed: T

Additional information

Used terms: m1

Proof step 42 from proof remtau-inf (previous step) (back to tree)

¬ finp(⌜af⌝ ^), ∃ n. ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); remtau-nottau-2: ⊦ α ^ = ⌜af⌝ → (af(n) = τ ↔ false); ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream]

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

⌜af0⌝ = ⌜af⌝ ^, ∀ m. ¬ n ≤ m ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-tofin-strong, seq:¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^, subst:[β, n] → [⌜af⌝ , n], <all paths>

Additional information

Used simplifier rules: trace-fin: ⊦ ⌜al⌝ ^ ≠ ⌜af⌝ ; ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) Used terms: ⌜af⌝ , n

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

¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^

Lemma remtau-tofin-strong

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

⌜af0⌝ = ⌜af⌝ ^, ∀ m. ¬ n ≤ m ⊦ ¬ # ⌜af⌝ < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-nottau-2: ⊦ α ^ = ⌜af⌝ → (af(n) = τ ↔ false); ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s)

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

⌜af0⌝ = ⌜af⌝ ^, n ≤ n0, ∀ m. ¬ n ≤ m ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: n0

Additional information

Used terms: n0

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