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

⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ frag(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcσ, pα) ∧ frag(IOAut(astart, astep, aext))(aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, pcσ, pα)) ⊑ aext !(aα) → # repls(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) = # repla(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) + ⌜1⌝

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof repl-size (previous step) (back to tree)

# repls(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) ≠ # repla(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) + ⌜1⌝ , frag(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcσ, pα), frag(IOAut(astart, astep, aext))(aσ, aα), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, pcσ, pα)) ⊑ aext !(aα) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: pcσ

Additional information

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

Proof step 3 from proof repl-size (previous step) (back to tree)

pcσ = ⌜pcsl⌝ , # repls(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) ≠ # repla(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), frag(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcσ, pα), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, pcσ, pα)) ⊑ aext !(aα) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(σ) ↔ (∃ x. ⌜x⌝ = σ); (as) ⊦ frag(ioa)(⌜sl⌝ , α) ↔ frag*(ioa)(sl, α.l) ∧ finp(α); (s)

Proof step 4 from proof repl-size (previous step) (back to tree)

# repls(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) ≠ # repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), frag*(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsl, pal), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsl⌝ , ⌜pal⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: replstate-fin-def, seq:⊦ # pcsl = # pal + 1 → repls(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) = ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα)⌝ , subst:[pal, cext, aα, aσ, cren, ren, cstep, aren, pcsl, aext, step] → [pal, cext, aα, aσ, cren, ren, cstep, aren, pcsl, aext, step]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as], <all paths>

Additional information

Used simplifier rules: ⊦ frag*(IOAut(start, step, ext))(sl, al) → (# sl = # al + 1 ↔ true); (ss) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: aren, ren, pal, step, aext, cren, cstep, aα, pcsl, aσ, cext

Proof step 5 from proof repl-size (previous step) (back to tree)

⊦ # pcsl = # pal + 1 → repls(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) = ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα)⌝

Lemma replstate-fin-def

Proof step 6 from proof repl-size (previous step) (back to tree)

# pcsl = # pal + 1, # ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα)⌝ ≠ # repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), frag*(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsl, pal), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsl⌝ , ⌜pal⌝ )) ⊑ aext !(aα) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: repl-fin-size: ⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ frag* (IOAut (Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) (pcsl, pal) ∧ frag(IOAut(astart, astep, aext))(aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜pcsl⌝ , ⌜pal⌝ )) ⊑ aext !(aα) → # repls(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα) = # repla(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα) + 1; add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) 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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 7 from proof repl-size (previous step) (back to tree)

# pcsl = # pal + 1, ⌜# repla(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα)⌝ ≠ # repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), frag*(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsl, pal), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsl⌝ , ⌜pal⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: replaction-fin-def, seq:⊦ # pcsl = # pal + 1 → repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) = ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα)⌝ , subst:[pal, cext, aα, aσ, cren, ren, cstep, aren, pcsl, aext, step] → [pal, cext, aα, aσ, cren, ren, cstep, aren, pcsl, aext, step]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) Used terms: aren, ren, pal, step, aext, cren, cstep, aα, pcsl, aσ, cext

Proof step 8 from proof repl-size (previous step) (back to tree)

⊦ # pcsl = # pal + 1 → repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsl⌝ , ⌜pal⌝ , aσ, aα) = ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα)⌝

Lemma replaction-fin-def

Proof step 9 from proof repl-size (previous step) (back to tree)

pcσ = ⌜pcsf⌝ , # repls(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) ≠ # repla(step, cstep, cren, ren, aren, cext, aext, pcσ, pα, aσ, aα) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), frag(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcσ, pα), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, pcσ, pα)) ⊑ aext !(aα) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ .f = nf; (s) ⊦ finp(σ) ↔ ¬(∃ nf. ⌜nf⌝ = σ); (ss) ⊦ frag(ioa)(⌜sf⌝ , α) ↔ fragω(ioa)(sf, α.f) ∧ ¬ finp(α); (s)

Proof step 10 from proof repl-size (previous step) (back to tree)

# repls(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) ≠ # repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: replstate-inf-def, seq:⊦ cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → repls(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) = lim (⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ ⌝ ), subst:[cext, aσ, ren, cstep, aren, aext, step, aα, pcsf, cren, paf] → [cext, aσ, ren, cstep, aren, aext, step, aα, pcsf, cren, paf]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as], <all paths>

Additional information

Used terms: aren, ren, paf, step, aext, cren, cstep, aα, aσ, pcsf, cext

Proof step 11 from proof repl-size (previous step) (back to tree)

⊦ cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → repls(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) = lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ )

Lemma replstate-inf-def

Proof step 12 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name: replaction-inf-def, seq:⊦ cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) = lim (⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ ⌝ ), subst:[cext, aσ, ren, cstep, aren, aext, step, aα, pcsf, cren, paf] → [cext, aσ, ren, cstep, aren, aext, step, aα, pcsf, cren, paf]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as], <all paths>

Additional information

Used terms: aren, ren, paf, step, aext, cren, cstep, aα, aσ, pcsf, cext

Proof step 13 from proof repl-size (previous step) (back to tree)

⊦ cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → repla(step, cstep, cren, ren, aren, cext, aext, ⌜pcsf⌝ , ⌜paf⌝ , aσ, aα) = lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ )

Lemma replaction-inf-def

Proof step 14 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: streamseq-mon-lim, name:two-mon-size, seq:mon(⌜σf⌝ ), mon(⌜σg⌝ ), ∀ n. # σf(n) = # σg(n) + ⌜m⌝ ⊦ # lim(⌜σf⌝ ) = # lim(⌜σg⌝ ) + ⌜m⌝ , subst:[σf, σg, m] → [λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ , λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ , 1]; ['a, 'b] → [('s, 'as), 'pa]

Additional information

Used terms: λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ , λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ , 1

Proof step 15 from proof repl-size (previous step) (back to tree)

mon(⌜σf⌝ ), mon(⌜σg⌝ ), ∀ n. # σf(n) = # σg(n) + ⌜m⌝ ⊦ # lim(⌜σf⌝ ) = # lim(⌜σg⌝ ) + ⌜m⌝

A spec-lemma

Proof step 16 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ∧ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ∧ (∀ n. # ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ = # ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ + ⌜1⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 17 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ∧ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ∧ # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 = # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 18 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:mon-repls, seq:⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ fragω (IOAut (Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((s, cs) ' + pcsf, paf) ∧ frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, (s, cs) + ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon (⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + pcsf.take(n), paf.take(n), ⌜as '⌝ + aσ, aα) ⌝ ⌝ ), subst:[astep, cs, cext, as, start, aσ, ext, ren, astart, cstart, cstep, aren, aext, step, aα, s, pcsf, cren, paf] → [astep, pcsf(0)._2, cext, hd(aσ), start, tl(aσ), ext, ren, astart, cstart, cstep, aren, aext, step, aα, pcsf(0)._1, λ n. pcsf(n + 1), cren, paf]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as]

Additional information

Used terms: aren, ren, ext, pcsf(0)._1, hd(aσ), astep, paf, astart, step, aext, cstart, cren, cstep, aα, start, tl(aσ), λ n. pcsf(n + 1), cext, pcsf(0)._2

Proof step 19 from proof repl-size (previous step) (back to tree)

⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + pcsf, paf) ∧ frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, (s, cs) + ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + pcsf.take(n), paf.take(n), ⌜as '⌝ + aσ, aα)⌝ ⌝ )

Lemma mon-repls

Proof step 20 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜hd(aσ) '⌝ + tl(aσ), aα) ∧ cext !(πra(step, cstep, ren, cren, (pcsf(0)._1, pcsf(0)._2) + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon (⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 21 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜hd(aσ) '⌝ + tl(aσ), aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon (⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ ) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 22 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜hd(aσ) '⌝ + tl(aσ), aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream, name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [aσ, as, aσ0]; ['a] → ['as]

Additional information

Used simplifier rules: ⊦ ¬ frag(IOAut(start, step, ext))([], α); (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: aσ, as, aσ0

Proof step 23 from proof repl-size (previous step) (back to tree)

aσ = as + aσ0, # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , aσ ≠ [], frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 24 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

term: pcsf(0)._1

Additional information

Used terms: s, cs

Proof step 25 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf) ∧ cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 26 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: intrace-expand, seq: ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ , subst:[nf] → [pcsf]; ['a] → [('s, 'cs)], <all paths>

Additional information

Used terms: pcsf

Proof step 27 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 28 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, pcsf(0) + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 29 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: pcsf = (s, cs) ' + (λ n. pcsf(n + 1))

Additional information

Used formulas: pcsf = (s, cs) ' + (λ n. pcsf(n + 1))

Proof step 30 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , pcsf ≠ (s, cs) ' + (λ n. pcsf(n + 1)), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:add-list-fun-def, seq: ⊦ x + nf = (λ n. (n < # x ⊃ x[n];nf(n - # x))), subst:[x, nf] → [(s, cs) ', λ n. pcsf(n + 1)]; ['a] → [('s, 'cs)], <all paths>

Additional information

Used terms: (s, cs) ', λ n. pcsf(n + 1)

Proof step 31 from proof repl-size (previous step) (back to tree)

⊦ x + nf = (λ n. (n < # x ⊃ x[n];nf(n - # x)))

A spec-lemma

Proof step 32 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , pcsf ≠ (λ n. (n < # (s, cs) ' ⊃ (s, cs) '[n];pcsf((n - # (s, cs) ') + 1))), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) (λ n. (n < # (s, cs) ' ⊃ (s, cs) '[n];pcsf((n - # (s, cs) ') + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ a '[0] = a; (s) ⊦ m < 1 ↔ m = 0; (s)

Proof step 33 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , pcsf(n) ≠ (n = 0 ⊃ (s, cs);pcsf((n - 1) + 1)), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(λ n0. (n0 = 0 ⊃ (s, cs);pcsf((n0 - 1) + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 34 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , n ≠ 0, pcsf(n) ≠ pcsf((n - 1) + 1), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(λ n0. (n0 = 0 ⊃ (s, cs);pcsf((n0 - 1) + 1)), paf), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 35 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ), ¬ cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: intrace-expand, seq: ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ , subst:[nf] → [pcsf]; ['a] → [('s, 'cs)], <all paths>

Additional information

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

Proof step 36 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 37 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), mon (⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⌝ ), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: streamseq-mon-lim, name: mon-def, seq: ⊦ mon(σσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # σσ → σσ[n] ⊑ σσ[n + 1]), subst:[σσ] → [⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ ]; ['a] → [('s, 'as)], <all paths>

Additional information

Used terms: ⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝

Proof step 38 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 39 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), ∀ n. ⌜n⌝ + ⌜1⌝ < # ⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ → ⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ [n ] ⊑ ⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ [n + 1 ] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(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⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 40 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), ∀ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: streamseq-mon-lim, name: mon-def, seq: ⊦ mon(σσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # σσ → σσ[n] ⊑ σσ[n + 1]), subst:[σσ] → [⌜λ n. ⌜repls (step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ ⌝ ]; ['a] → [('s, 'as)], <all paths>

Additional information

Used terms: ⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ ⌝

Proof step 41 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 42 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ∀ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , ∃ n. ¬ ( ⌜n⌝ + ⌜1⌝ < # ⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ → ⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ [n] ⊑ ⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ [n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

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 ⊦ ⌜nf⌝ [n] = nf(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⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 43 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ , ∀ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: n abort: F discard: T computed: F

Additional information

Used terms: n

Proof step 44 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: to-succ-nf, seq: ⊦ nf.take(n + 1) = nf(0) + (λ n. nf(n + 1)).take(n), subst:[nf, n] → [pcsf, n]; ['a] → [('s, 'cs)], <all paths>

Additional information

Used terms: pcsf, n

Proof step 45 from proof repl-size (previous step) (back to tree)

⊦ nf.take(n + 1) = nf(0) + (λ n. nf(n + 1)).take(n)

A spec-lemma

Proof step 46 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) + (λ n. pcsf(n + 1)).take(n), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s)

Proof step 47 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: to-succ2-nf, seq: ⊦ nf.take(n + 2) = nf(0) + (λ n. nf(n + 1)).take(n + 1), subst:[nf, n] → [pcsf, n]; ['a] → [('s, 'cs)], <all paths>

Additional information

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

Proof step 48 from proof repl-size (previous step) (back to tree)

⊦ nf.take(n + 2) = nf(0) + (λ n. nf(n + 1)).take(n + 1)

A spec-lemma

Proof step 49 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), aσ, aα)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s)

Proof step 50 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), aσ, aα)⌝ ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

term: pcsf(0)._1

Additional information

Used terms: s, cs

Proof step 51 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), aσ, aα)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 52 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ , ¬ ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), aσ, aα)⌝ ⊑ ⌜repls(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), aσ, aα)⌝ ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: stream, name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [aσ, as, aσ0]; ['a] → ['as]

Additional information

Used simplifier rules: ⊦ ⌜a '⌝ + σ ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ ¬ frag(IOAut(start, step, ext))([], α); (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: aσ, as, aσ0

Proof step 53 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:mon-repla, seq:⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ fragω (IOAut (Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((s, cs) ' + pcsf, paf) ∧ frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, (s, cs) + ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon (⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + pcsf.take(n), paf.take(n), ⌜as '⌝ + aσ, aα) ⌝ ⌝ ), subst:[astep, cs, cext, as, start, aσ, ext, ren, astart, cstart, cstep, aren, aext, step, aα, s, pcsf, cren, paf] → [astep, pcsf(0)._2, cext, hd(aσ), start, tl(aσ), ext, ren, astart, cstart, cstep, aren, aext, step, aα, pcsf(0)._1, λ n. pcsf(n + 1), cren, paf]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as]

Additional information

Used terms: aren, ren, ext, pcsf(0)._1, hd(aσ), astep, paf, astart, step, aext, cstart, cren, cstep, aα, start, tl(aσ), λ n. pcsf(n + 1), cext, pcsf(0)._2

Proof step 54 from proof repl-size (previous step) (back to tree)

⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + pcsf, paf) ∧ frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, (s, cs) + ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (s, cs) ' + pcsf.take(n), paf.take(n), ⌜as '⌝ + aσ, aα)⌝ ⌝ )

Lemma mon-repla

Proof step 55 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜hd(aσ) '⌝ + tl(aσ), aα) ∧ cext !(πra(step, cstep, ren, cren, (pcsf(0)._1, pcsf(0)._2) + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon (⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 56 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜hd(aσ) '⌝ + tl(aσ), aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα) → mon (⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ ) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 57 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜hd(aσ) '⌝ + tl(aσ), aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream, name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [aσ, as, aσ0]; ['a] → ['as]

Additional information

Used simplifier rules: ⊦ ¬ frag(IOAut(start, step, ext))([], α); (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: aσ, as, aσ0

Proof step 58 from proof repl-size (previous step) (back to tree)

aσ = as + aσ0, # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , aσ ≠ [], frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 59 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) ((pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)), paf) ∧ cext !(πra(step, cstep, ren, cren, ⌜(pcsf(0)._1, pcsf(0)._2) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

term: pcsf(0)._1

Additional information

Used terms: s, cs

Proof step 60 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf) ∧ cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 61 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: intrace-expand, seq: ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ , subst:[nf] → [pcsf]; ['a] → [('s, 'cs)], <all paths>

Additional information

Used terms: pcsf

Proof step 62 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 63 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, pcsf(0) + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 64 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: pcsf = (s, cs) ' + (λ n. pcsf(n + 1))

Additional information

Used formulas: pcsf = (s, cs) ' + (λ n. pcsf(n + 1))

Proof step 65 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , pcsf ≠ (s, cs) ' + (λ n. pcsf(n + 1)), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))((s, cs) ' + (λ n. pcsf(n + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:add-list-fun-def, seq: ⊦ x + nf = (λ n. (n < # x ⊃ x[n];nf(n - # x))), subst:[x, nf] → [(s, cs) ', λ n. pcsf(n + 1)]; ['a] → [('s, 'cs)], <all paths>

Additional information

Used terms: (s, cs) ', λ n. pcsf(n + 1)

Proof step 66 from proof repl-size (previous step) (back to tree)

⊦ x + nf = (λ n. (n < # x ⊃ x[n];nf(n - # x)))

A spec-lemma

Proof step 67 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , pcsf ≠ (λ n. (n < # (s, cs) ' ⊃ (s, cs) '[n];pcsf((n - # (s, cs) ') + 1))), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) (λ n. (n < # (s, cs) ' ⊃ (s, cs) '[n];pcsf((n - # (s, cs) ') + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ a '[0] = a; (s) ⊦ m < 1 ↔ m = 0; (s)

Proof step 68 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , pcsf(n) ≠ (n = 0 ⊃ (s, cs);pcsf((n - 1) + 1)), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(λ n0. (n0 = 0 ⊃ (s, cs);pcsf((n0 - 1) + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 69 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , n ≠ 0, pcsf(n) ≠ pcsf((n - 1) + 1), frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(λ n0. (n0 = 0 ⊃ (s, cs);pcsf((n0 - 1) + 1)), paf), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 70 from proof repl-size (previous step) (back to tree)

pcsf(0) = (s, cs), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ), ¬ cext !(πra(step, cstep, ren, cren, ⌜(s, cs) '⌝ + ⌜λ n. pcsf(n + 1)⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: intrace-expand, seq: ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ , subst:[nf] → [pcsf]; ['a] → [('s, 'cs)], <all paths>

Additional information

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

Proof step 71 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 72 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), mon (⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⌝ ), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: streamseq-mon-lim, name: mon-def, seq: ⊦ mon(σσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # σσ → σσ[n] ⊑ σσ[n + 1]), subst:[σσ] → [⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ ]; ['a] → ['pa], <all paths>

Additional information

Used terms: ⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝

Proof step 73 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 74 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), ∀ n. ⌜n⌝ + ⌜1⌝ < # ⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ → ⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ [n ] ⊑ ⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⌝ [n + 1 ] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(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⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 75 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ), ∀ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: streamseq-mon-lim, name: mon-def, seq: ⊦ mon(σσ) ↔ (∀ n. ⌜n⌝ + ⌜1⌝ < # σσ → σσ[n] ⊑ σσ[n + 1]), subst:[σσ] → [⌜λ n. ⌜repla (step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ ⌝ ]; ['a] → ['pa], <all paths>

Additional information

Used terms: ⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) ⌝ ⌝

Proof step 76 from proof repl-size (previous step) (back to tree)

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

A spec-lemma

Proof step 77 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ∀ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , ∃ n. ¬ ( ⌜n⌝ + ⌜1⌝ < # ⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ → ⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ [n] ⊑ ⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ [n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

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 ⊦ ⌜nf⌝ [n] = nf(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⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 78 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ , ∀ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: n abort: F discard: T computed: F

Additional information

Used terms: n

Proof step 79 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜hd(aσ) '⌝ + tl(aσ), aα)⌝ ⊑ ⌜repla (step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜hd(aσ) '⌝ + tl(aσ), aα) ⌝ , ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream, name:elim-hd-tl, seq: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0), subst:[σ, a, σ0] → [aσ, as, aσ0]; ['a] → ['as]

Additional information

Used simplifier rules: ⊦ ¬ frag(IOAut(start, step, ext))([], α); (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: aσ, as, aσ0

Proof step 80 from proof repl-size (previous step) (back to tree)

aσ = as + aσ0, # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , aσ ≠ [], frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), aσ, aα)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 81 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n0. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n0. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ , ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: to-succ-nf, seq: ⊦ nf.take(n + 1) = nf(0) + (λ n. nf(n + 1)).take(n), subst:[nf, n] → [pcsf, n]; ['a] → [('s, 'cs)], <all paths>

Additional information

Used terms: pcsf, n

Proof step 82 from proof repl-size (previous step) (back to tree)

⊦ nf.take(n + 1) = nf(0) + (λ n. nf(n + 1)).take(n)

A spec-lemma

Proof step 83 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n0. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n0. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf(0) + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s)

Proof step 84 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n0. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n0. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ , ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(2 + n), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: to-succ2-nf, seq: ⊦ nf.take(n + 2) = nf(0) + (λ n. nf(n + 1)).take(n + 1), subst:[nf, n] → [pcsf, n]; ['a] → [('s, 'cs)], <all paths>

Additional information

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

Proof step 85 from proof repl-size (previous step) (back to tree)

⊦ nf.take(n + 2) = nf(0) + (λ n. nf(n + 1)).take(n + 1)

A spec-lemma

Proof step 86 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n0. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n0. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf(0) + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s)

Proof step 87 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n0. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) ≠ # lim(⌜λ n0. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n0 + 1), paf.take(n0), ⌜as '⌝ + aσ0, aα)⌝ ⌝ ) + ⌜1⌝ , frag(IOAut(astart, astep, aext))(⌜as '⌝ + aσ0, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, (pcsf(0)._1, pcsf(0)._2) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ , ¬ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n), paf.take(n), ⌜as '⌝ + aσ0, aα)⌝ ⊑ ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf(0) ' + (λ n. pcsf(n + 1)).take(n + 1), paf.take(n + 1), ⌜as '⌝ + aσ0, aα)⌝ ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

term: pcsf(0)._1

Additional information

Used terms: s, cs

Proof step 88 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:repl-fin-size, seq:⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ frag* (IOAut (Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren))) (pcsl, pal) ∧ frag(IOAut(astart, astep, aext))(aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜pcsl⌝ , ⌜pal⌝ )) ⊑ aext !(aα) → # repls(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα) = # repla(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα) + 1, subst:[astep, pal, cext, aα, start, aσ, ext, cren, ren, astart, cstart, cstep, aren, pcsl, aext, step] → [astep, paf.take(n), cext, aα, start, aσ, ext, cren, ren, astart, cstart, cstep, aren, pcsf.take(n + 1), aext, step]; ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as] → ['ca, 'cs, 'a, 'aa, 'pa, 'e, 's, 'as]

Additional information

Used terms: aren, ren, ext, astep, astart, paf.take(n), step, aext, cstart, cren, cstep, aα, pcsf.take(n + 1), start, aσ, cext

Proof step 89 from proof repl-size (previous step) (back to tree)

⊦ nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ frag*(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsl, pal) ∧ frag(IOAut(astart, astep, aext))(aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜pcsl⌝ , ⌜pal⌝ )) ⊑ aext !(aα) → # repls(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα) = # repla(step, cstep, cren, ren, aren, cext, aext, pcsl, pal, aσ, aα) + 1

Lemma repl-fin-size

Proof step 90 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), nounsharedextR(cren, cext, ren) ∧ Πok(ext, cext, ren, cren) ∧ frag*(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf.take(n + 1), paf.take(n)) ∧ frag(IOAut(astart, astep, aext))(aσ, aα) ∧ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα) → # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) = # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 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 ⊦ fragω(IOAut(start, step, ext))(sf, af) → (frag*(IOAut(start, step, ext))(sf.take(n + 1), af.take(n)) ↔ true); (ss)

Proof step 91 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(πra(step, cstep, ren, cren, ⌜pcsf⌝ , ⌜paf⌝ )) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: project-right, name: projaction-inf-def, seq:⊦ πra(lstep, rstep, lren, rren, ⌜psf⌝ , ⌜paf⌝ ) = lim(⌜λ n. ⌜πra(lstep, rstep, lren, rren, psf.take(n + 1), paf.take(n))⌝ ⌝ ), subst:[psf, lstep, paf, rren, lren, rstep] → [pcsf, step, paf, cren, ren, cstep]; ['ls, 'ra, 'la, 'pa, 'rs] → ['s, 'ca, 'a, 'pa, 'cs], <all paths>

Additional information

Used terms: paf, cstep, ren, cren, step, pcsf

Proof step 92 from proof repl-size (previous step) (back to tree)

⊦ πra(lstep, rstep, lren, rren, ⌜psf⌝ , ⌜paf⌝ ) = lim(⌜λ n. ⌜πra(lstep, rstep, lren, rren, psf.take(n + 1), paf.take(n))⌝ ⌝ )

A spec-lemma

Proof step 93 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: streamseq-mon-lim, name:lim-def, seq:⊦ mon(σσ) ∧ σσ ≠ [] → (∀ n. ⌜n⌝ < # σσ → σσ[n] ⊑ lim(σσ)) ∧ (∀ m. ¬ # lim(σσ) < ⌜m⌝ → (∃ n. ⌜n⌝ < # σσ ∧ ⌜lim(σσ).take(m)⌝ ⊑ σσ[n])), subst:[σσ] → [⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ]; ['a] → ['ca]

Additional information

Used terms: ⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝

Proof step 94 from proof repl-size (previous step) (back to tree)

⊦ mon(σσ) ∧ σσ ≠ [] → (∀ n. ⌜n⌝ < # σσ → σσ[n] ⊑ lim(σσ)) ∧ (∀ m. ¬ # lim(σσ) < ⌜m⌝ → (∃ n. ⌜n⌝ < # σσ ∧ ⌜lim(σσ).take(m)⌝ ⊑ σσ[n]))

A spec-lemma

Proof step 95 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα), mon(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) ∧ ⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ≠ [] → (∀ n. ⌜n⌝ < # ⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ → ⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ [n] ⊑ lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ∧ (∀ m. ¬ # lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) < ⌜m⌝ → (∃ n. ⌜n⌝ < # ⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ∧ ⌜lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ).take(m)⌝ ⊑ ⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ [n])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ [] ≠ ⌜nf⌝ ; (s)

Proof step 96 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα), mon(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) → (∀ n0. ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ⊑ lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ∧ (∀ m. ¬ # lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) < ⌜m⌝ → (∃ n0. ⌜lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ )) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 97 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ¬ mon(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: project-right, name: mon-pia, seq:⊦ fragω(Π(IOAut(lstart, lstep, lext), IOAut(rstart, rstep, rext), lren, rren)) (psf, paf) → mon(⌜λ n. ⌜πra(lstep, rstep, lren, rren, psf.take(n + 1), paf.take(n))⌝ ⌝ ), subst:[psf, lstart, rstart, rext, lstep, paf, rren, lren, lext, rstep] → [pcsf, start, cstart, cext, step, paf, cren, ren, ext, cstep]; ['ls, 'ra, 'la, 'pa, 'rs, 'e] → ['s, 'ca, 'a, 'pa, 'cs, 'e], <all paths>

Additional information

Used simplifier rules: ⊦ Π(IOAut(lstart, lstep, lext), IOAut(rstart, rstep, rext), lren, rren) = IOAut (Π(lstart, rstart), Π(lstep, rstep, lren, rren, lext, rext), Π(lext, rext, lren, rren)); (s) Used terms: cext, paf, cstep, cstart, ren, cren, start, step, pcsf, ext

Proof step 98 from proof repl-size (previous step) (back to tree)

⊦ fragω(Π(IOAut(lstart, lstep, lext), IOAut(rstart, rstep, rext), lren, rren))(psf, paf) → mon(⌜λ n. ⌜πra(lstep, rstep, lren, rren, psf.take(n + 1), paf.take(n))⌝ ⌝ )

A spec-lemma

Proof step 99 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα), ∀ n0. ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ⊑ lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), ∀ m. ¬ # lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) < ⌜m⌝ → (∃ n0. ⌜lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: n abort: F discard: T computed: F

Additional information

Used terms: n

Proof step 100 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⊑ lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα), ∀ m. ¬ # lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) < ⌜m⌝ → (∃ n0. ⌜lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: prefix-def, seq: ⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0), subst:[σ, σ0] → [⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ , lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )]; ['a] → ['ca], <all paths>

Additional information

Used terms: ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ , lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )

Proof step 101 from proof repl-size (previous step) (back to tree)

⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0)

A spec-lemma

Proof step 102 from proof repl-size (previous step) (back to tree)

# lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), cext !(lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ )) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα), ∀ m. ¬ # lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) < ⌜m⌝ → (∃ n0. ⌜lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ), ∃ σ1. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + σ1 = lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ) ⊦

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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ext !(⌜al⌝ + α2) = ⌜ext !(al)⌝ + ext !(α2); (s)

Proof step 103 from proof repl-size (previous step) (back to tree)

⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα = lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα) ⊑ aext !(aα), ¬ cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) ⊑ aext !(aα), ∀ m. ¬ ⌜# πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + # cα < ⌜m⌝ → (∃ n0. ⌜(⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: prefix-def, seq: ⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0), subst:[σ, σ0] → [cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )), aext !(aα)]; ['a] → ['e], <all paths>

Additional information

Used terms: cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )), aext !(aα)

Proof step 104 from proof repl-size (previous step) (back to tree)

⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0)

A spec-lemma

Proof step 105 from proof repl-size (previous step) (back to tree)

⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα = lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα) ⊑ aext !(aα), ∀ m. ¬ ⌜# πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + # cα < ⌜m⌝ → (∃ n0. ⌜(⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ), ∀ σ1. cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) + σ1 ≠ aext !(aα) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name: prefix-def, seq: ⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0), subst:[σ, σ0] → [ ⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα), aext !(aα)]; ['a] → ['e], <all paths>

Additional information

Used terms: ⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα), aext !(aα)

Proof step 106 from proof repl-size (previous step) (back to tree)

⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0)

A spec-lemma

Proof step 107 from proof repl-size (previous step) (back to tree)

⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα = lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ∀ σ1. cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) + σ1 ≠ aext !(aα), ∀ m. ¬ ⌜# πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + # cα < ⌜m⌝ → (∃ n0. ⌜(⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ), ∃ σ1. (⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα)) + σ1 = aext !(aα) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 108 from proof repl-size (previous step) (back to tree)

(⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα)) + β = aext !(aα), ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα = lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ∀ m. ¬ ⌜# πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + # cα < ⌜m⌝ → (∃ n0. ⌜(⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ), ∀ σ1. cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) + σ1 ≠ aext !(aα) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: cext !(cα) + β abort: F discard: T computed: F

Additional information

Used terms: cext !(cα) + β

Proof step 109 from proof repl-size (previous step) (back to tree)

⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα = lim(⌜λ n. ⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ ⌝ ), (⌜cext !(πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n)))⌝ + cext !(cα)) + β = aext !(aα), # lim(⌜λ n. ⌜repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) ≠ # lim(⌜λ n. ⌜repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα)⌝ ⌝ ) + ⌜1⌝ , cext !(πra(step, cstep, ren, cren, ⌜pcsf.take(n + 1)⌝ , ⌜paf.take(n)⌝ )) + cext !(cα) + β ≠ aext !(aα), # repla(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα) + 1 ≠ # repls(step, cstep, cren, ren, aren, cext, aext, pcsf.take(n + 1), paf.take(n), aσ, aα), frag(IOAut(astart, astep, aext))(aσ, aα), fragω(IOAut(Π(start, cstart), Π(step, cstep, ren, cren, ext, cext), Π(ext, cext, ren, cren)))(pcsf, paf), nounsharedextR(cren, cext, ren), Πok(ext, cext, ren, cren), ∀ m. ¬ ⌜# πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + # cα < ⌜m⌝ → (∃ n0. ⌜(⌜πra(step, cstep, ren, cren, pcsf.take(n + 1), paf.take(n))⌝ + cα).take(m)⌝ ⊑ ⌜πra(step, cstep, ren, cren, pcsf.take(n0 + 1), paf.take(n0))⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: project-right, name: projaction-fin-def, seq:⊦ # psl = # pal + 1 → πra(lstep, rstep, lren, rren, ⌜psl⌝ , ⌜pal⌝ ) = ⌜πra(lstep, rstep, lren, rren, psl, pal)⌝ , subst:[pal, lstep, lren, rstep, rren, psl] → [paf.take(n), step, ren, cstep, cren, pcsf.take(n + 1)]; ['ls, 'ra, 'la, 'pa, 'rs] → ['s, 'ca, 'a, 'pa, 'cs], <all paths>

Additional information

Used simplifier rules: ⊦ # nf.take(n) = n; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ext !(⌜al⌝ ) = ⌜ext !(al)⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream Used terms: pcsf.take(n + 1), paf.take(n), cstep, ren, cren, step

Proof step 110 from proof repl-size (previous step) (back to tree)

⊦ # psl = # pal + 1 → πra(lstep, rstep, lren, rren, ⌜psl⌝ , ⌜pal⌝ ) = ⌜πra(lstep, rstep, lren, rren, psl, pal)⌝

A spec-lemma

Proof Tree for repl-size (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