[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 rem-preserves-monls (conclusion) (back to tree)

⊦ mon<(nσ) → (mon<(rem(nσ, np)) ↔ true)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof rem-preserves-monls (previous step) (back to tree)

¬(mon<(rem(nσ, np)) ↔ true), mon<(nσ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof rem-preserves-monls (previous step) (back to tree)

mon<(nσ), ¬ mon<(rem(nσ, np)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: nσ

Additional information

Used simplifier rules: stream('a) freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 4 from proof rem-preserves-monls (previous step) (back to tree)

nσ = ⌜nl⌝ , mon<(nσ), ¬ mon<(rem(nσ, np)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl⌝ ), ¬ mon<(rem(⌜nl⌝ , np)) ⊦

User applied rule induction

And obtained the following new goals

Rule argument

indvar: # nl wfpred: <

Additional information

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

Proof step 6 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl⌝ ), ¬ mon<(rem(⌜nl⌝ , np)), ∀ nl0, np. # nl0 < # nl → mon<(⌜nl0⌝ ) ∧ ¬ mon<(rem(⌜nl0⌝ , np)) → false ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: nl = []

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ rem([], np) = []; (s) Used formulas: nl = []

Proof step 7 from proof rem-preserves-monls (previous step) (back to tree)

nl ≠ [], mon<(⌜nl⌝ ), ¬ mon<(rem(⌜nl⌝ , np)), ∀ nl0, np. # nl0 < # nl → mon<(⌜nl0⌝ ) ∧ ¬ mon<(rem(⌜nl0⌝ , np)) → false ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list, name:lastdiv-rew, seq: ⊦ x = [] ↔ ¬(∃ y, a. x = y + a '), subst:[x] → [nl]; ['a] → [nat], <all paths>

Additional information

Used terms: nl

Proof step 8 from proof rem-preserves-monls (previous step) (back to tree)

⊦ x = [] ↔ ¬(∃ y, a. x = y + a ')

A spec-lemma

Proof step 9 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl⌝ ), ¬ mon<(rem(⌜nl⌝ , np)), ∃ y, a. nl = y + a ', ∀ nl0, np. # nl0 < # nl → mon<(⌜nl0⌝ ) ∧ ¬ mon<(rem(⌜nl0⌝ , np)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ rem(⌜x⌝ + ⌜a '⌝ , np) = rem(⌜x⌝ , np) + (np(# x) ⊃ [];⌜a '⌝ ); (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 10 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), ¬ mon<(rem(⌜nl0⌝ , np) + (np(# nl0) ⊃ [];⌜n '⌝ )), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦

Heuristic if-then-else split applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 11 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), np(# nl0), ¬ mon<(rem(⌜nl0⌝ , np) + []), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ σ + [] = σ; (s)

Proof step 12 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), np(# nl0), ¬ mon<(rem(⌜nl0⌝ , np)), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦

User applied rule apply induction

And closed the goal!

Rule argument

subst: [nl1, np] → [nl0, np]

Additional information

Used simplifier rules: monls-append1: ⊦ mon<(⌜nl⌝ + ⌜nl0⌝ ) → (mon<(⌜nl⌝ ) ↔ true); append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ #(x + y) = # x + # y; (s) ⊦ # a ' = 0 +1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: nl0, np

Proof step 13 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), ¬ mon<(rem(⌜nl0⌝ , np) + ⌜n '⌝ ), ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), ¬ mon<(rem(⌜nl0⌝ , np) + ⌜n '⌝ ), ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [nl1, np] → [nl0, np]

Additional information

Used simplifier rules: ⊦ #(x + y) = # x + # y; (s) ⊦ # a ' = 0 +1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: nl0, np

Proof step 15 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), ¬ mon<(rem(⌜nl0⌝ , np) + ⌜n '⌝ ), ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬ mon<(rem(⌜nl0⌝ , np))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:monls-def, seq: ⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1]), subst:[nσ] → [rem(⌜nl0⌝ , np) + ⌜n '⌝ ], <all paths>

Additional information

Used terms: rem(⌜nl0⌝ , np) + ⌜n '⌝

Proof step 16 from proof rem-preserves-monls (previous step) (back to tree)

⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1])

Lemma monls-def

Proof step 17 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl0⌝ + ⌜n '⌝ ), ¬ np(# nl0), ∃ n0. ¬(⌜n0⌝ + ⌜1⌝ < #(rem(⌜nl0⌝ , np) + ⌜n '⌝ ) → (rem(⌜nl0⌝ , np) + ⌜n '⌝ )[n0] < (rem(⌜nl0⌝ , np) + ⌜n '⌝ )[n0 + 1]), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬ mon<(rem(⌜nl0⌝ , np))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 18 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ < # rem(⌜nl0⌝ , np), mon<(⌜nl0⌝ + ⌜n '⌝ ), (rem(⌜nl0⌝ , np) + ⌜n '⌝ )[n0 + 1] ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬ mon<(rem(⌜nl0⌝ , np))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:monls-def, seq: ⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1]), subst:[nσ] → [rem(⌜nl0⌝ , np)], <all paths>

Additional information

Used terms: rem(⌜nl0⌝ , np)

Proof step 19 from proof rem-preserves-monls (previous step) (back to tree)

⊦ mon<(nσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # nσ → nσ[n] < nσ[n + 1])

Lemma monls-def

Proof step 20 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ < # rem(⌜nl0⌝ , np), mon<(⌜nl0⌝ + ⌜n '⌝ ), (rem(⌜nl0⌝ , np) + ⌜n '⌝ )[n0 + 1] ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n. ⌜n⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np) → rem(⌜nl0⌝ , np)[n] < rem(⌜nl0⌝ , np)[n + 1])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ, σ1] → [n0 + 1, rem(⌜nl0⌝ , np), ⌜n '⌝ ]; ['a] → [nat], <all paths>

Additional information

Used terms: n0 + 1, rem(⌜nl0⌝ , np), ⌜n '⌝

Proof step 21 from proof rem-preserves-monls (previous step) (back to tree)

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

A spec-lemma

Proof step 22 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ < # rem(⌜nl0⌝ , np), mon<(⌜nl0⌝ + ⌜n '⌝ ), (rem(⌜nl0⌝ , np) + ⌜n '⌝ )[n0 + 1] ≤ rem(⌜nl0⌝ , np)[n0], ¬ ⌜n0 + 1⌝ < # rem(⌜nl0⌝ , np), ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n. ⌜n⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np) → rem(⌜nl0⌝ , np)[n] < rem(⌜nl0⌝ , np)[n + 1])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 23 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ + ⌜1⌝ = # rem(⌜nl0⌝ , np), ⌜n0⌝ < ⌜n0⌝ + ⌜1⌝ , mon<(⌜nl0⌝ + ⌜n '⌝ ), n ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n1. n1 < n0 → rem(⌜nl0⌝ , np)[n1] < rem(⌜nl0⌝ , np)[n1 + 1])

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: mon-lim-filter-count, name:rem-member1-fin, seq:⊦ ⌜m⌝ < # rem(⌜x⌝ , np) → (∃ m0. m0 < # x ∧ x[m0] = rem(⌜x⌝ , np)[m] ∧ ¬ np(m0)), subst:[x, np, m] → [nl0, np, n0]; ['a] → [nat]

Additional information

Used terms: nl0, np, n0

Proof step 24 from proof rem-preserves-monls (previous step) (back to tree)

⊦ ⌜m⌝ < # rem(⌜x⌝ , np) → (∃ m0. m0 < # x ∧ x[m0] = rem(⌜x⌝ , np)[m] ∧ ¬ np(m0))

A spec-lemma

Proof step 25 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ + ⌜1⌝ = # rem(⌜nl0⌝ , np), ⌜n0⌝ < ⌜n0⌝ + ⌜1⌝ , mon<(⌜nl0⌝ + ⌜n '⌝ ), n ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ⌜n0⌝ < # rem(⌜nl0⌝ , np) → (∃ m0. m0 < # nl0 ∧ nl0[m0] = rem(⌜nl0⌝ , np)[n0] ∧ ¬ np(m0)), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n1. n1 < n0 → rem(⌜nl0⌝ , np)[n1] < rem(⌜nl0⌝ , np)[n1 + 1])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 26 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ + ⌜1⌝ = # rem(⌜nl0⌝ , np), nl0[m0] = rem(⌜nl0⌝ , np)[n0], nl0 ≠ [], m0 < # nl0, ⌜n0⌝ < ⌜n0⌝ + ⌜1⌝ , mon<(⌜nl0⌝ + ⌜n '⌝ ), n ≤ nl0[m0], ¬ np(m0), ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n1. n1 < n0 → rem(⌜nl0⌝ , np)[n1] < rem(⌜nl0⌝ , np)[n1 + 1])

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:monls-ls, seq: ⊦ mon<(nσ) ∧ m < n ∧ ⌜n⌝ < # nσ → nσ[m] < nσ[n], subst:[nσ, m, n] → [⌜nl0⌝ + ⌜n '⌝ , m0, # nl0]

Additional information

Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (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 ⊦ n < # x → (x + y)[n] = x[n]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (x + a ')[# x] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: ⌜nl0⌝ + ⌜n '⌝ , m0, # nl0

Proof step 27 from proof rem-preserves-monls (previous step) (back to tree)

⊦ mon<(nσ) ∧ m < n ∧ ⌜n⌝ < # nσ → nσ[m] < nσ[n]

Lemma monls-ls

Proof step 28 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ < # rem(⌜nl0⌝ , np), ⌜n0 + 1⌝ < # rem(⌜nl0⌝ , np), mon<(⌜nl0⌝ + ⌜n '⌝ ), rem(⌜nl0⌝ , np)[n0 + 1] ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n. ⌜n⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np) → rem(⌜nl0⌝ , np)[n] < rem(⌜nl0⌝ , np)[n + 1])

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)

Proof step 29 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ < # rem(⌜nl0⌝ , np), ⌜n0⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np), mon<(⌜nl0⌝ + ⌜n '⌝ ), rem(⌜nl0⌝ , np)[n0 + 1] ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦ mon<(⌜nl0⌝ ) ∧ ¬(∀ n. ⌜n⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np) → rem(⌜nl0⌝ , np)[n] < rem(⌜nl0⌝ , np)[n + 1])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: monls-append1: ⊦ mon<(⌜nl⌝ + ⌜nl0⌝ ) → (mon<(⌜nl⌝ ) ↔ true); append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream

Proof step 30 from proof rem-preserves-monls (previous step) (back to tree)

⌜n0⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np), ⌜n0⌝ < # rem(⌜nl0⌝ , np), mon<(⌜nl0⌝ + ⌜n '⌝ ), rem(⌜nl0⌝ , np)[n0 + 1] ≤ rem(⌜nl0⌝ , np)[n0], ¬ np(# nl0), ∀ n. ⌜n⌝ + ⌜1⌝ < # rem(⌜nl0⌝ , np) → rem(⌜nl0⌝ , np)[n] < rem(⌜nl0⌝ , np)[n + 1], ∀ nl1, np. # nl1 < #(nl0 + n ') → mon<(⌜nl1⌝ ) ∧ ¬ mon<(rem(⌜nl1⌝ , np)) → false ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: n0

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: n0

Proof step 31 from proof rem-preserves-monls (previous step) (back to tree)

nσ = ⌜nnf⌝ , mon<(nσ), ¬ mon<(rem(nσ, np)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 32 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nnf⌝ ), ¬ mon<(rem(⌜nnf⌝ , np)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: mon-lim-filter-count, name:rem-inf, seq: ⊦ rem(⌜nf⌝ , np) = lim(λ n. rem(⌜nf to n⌝ , np)), subst:[nf, np] → [nnf, np]; ['a] → [nat], <all paths>

Additional information

Used terms: nnf, np

Proof step 33 from proof rem-preserves-monls (previous step) (back to tree)

⊦ rem(⌜nf⌝ , np) = lim(λ n. rem(⌜nf to n⌝ , np))

A spec-lemma

Proof step 34 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nnf⌝ ), ¬ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:monls-mon-implies-monls, seq: ⊦ (∀ n. mon<(nσf(n))) ∧ mon(nσf) → (mon<(lim(λ n. nσf(n))) ↔ true), subst:[nσf] → [λ n. rem(⌜nnf to n⌝ , np)]

Additional information

Used terms: λ n. rem(⌜nnf to n⌝ , np)

Proof step 35 from proof rem-preserves-monls (previous step) (back to tree)

⊦ (∀ n. mon<(nσf(n))) ∧ mon(nσf) → (mon<(lim(λ n. nσf(n))) ↔ true)

Lemma monls-mon-implies-monls

Proof step 36 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nnf⌝ ), ¬ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))), (∀ n. mon<(rem(⌜nnf to n⌝ , np))) ∧ mon(λ n. rem(⌜nnf to n⌝ , np)) → (mon<(lim(λ n. rem(⌜nnf to n⌝ , np))) ↔ true) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nnf⌝ ), ¬ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))) ⊦ mon<(rem(⌜nnf to n⌝ , np)) ∧ mon(λ n. rem(⌜nnf to n⌝ , np))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: mon-lim-filter-count, name:mon-remfun, seq: ⊦ mon(λ n. rem(⌜nf to n⌝ , np)), subst:[nf, np] → [nnf, np]; ['a] → [nat]

Additional information

Used terms: nnf, np

Proof step 38 from proof rem-preserves-monls (previous step) (back to tree)

⊦ mon(λ n. rem(⌜nf to n⌝ , np))

A spec-lemma

Proof step 39 from proof rem-preserves-monls (previous step) (back to tree)

mon(λ n. rem(⌜nnf to n⌝ , np)), mon<(⌜nnf⌝ ), ¬ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))) ⊦ mon<(rem(⌜nnf to n⌝ , np)) ∧ mon(λ n. rem(⌜nnf to n⌝ , np))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 40 from proof rem-preserves-monls (previous step) (back to tree)

mon(λ n. rem(⌜nnf to n⌝ , np)), mon<(⌜nnf⌝ ), ¬ mon<(lim(λ n. rem(⌜nnf to n⌝ , np))), ¬ mon<(rem(⌜nnf to n⌝ , np)) ⊦

User applied rule apply proof lemma

And obtained the following new goals

Rule argument

path: 1, 1, 1, 1 subst: [nl, np] → [nnf to n, np]

Additional information

Used simplifier rules: monls-to: ⊦ mon<(⌜nnf⌝ ) → (mon<(⌜nnf to n⌝ ) ↔ true);

Proof step 41 from proof rem-preserves-monls (previous step) (back to tree)

mon<(⌜nl⌝ ), ¬ mon<(rem(⌜nl⌝ , np)) ⊦

Proof step 5 used as proof-lemma

Proof Tree for rem-preserves-monls (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