[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 27 from proof lim-unique (previous step)

# σ = # σ0, # σ2 + # σ3 = # σ1, (σ0 to n) + σ2 to n = (σ to n) + σ1 to n, mon(σσ), ⌜n0⌝ < # σσ, ⌜n1⌝ < # σσ, n1 < n0, ∀ n. ⌜n⌝ < # σσ → (∃ σ1. σσ[n] + σ1 = σ), ∀ n. ⌜n⌝ < # σσ → (∃ σ1. σσ[n] + σ1 = σ0) ⊦ σσ = [], σ to n = σ0 to n, n0 = 0, # σ0 < ⌜n⌝

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 28:
⊦ ¬ # σ < ⌜n⌝ → σ + σ0 to n = σ to n
Proof step 29:
¬ #(σ0 to n) < ⌜n⌝ , # σ = # σ0, # σ2 + # σ3 = # σ1, σ0 to n to n = (σ to n) + σ1 to n, mon(σσ), ⌜n0⌝ < # σσ, ⌜n1⌝ < # σσ, n1 < n0, ∀ n. ⌜n⌝ < # σσ → (∃ σ1. σσ[n] + σ1 = σ), ∀ n. ⌜n⌝ < # σσ → (∃ σ1. σσ[n] + σ1 = σ0) ⊦ σσ = [], σ to n = σ0 to n, n0 = 0, # σ0 < ⌜n⌝

Rule argument

spec: stream inst: name: append-to-ls seq: ⊦ ¬ # σ < ⌜n⌝ → σ + σ0 to n = σ to n subst: [n, σ0, σ] → [n, σ2, σ0 to n] flags: rewrite

Additional information

Used simplifier rules: size-to: ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; from specification stream%less-fin: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; from specification nat-inf%ref-1: ⊦ ¬ n < n; from specification nat-basic1 Used terms: n, σ2, σ0 to n