Proof step 1 from proof infinite-append-prefixnextli-weak (conclusion) (back to tree)

User applied rule cut formula

And obtained the following new goals

• Proof step 2:

  ∀ x. x ⊑ nextli(x), ∀ x. ∃ y. nextli(x) = x + y ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

• Proof step 77:

  ∀ x. x ⊑ nextli(x) ⊦ ∀ x. ∃ y. nextli(x) = x + y, ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Used formulas: ∀ x. ∃ y. nextli(x) = x + y

Proof step 2 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule weakening

And obtained the following new goals

• Proof step 3:

  ∀ x. ∃ y. nextli(x) = x + y ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Proof step 3 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule choice left

And obtained the following new goals

• Proof step 4:

  ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Proof step 4 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply lemma

And obtained the following new goals

• Proof step 5:

  ⊦ ∃ lf. lf(0) = [] ∧ (∀ n. lf(n + 1) = nextli(lf(n)))

• Proof step 6:

  ∀ x0. nextli(x0) = x0 + nextli0(x0), ∃ lf. lf(0) = [] ∧ (∀ n. lf(n + 1) = nextli(lf(n))) ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Used terms: nextli

Proof step 5 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Lemma nextli-lemma

Proof step 6 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 7:

  lf(0) = [], ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Proof step 7 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply lemma

And obtained the following new goals

• Proof step 8:

  ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# lf(n)) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → lf(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

• Proof step 9:

  lf(0) = [], ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Used terms: λ n. nextli0(lf(n))

Proof step 8 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

A spec-lemma

Proof step 9 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 10:

  ii(0) = 0, lf(0) = [], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Proof step 10 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule exists right

And obtained the following new goals

• Proof step 11:

  ii(0) = 0, lf(0) = [], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦ ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Used terms: σ, ii

Proof step 11 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 12:

  ii(0) = 0, lf(0) = [], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ii(n0) ≤ ii(n0 + 1) ∧ ¬ # σ < ⌜ii(n0 + 1)⌝ ∧ σ.take(ii(n0 + 1)) = ⌜nextli((σ.take(ii(n0))).l)⌝ ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1))

Rule argument

Additional information

Proof step 12 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule cut formula

And obtained the following new goals

• Proof step 13:

  ii(0) = 0, lf(0) = [], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n0. lf(n0) = (σ.take(ii(n0))).l ⊦ ii(n0) ≤ ii(n0 + 1) ∧ ¬ # σ < ⌜ii(n0 + 1)⌝ ∧ σ.take(ii(n0 + 1)) = ⌜nextli((σ.take(ii(n0))).l)⌝ ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1))

• Proof step 40:

  ii(0) = 0, lf(0) = [], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦ ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ii(n0) ≤ ii(n0 + 1) ∧ ¬ # σ < ⌜ii(n0 + 1)⌝ ∧ σ.take(ii(n0 + 1)) = ⌜nextli((σ.take(ii(n0))).l)⌝ ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1))

Rule argument

Additional information

Used formulas: ∀ n0. lf(n0) = (σ.take(ii(n0))).l

Proof step 13 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule case distinction

And obtained the following new goals

• Proof step 14:

  ii(0) = 0, lf(0) = [], ¬ ii(n0) ≤ ii(n0 + 1), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

• Proof step 15:

  ii(0) = 0, lf(0) = [], # σ < ⌜ii(n0 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

• Proof step 17:

  ii(0) = 0, lf(0) = [], σ.take(ii(n0 + 1)) ≠ ⌜nextli((σ.take(ii(n0))).l)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

• Proof step 23:

  ii(0) = 0, lf(0) = [], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1))

Rule argument

Additional information

Proof step 14 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m ≤ m + n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n0, n0 + 1

Proof step 15 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 16:

  # σ = ⌜ii(n)⌝ , ii(0) = 0, lf(0) = [], ii(n) < ii(n0 + 1), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s)

Proof step 16 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And closed the goal!

Rule argument

Additional information

Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n0

Proof step 17 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 18:

  ii(0) = 0, lf(0) = [], lf(n0 + 1) = (σ.take(ii(n0 + 1))).l, σ.take(ii(n0 + 1)) ≠ ⌜nextli((σ.take(ii(n0))).l)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n0. lf(n0) = (σ.take(ii(n0))).l ⊦

Rule argument

Additional information

Used terms: n0 + 1

Proof step 18 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 19:

  ii(0) = 0, lf(n0 + 1) = (σ.take(ii(n0 + 1))).l, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), σ.take(ii(n0 + 1)) ≠ ⌜nextli((σ.take(ii(n0))).l)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Used terms: n0

Proof step 19 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 20:

  ii(0) = 0, lf(n0 + 1) = nextli(lf(n0)), lf(0) = [], nextli(lf(n0)) = (σ.take(ii(n0 + 1))).l, σ.take(ii(n0 + 1)) ≠ ⌜nextli((σ.take(ii(n0))).l)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n0. lf(n0) = (σ.take(ii(n0))).l ⊦

Rule argument

Additional information

Proof step 20 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 21:

  ii(0) = 0, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), lf(n0) = (σ.take(ii(n0))).l, nextli(lf(n0)) = (σ.take(ii(n0 + 1))).l, σ.take(ii(n0 + 1)) ≠ ⌜nextli((σ.take(ii(n0))).l)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n0. lf(n0) = (σ.take(ii(n0))).l, ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Used terms: n0

Proof step 21 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 22:

  ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(n0 + 1) = nextli(lf(n0)), lf(0) = [], nextli(lf(n0)) = (σ.take(ii(n0 + 1))).l, σ.take(ii(n0 + 1)) ≠ ⌜nextli(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n0. lf(n0) = (σ.take(ii(n0))).l ⊦

Rule argument

Additional information

Proof step 22 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule case distinction

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ finp(σ) ↔ ¬(∃ nf. ⌜nf⌝ = σ); (ss) ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜nf⌝ .take(n) = ⌜nf.take(n)⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(σ) ↔ (∃ x. ⌜x⌝ = σ); (as) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ ⌜x⌝ .take(n) = ⌜x.take(n)⌝ ; (s)

Proof step 23 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

• Proof step 24:

  ii(0) = 0, lf(0) = [], finp(σ), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n0. lf(n0) = (σ.take(ii(n0))).l ⊦ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n))

• Proof step 36:

  ii(0) = 0, lf(0) = [], ¬ finp(σ), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n0. lf(n0) = (σ.take(ii(n0))).l ⊦ ∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1)

Rule argument

Additional information

Proof step 24 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 25:

  # x = ii(n), ii(0) = 0, lf(0) = [], ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ n0. lf(n0) = x.take(ii(n0)) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0))

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ .take(n) = ⌜x.take(n)⌝ ; (s) ⊦ ⌜x⌝ .drop(n) = ⌜x.drop(n)⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ finp(σ) ↔ (∃ x. ⌜x⌝ = σ); (as)

Proof step 25 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule exists right

And obtained the following new goals

• Proof step 26:

  # x = ii(n), ii(0) = 0, lf(0) = [], ∀ n0. lf(n0) = x.take(ii(n0)), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0)), ii(n) = ii(n) ∧ nextli(x) = x ∧ (∀ m. n ≤ m → ii(m) = ii(n))

Rule argument

Additional information

Used terms: n

Proof step 26 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 27:

  # x = ii(n), ii(0) = 0, lf(0) = [], ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ n0. lf(n0) = x.take(ii(n0)) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0)), nextli(x) = x ∧ (n ≤ m → ii(m) = ii(n))

Rule argument

Additional information

Proof step 27 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 28:

  # x = ii(n), ii(0) = 0, lf(0) = [], nextli(x) = x + nextli0(x), ∀ n0. lf(n0) = x.take(ii(n0)), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0)), nextli(x) = x ∧ (n ≤ m → ii(m) = ii(n))

Rule argument

Additional information

Used terms: x

Proof step 28 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule case distinction

And obtained the following new goals

• Proof step 29:

  # x = ii(n), ii(0) = 0, lf(0) = [], nextli(x) = x + nextli0(x), nextli(x) ≠ x, ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ n0. lf(n0) = x.take(ii(n0)) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0))

• Proof step 34:

  # x = ii(n), ii(0) = 0, lf(0) = [], nextli(x) = x + nextli0(x), ii(m) ≠ ii(n), n ≤ m, ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ n0. lf(n0) = x.take(ii(n0)) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0))

Rule argument

Additional information

Proof step 29 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 30:

  # x = ii(n), ii(0) = 0, lf(0) = [], nextli(x) = x + nextli0(x), nextli(x) ≠ x, ∀ n0. lf(n0) = x.take(ii(n0)), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Proof step 30 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 31:

  # x = ii(n), ii(0) = 0, lf(0) = [], lf(n) = x.take(ii(n)), nextli(x) = x + nextli0(x), nextli(x) ≠ x, ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ n0. lf(n0) = x.take(ii(n0)) ⊦

Rule argument

Additional information

Used terms: n

Proof step 31 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule subst equation

And obtained the following new goals

• Proof step 32:

  # x = ii(n), ii(0) = 0, lf(n) = x.take(# x), lf(0) = [], nextli(x) = x + nextli0(x), nextli(x) ≠ x, ∀ n0. lf(n0) = x.take(ii(n0)), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ # x < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = # x, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Proof step 32 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 33:

  # lf(n) = ii(n), ii(0) = 0, lf(0) = [], nextli(lf(n)) = lf(n) + nextli0(lf(n)), nextli(lf(n)) ≠ lf(n), ∀ n0. lf(n0) = lf(n).take(ii(n0)), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ lf(n).drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ # x = n → x.take(n) = x; (s)

Proof step 33 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ m; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: n

Proof step 34 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 35:

  # x = ii(n), ii(0) = 0, lf(0) = [], nextli(x) = x + nextli0(x), ii(m) ≠ ii(n), n ≤ m, ∀ n0. lf(n0) = x.take(ii(n0)), ∀ n0. ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)) ∧ ¬ ii(n) < ii(n0 + 1) ∧ x.drop(ii(n0)).take(# nextli0(lf(n0))) = nextli0(lf(n0)), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ n0. ii(n) = ii(n0) ∧ nextli(x) = x ∧ (∀ m. n0 ≤ m → ii(m) = ii(n0))

Rule argument

Additional information

Proof step 35 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used terms: m

Proof step 36 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 37:

  ii(0) = 0, lf(0) = [], ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ nf.drop(ii(n)).take(# nextli0(lf(n))) = nextli0(lf(n)), ∀ n0. lf(n0) = nf.take(ii(n0)) ⊦ ∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1)

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜nf⌝ .take(n) = ⌜nf.take(n)⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ .drop(n) = ⌜nf.drop(n)⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ finp(σ) ↔ ¬(∃ nf. ⌜nf⌝ = σ); (ss)

Proof step 37 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And obtained the following new goals

• Proof step 38:

  ii(0) = 0, lf(0) = [], ∀ n0. lf(n0) = nf.take(ii(n0)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ nf.drop(ii(n)).take(# nextli0(lf(n))) = nextli0(lf(n)), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1) ⊦ ∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1)

Rule argument

Additional information

Used terms: n1

Proof step 38 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 39:

  ii(0) = 0, lf(0) = [], ii(m) < ii(m + 1), n1 < ii(m + 1), ii(m) ≤ n1, ∀ n0. lf(n0) = nf.take(ii(n0)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ nf.drop(ii(n)).take(# nextli0(lf(n))) = nextli0(lf(n)), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1)

Rule argument

Additional information

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

Proof step 39 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

Additional information

Used terms: m

Proof step 40 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule simplifier

And obtained the following new goals

• Proof step 41:

  ii(0) = 0, lf(0) = [], lf(n2) ≠ (σ.take(ii(n2))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦ ii(n0) ≤ ii(n0 + 1) ∧ ¬ # σ < ⌜ii(n0 + 1)⌝ ∧ σ.take(ii(n0 + 1)) = ⌜nextli((σ.take(ii(n0))).l)⌝ ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∃ m. ii(m) ≤ n1 ∧ n1 < ii(m + 1))

Rule argument

Additional information

Proof step 41 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule weakening

And obtained the following new goals

• Proof step 42:

  ii(0) = 0, lf(0) = [], lf(n2) ≠ (σ.take(ii(n2))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

Proof step 42 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule structural induction

And obtained the following new goals

• Proof step 43:

  ii(0) = 0, lf(0) = [], lf(n0.+1) ≠ (σ.take(ii(n0.+1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ ii, lf, σ, n, nextli0, nextli. ¬ ( ii(0) = 0 ∧ lf(0) = [] ∧ lf(n0) ≠ (σ.take(ii(n0))).l ∧ (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ∧ (∀ x0. nextli(x0) = x0 + nextli0(x0)) ∧ (∀ n. lf(n + 1) = nextli(lf(n))) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ )) ⊦

Rule argument

Additional information

Used simplifier rules: Nat freely generated by 0, +1; ⊦ σ.take(0) = []; (s) ⊦ [].l = []; (s)

Proof step 43 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 44:

  ii(0) = 0, lf(0) = [], lf(n0 + 1) ≠ (σ.take(ii(n0 + 1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ ii0, lf0, σ0, n1, nextli1, nextli2. ii0(0) ≠ 0 ∨ lf0(0) ≠ [] ∨ lf0(n0) = (σ0.take(ii0(n0))).l ∨ ¬ (finp(σ0) ⊃ # σ0 = ⌜ii0(n1)⌝ ∧ (∀ m. n1 ≤ m → nextli1(lf0(m)) = [] ∧ ii0(m) = ii0(n1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)) ∨ ¬(∀ x0. nextli2(x0) = x0 + nextli1(x0)) ∨ ¬(∀ n. lf0(n + 1) = nextli2(lf0(n))) ∨ ¬(∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # nextli1(lf0(n)) ∧ ¬ # σ0 < ⌜ii0(n + 1)⌝ ∧ σ0.drop(ii0(n)).take(# nextli1(lf0(n))) = ⌜nextli1(lf0(n))⌝ ) ⊦

Rule argument

Additional information

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

Proof step 44 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 45:

  ii(0) = 0, lf(0) = [], lf(n0 + 1) ≠ (σ.take(ii(n0 + 1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ii(0) ≠ 0 ∨ lf(0) ≠ [] ∨ lf(n0) = (σ.take(ii(n0))).l ∨ ¬ (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ∨ ¬(∀ x0. nextli(x0) = x0 + nextli0(x0)) ∨ ¬(∀ n. lf(n + 1) = nextli(lf(n))) ∨ ¬(∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∨ ¬(∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ) ⊦

Rule argument

Additional information

Used terms: ii, lf, σ, n, nextli0, nextli

Proof step 45 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 46:

  ii(0) = 0, lf(0) = [], lf(n0) = (σ.take(ii(n0))).l, lf(n0 + 1) ≠ (σ.take(ii(n0 + 1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

Proof step 46 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 47:

  ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), lf(n0 + 1) ≠ (σ.take(ii(n0 + 1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Used terms: n0

Proof step 47 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 48:

  ii(0) = 0, lf(n0 + 1) = nextli(lf(n0)), lf(0) = [], lf(n0) = (σ.take(ii(n0))).l, nextli(lf(n0)) ≠ (σ.take(ii(n0 + 1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

Proof step 48 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 49:

  ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), nextli(lf(n0)) ≠ (σ.take(ii(n0 + 1))).l, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Used terms: lf(n0)

Proof step 49 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 50:

  ii(0) = 0, ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)), lf(n0 + 1) = nextli(lf(n0)), lf(0) = [], lf(n0) = (σ.take(ii(n0))).l, nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , nextli(lf(n0)) ≠ (σ.take(ii(n0 + 1))).l, ¬ # σ < ⌜ii(n0 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

Used terms: n0

Proof step 50 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 51:

  ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)), ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , nextli(lf(n0)) ≠ (σ.take(ii(n0 + 1))).l, ¬ # σ < ⌜ii(n0 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0) ⊦

Rule argument

Additional information

Proof step 51 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 52:

  ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x(n) = y(n))

• Proof step 53:

  ii(0) = 0, ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)), lf(n0 + 1) = nextli(lf(n0)), lf(0) = [], lf(n0) = (σ.take(ii(n0))).l, nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , # nextli(lf(n0)) ≠ # (σ.take(ii(n0 + 1))).l ∨ (∃ n. ¬(n < # nextli(lf(n0)) → nextli(lf(n0))(n) = (σ.take(ii(n0 + 1))).l(n))) ⊦

Rule argument

Additional information

Used terms: (σ.take(ii(n0 + 1))).l, nextli(lf(n0))

Proof step 52 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

A spec-lemma

Proof step 53 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 54:

  ii(n0 + 1) = ii(n0) + # nextli0(lf(n0)), ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), # nextli(lf(n0)) ≠ ii(n0 + 1) ∨ ¬(n1 < # nextli(lf(n0)) → nextli(lf(n0))(n1) = σ(n1)) ⊦

Rule argument

Additional information

Used simplifier rules: m < n, ¬ # σ < ⌜n⌝ ⊦ (σ.take(n)).l(m) = σ(m); (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic 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 ≤ m; (ss) ¬ # σ < ⌜n⌝ ⊦ # (σ.take(n)).l = n; (s)

Proof step 54 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule subst equation

And obtained the following new goals

• Proof step 55:

  ii(0) = 0, lf(n0 + 1) = nextli(lf(n0)), lf(0) = [], lf(n0) = (σ.take(ii(n0))).l, nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0) + # nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , # nextli(lf(n0)) ≠ ii(n0) + # nextli0(lf(n0)) ∨ ¬(n1 < # nextli(lf(n0)) → nextli(lf(n0))(n1) = σ(n1)) ⊦

Rule argument

Additional information

Proof step 55 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 56:

  ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(0) = [], lf(n0 + 1) = nextli(lf(n0)), nextli(lf(n0)) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), # nextli(lf(n0)) ≠ ii(n0) + # nextli0(lf(n0)) ∨ ¬(n1 < # nextli(lf(n0)) → nextli(lf(n0))(n1) = σ(n1)) ⊦

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)

Proof step 56 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule subst equation

And obtained the following new goals

• Proof step 57:

  ii(0) = 0, lf(n0 + 1) = lf(n0) + nextli0(lf(n0)), lf(0) = [], lf(n0) = (σ.take(ii(n0))).l, σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , #(lf(n0) + nextli0(lf(n0))) ≠ ii(n0) + # nextli0(lf(n0)) ∨ ¬(n1 < #(lf(n0) + nextli0(lf(n0))) → (lf(n0) + nextli0(lf(n0)))(n1) = σ(n1)) ⊦

Rule argument

Additional information

Proof step 57 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 58:

  ii(0) = 0, lf(n0) = (σ.take(ii(n0))).l, lf(0) = [], lf(n0 + 1) = lf(n0) + nextli0(lf(n0)), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), # lf(n0) ≠ ii(n0) ∨ ¬(n1 < # lf(n0) + # nextli0(lf(n0)) → lf(n0 + 1)(n1) = σ(n1)) ⊦

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ #(x + y) = # x + # y; (s) 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)

Proof step 58 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 59:

  ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x(n) = y(n))

• Proof step 60:

  # lf(n0) = # (σ.take(ii(n0))).l, ii(0) = 0, lf(n0 + 1) = lf(n0) + nextli0(lf(n0)), lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n. n < # lf(n0) → lf(n0)(n) = (σ.take(ii(n0))).l(n), # lf(n0) ≠ ii(n0) ∨ ¬(n1 < # lf(n0) + # nextli0(lf(n0)) → lf(n0 + 1)(n1) = σ(n1)) ⊦

Rule argument

Additional information

Used terms: (σ.take(ii(n0))).l, lf(n0)

Proof step 59 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

A spec-lemma

Proof step 60 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 61:

  # lf(n0) = ii(n0), ii(0) = 0, lf(n0 + 1) = lf(n0) + nextli0(lf(n0)), lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , lf(n0 + 1)(n1) ≠ σ(n1), n1 < ii(n0) + # nextli0(lf(n0)), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic m < n, ¬ # σ < ⌜n⌝ ⊦ (σ.take(n)).l(m) = σ(m); (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 c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ # x = 0 ↔ x = []; (s) lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ n → (n < m ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ¬ # σ < ⌜n⌝ ⊦ # (σ.take(n)).l = n; (s)

Proof step 61 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule subst equation

And obtained the following new goals

• Proof step 62:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , (lf(n0) + nextli0(lf(n0)))(n1) ≠ σ(n1), n1 < ii(n0) + # nextli0(lf(n0)), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2) ⊦

Rule argument

Additional information

Proof step 62 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 63:

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

• Proof step 64:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , (lf(n0) + nextli0(lf(n0)))(n1) ≠ σ(n1), n1 < ii(n0) + # nextli0(lf(n0)), ¬ n1 < # lf(n0), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

• Proof step 75:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , lf(n0)(n1) ≠ σ(n1), n1 < ii(n0) + # nextli0(lf(n0)), n1 < # lf(n0), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

Used terms: n1, nextli0(lf(n0)), lf(n0)

Proof step 63 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

A spec-lemma

Proof step 64 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 65:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , nextli0(lf(n0))(n1 - ii(n0)) ≠ σ(n1), nextli0(lf(n0)) ≠ [], n1 < ii(n0) + # nextli0(lf(n0)), ii(n0) ≤ n1, ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

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 ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ ¬ n < # x → (x + y)(n) = y(n - # x); (s)

Proof step 65 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 66:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], n1 = n3 + ii(n0), σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , nextli0(lf(n0))(n3) ≠ σ(n1), nextli0(lf(n0)) ≠ [], n1 < ii(n0) + # nextli0(lf(n0)), ii(n0) ≤ n1, ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2) ⊦

Rule argument

Additional information

Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n1, ii(n0), n3

Proof step 66 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 67:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , nextli0(lf(n0))(n3) ≠ σ(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (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 + n < m + n0 ↔ n < n0; (s) ⊦ m ≤ m + n; (s)

Proof step 67 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 68:

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

• Proof step 69:

  # σ.drop(ii(n0)).take(# nextli0(lf(n0))) = # ⌜nextli0(lf(n0))⌝ , # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], nextli0(lf(n0))(n3) ≠ σ(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n. ⌜n⌝ < # σ.drop(ii(n0)).take(# nextli0(lf(n0))) → σ.drop(ii(n0)).take(# nextli0(lf(n0)))(n) = ⌜nextli0(lf(n0))⌝ (n) ⊦

Rule argument

Additional information

Used terms: ⌜nextli0(lf(n0))⌝ , σ.drop(ii(n0)).take(# nextli0(lf(n0)))

Proof step 68 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

A spec-lemma

Proof step 69 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 70:

  # σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜# nextli0(lf(n0))⌝ , # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], nextli0(lf(n0))(n3) ≠ σ(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ n1. n1 < # nextli0(lf(n0)) → σ.drop(ii(n0)).take(# nextli0(lf(n0)))(n1) = nextli0(lf(n0))(n1) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ (n) = x(n); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 70 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

• Proof step 71:

  # lf(n0) = ii(n0), # σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜# nextli0(lf(n0))⌝ , # σ = ⌜ii(n)⌝ , ii(0) = 0, lf(0) = [], nextli0(lf(n0))(n3) ≠ σ(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), finp(σ), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , ∀ n1. n1 < # nextli0(lf(n0)) → σ.drop(ii(n0)).take(# nextli0(lf(n0)))(n1) = nextli0(lf(n0))(n1), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n) ⊦

• Proof step 73:

  # lf(n0) = ii(n0), # σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜# nextli0(lf(n0))⌝ , ii(0) = 0, lf(0) = [], nextli0(lf(n0))(n3) ≠ σ(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , ¬ finp(σ), ∀ n1. n1 < # nextli0(lf(n0)) → σ.drop(ii(n0)).take(# nextli0(lf(n0)))(n1) = nextli0(lf(n0))(n1), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦

Rule argument

Additional information

Proof step 71 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 72:

  # x = ii(n), # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], nextli0(lf(n0))(n3) ≠ x(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), ii(n0) + # nextli0(lf(n0)) ≤ ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n), ∀ n1. n1 < # nextli0(lf(n0)) → x(ii(n0) + n1) = nextli0(lf(n0))(n1), ∀ n1. ii(n1 + 1) = ii(n1) + # nextli0(lf(n1)) ∧ ¬ ii(n) < ii(n1 + 1) ∧ x.drop(ii(n1)).take(# nextli0(lf(n1))) = nextli0(lf(n1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = x(n2) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ (n) = x(n); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ .take(n) = ⌜x.take(n)⌝ ; (s) ⊦ ⌜x⌝ .drop(n) = ⌜x.drop(n)⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) m + m0 < # x ⊦ x.drop(m)(m0) = x(m + m0); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ¬ # x < n, m < n ⊦ x.take(n)(m) = x(m); (s) ⊦ m ≤ n → (n < m ↔ false); (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ ¬ m + n < m; (s) ⊦ m < n → n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic 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 < m; (ss) ¬ # x < n ⊦ # x.drop(n) = # x - n; (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⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ¬ # x < n ⊦ # x.take(n) = n; (s) ⊦ m < n → ⌜m⌝ < ⌜n⌝ + n∞0; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ finp(σ) ↔ (∃ x. ⌜x⌝ = σ); (as)

Proof step 72 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: n3

Proof step 73 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 74:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], nextli0(lf(n0))(n3) ≠ nf(n3 + ii(n0)), nextli0(lf(n0)) ≠ [], n3 < # nextli0(lf(n0)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n1. n1 < # nextli0(lf(n0)) → nf(n1 + ii(n0)) = nextli0(lf(n0))(n1), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ nf.drop(ii(n)).take(# nextli0(lf(n))) = nextli0(lf(n)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = nf(n2) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ (n) = nf(n); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ .take(n) = ⌜nf.take(n)⌝ ; (s) ⊦ ⌜nf⌝ .drop(n) = ⌜nf.drop(n)⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ nf.drop(n)(m) = nf(m + n); (s) m < n, ¬ # σ < ⌜n⌝ ⊦ σ.take(n)(m) = σ(m); (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ¬ # σ < ⌜n⌝ ⊦ # σ.take(n) = ⌜n⌝ ; (s) ⊦ finp(σ) ↔ ¬(∃ nf. ⌜nf⌝ = σ); (ss) ⊦ ¬ finp(σ) → # σ = ∞; (s)

Proof step 74 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used terms: n3

Proof step 75 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 76:

  # lf(n0) = ii(n0), ii(0) = 0, lf(0) = [], σ.drop(ii(n0)).take(# nextli0(lf(n0))) = ⌜nextli0(lf(n0))⌝ , lf(n0)(n1) ≠ σ(n1), n1 < ii(n0) + # nextli0(lf(n0)), n1 < ii(n0), ¬ # σ < ⌜ii(n0)⌝ + ⌜# nextli0(lf(n0))⌝ , (finp(σ) ⊃ # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → nextli0(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n2. n2 < ii(n0) → lf(n0)(n2) = σ(n2), ∀ x0. nextli(x0) = x0 + nextli0(x0), ∀ n. lf(n + 1) = nextli(lf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # nextli0(lf(n)) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.drop(ii(n)).take(# nextli0(lf(n))) = ⌜nextli0(lf(n))⌝ ⊦

Rule argument

Additional information

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

Proof step 76 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used terms: n1

Proof step 77 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 78:

  ∀ x. x ⊑ nextli(x) ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∃ y. nextli(x) = x + y

Rule argument

Additional information

Proof step 78 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 79:

  x ⊑ nextli(x) ⊦ ∃ y. nextli(x) = x + y, ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n) ≤ ii(n + 1) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ σ.take(ii(n + 1)) = ⌜nextli((σ.take(ii(n))).l)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ ⌜nextli(σ.l)⌝ = σ ∧ (∀ m. n ≤ m → ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

Rule argument

Additional information

Used terms: x

Proof step 79 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 80:

  ⊦ x ⊑ y ↔ (∃ z. x + z = y)

Rule argument

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: nextli(x), x

Proof step 80 from proof infinite-append-prefixnextli-weak (previous step) (back to tree)

A spec-lemma