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

startf(sf(0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ trace(IOAut(startf, stepf))(⌜af⌝ ^)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ n. ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

Additional information

Used formulas: ∀ n. ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

Proof step 3 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n. ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1) ⊦

User applied rule choice left

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 4 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: infinite-append[actionstream], name:infinite-append, seq:⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → lf(m) = [] ∧ ii(m) = ii(n)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ), subst:[lf] → [f_n->actionlist]

Additional information

Used terms: f_n->actionlist

Proof step 5 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 6 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∃ α, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(α) ⊃ ∃ n. # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: infinite-append[IOstatestream], name:infinite-append-butlast, seq:∀ n. lf(n).last = hd(lf(n + 1)) ∧ lf(n) ≠ [] ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → tl(lf(m)) = [] ∧ ii(m) = ii(n)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ), subst:[lf] → [f_n->statelist]

Additional information

Used terms: f_n->statelist

Proof step 8 from proof infappend-moves (previous step) (back to tree)

∀ n. lf(n).last = hd(lf(n + 1)) ∧ lf(n) ≠ [] ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → tl(lf(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))

A spec-lemma

Proof step 9 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦ ∀ n. f_n->statelist(n).last = hd(f_n->statelist(n + 1)) ∧ f_n->statelist(n) ≠ []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ f_n->statelist(n0).last = hd(f_n->statelist(n0 + 1)) ∧ f_n->statelist(n0) ≠ []

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[IOstatestream], name:elim-1, seq: ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail), subst:[x, head, tail] → [f_n->statelist(n0 + 1), head, x0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: f_n->statelist(n0 + 1), head, tail

Proof step 11 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0 + 1) = [], ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦ f_n->statelist(n0).last = hd(f_n->statelist(n0 + 1)) ∧ f_n->statelist(n0) ≠ []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 12 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0 + 1) = [], ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ f_n->statelist(n0).last = hd([]) ∧ f_n->statelist(n0) ≠ []

User applied rule all left

And closed the goal!

Rule argument

pos: left 8 terms: n0 + 1 abort: F discard: F computed: F

Additional information

Used simplifier rules: not-frag-empty: ⊦ ¬ frag(IOAut(startf, stepf))([], α); c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜[]⌝ = []; (s) Used terms: n0 + 1

Proof step 13 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0 + 1) = head + x0, ii(0) = 0, f_n->statelist(n0 + 1) ≠ [], startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦ f_n->statelist(n0).last = head ∧ f_n->statelist(n0) ≠ []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ a + x = a ' + x; (s)

Proof step 14 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0 + 1) = head ' + x0, ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ f_n->statelist(n0).last = head ∧ f_n->statelist(n0) ≠ []

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 15 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, f_n->statelist(n0 + 1) = head ' + x0, ii(0) = 0, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦ f_n->statelist(n0).last = head ∧ f_n->statelist(n0) ≠ []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, f_n->statelist(n0 + 1) = head ' + x0, ii(0) = 0, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ sf(n0 + 1) = head ∧ f_n->statelist(n0) ≠ []

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: not-frag-empty: ⊦ ¬ frag(IOAut(startf, stepf))([], α); ⊦ ⌜[]⌝ = []; (s)

Proof step 17 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, f_n->statelist(n0 + 1) = head ' + x0, ii(0) = 0, sf(n0 + 1) ≠ head, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: n0 + 1 abort: F discard: T computed: T

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 ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: n0 + 1

Proof step 18 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # f_n->statelist(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → tl(f_n->statelist(m)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 19 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:trace, seq:⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)), subst:[α, stepf, startf] → [⌜af⌝ ^, stepf, startf], <all paths>

Additional information

Used terms: ⌜af⌝ ^, stepf, startf

Proof step 20 from proof infappend-moves (previous step) (back to tree)

⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))

Lemma trace

Proof step 21 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ σ, β. ¬(⌜af⌝ ^ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: exec: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]);

Proof step 22 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ σ0, β. ⌜af⌝ ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ii = ii0

Additional information

Used formulas: ii = ii0

Proof step 23 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii = ii0, ii0(0) = 0, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ σ0, β. ⌜af⌝ ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 24 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ σ0, β. ⌜af⌝ ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: σ, α abort: F discard: T computed: F

Additional information

Used terms: σ, α

Proof step 25 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ⌜af⌝ ^ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 26 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ α ^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∀ n. ⌜af to n⌝ ^ = (α to ii0(n))^

Additional information

Used formulas: ∀ n. ⌜af to n⌝ ^ = (α to ii0(n))^

Proof step 27 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ α ^, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ⌜af to n⌝ ^ = (α to ii0(n))^ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 28 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, startf(sf(0)), (finp(⌜al⌝ ) ⊃ # ⌜al⌝ = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ⌜af to n⌝ ^ = (⌜al⌝ to ii0(n))^, ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # ⌜al⌝ < ⌜ii0(n + 1)⌝ ∧ (⌜al⌝ from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)

Proof step 29 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜al to ii0(n1)⌝ ^, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 30 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), ⌜af to n⌝ ^ = ⌜al to ii0(n)⌝ ^, ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 31 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), ⌜af to n⌝ ^ = ⌜al⌝ ^, ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) Used terms: n, ⌜af⌝

Proof step 32 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 33 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), ⌜af to n⌝ ^ = ⌜al⌝ ^, ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦ ¬ # ⌜af⌝ < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 34 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), ⌜af to n⌝ ^ = ⌜al⌝ ^, ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, af(n1) ≠ τ, startf(sf(0)), n ≤ n1, (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: n1 abort: F discard: T computed: F

Additional information

Used terms: n1

Proof step 35 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), f_n->statelist(n1).last = sf(n1 + 1), f_n->statelist(n1)[0] = sf(n1), ⌜af to n⌝ ^ = ⌜al⌝ ^, ⌜f_n->actionlist(n1)⌝ ^ = ⌜af(n1) '⌝ ^, ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, af(n1) ≠ τ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n1)⌝ , ⌜f_n->actionlist(n1)⌝ ), startf(sf(0)), n ≤ n1, (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s)

Proof step 36 from proof infappend-moves (previous step) (back to tree)

# al = ii0(n), f_n->statelist(n1).last = sf(n1 + 1), f_n->statelist(n1)[0] = sf(n1), ⌜af to n⌝ ^ = ⌜al⌝ ^, ⌜f_n->actionlist(n1)⌝ ^ = ⌜af(n1) '⌝ , ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜al⌝ ^, af(n1) ≠ τ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n1)⌝ , ⌜f_n->actionlist(n1)⌝ ), startf(sf(0)), n ≤ n1, (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 17 terms: n1 abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) Used terms: n1

Proof step 37 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜af0⌝ ^, startf(sf(0)), (finp(⌜af0⌝ ) ⊃ # ⌜af0⌝ = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ⌜af to n⌝ ^ = (⌜af0⌝ to ii0(n))^, ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # ⌜af0⌝ < ⌜ii0(n + 1)⌝ ∧ (⌜af0⌝ from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

Proof step 38 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-equiv, seq:¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^), subst:[af0, af] → [af0, af], <all paths>

Additional information

Used terms: af0, af

Proof step 39 from proof infappend-moves (previous step) (back to tree)

¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^)

A spec-lemma

Proof step 40 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ ⌜af0⌝ ^, finp(⌜af⌝ ^), startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]

Proof step 41 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-inf, seq: ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ), subst:[af] → [af]

Additional information

Used terms: af

Proof step 42 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 43 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)

Proof step 44 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ⌜af⌝ , n

Proof step 45 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 46 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦ ¬ # ⌜af⌝ < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 47 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af⌝ ^, af(n1) ≠ τ, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), n ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 15 terms: n1

Additional information

Used terms: n1

Proof step 48 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = (⌜af⌝ to n)^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), ¬ # ⌜af⌝ < ⌜n⌝ , finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. n ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 49 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af to n⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 50 from proof infappend-moves (previous step) (back to tree)

⌜af to n⌝ ^ = ⌜af0 to ii0(n)⌝ ^, ii0(0) = 0, ⌜al⌝ = ⌜af to n⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 51 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) Used terms: ⌜af0⌝ , ii0(n)

Proof step 52 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 53 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦ ¬ # ⌜af0⌝ < ⌜ii0(n)⌝ ∧ (∀ m. ii0(n) ≤ m ∧ ⌜m⌝ < # ⌜af0⌝ → ⌜af0⌝ [m] = τ)

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) ⊦ ¬ ∞ < n∞; (s)

Proof step 54 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n1

Proof step 55 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, ⌜al⌝ ≠ ⌜af0⌝ ^, startf(sf(0)), ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 56 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n) ≤ n1, ii0(n2) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 17 terms: n2 abort: F discard: T computed: F

Additional information

Used terms: n2

Proof step 57 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, ⌜al⌝ ≠ ⌜af0⌝ ^, n1 < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic

Proof step 58 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 17 terms: n2 abort: F discard: T computed: F

Additional information

Used terms: n2

Proof step 59 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n1 < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ii0(n2) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 60 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 22 terms: n2 abort: F discard: F computed: F

Additional information

Used terms: n2

Proof step 61 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n1 < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ii0(n2) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), n ≤ n2 → af(n2) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 19

Additional information

Proof step 62 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, ¬ n ≤ n2, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 63 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n2 < n, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 21 terms: n2 + 1, n

Additional information

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

Proof step 64 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, af(n2) = τ, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)

Proof step 65 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[y, x] → [f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2)], <all paths>

Additional information

Used terms: f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2)

Proof step 66 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 67 from proof infappend-moves (previous step) (back to tree)

#((af0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n1 < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ii0(n2) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. n < #((af0 from ii0(n2)) to # f_n->actionlist(n2)) → ((af0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)

Proof step 68 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ, ∀ n3. n3 < # f_n->actionlist(n2) → af0(n3 + ii0(n2)) = f_n->actionlist(n2)[n3] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 23 terms: n1 - ii0(n2) abort: F discard: T computed: F

Additional information

Used terms: n1 - ii0(n2)

Proof step 69 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n1 < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ii0(n2) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), n1 - ii0(n2) < # f_n->actionlist(n2) → af0((n1 - ii0(n2)) + ii0(n2)) = f_n->actionlist(n2)[n1 - ii0(n2)], ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

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

Proof step 70 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, af0((n1 - ii0(n2)) + ii0(n2)) = f_n->actionlist(n2)[n1 - ii0(n2)], ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n1 < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ii0(n2) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [n1, ii0(n2), n3]

Additional information

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

Proof step 71 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, af0(n3 + ii0(n2)) = f_n->actionlist(n2)[n3], ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), n1 = n3 + ii0(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, af0(n1) ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ii0(n) ≤ n1, finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ m + n; (s)

Proof step 72 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = [], af(n2) = τ, af0(n3 + ii0(n2)) = f_n->actionlist(n2)[n3], ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, f_n->actionlist(n2)[n3] ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n3 < # f_n->actionlist(n2), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n3 + ii0(n2), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-empty-equiv, seq: ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ), subst:[α] → [⌜f_n->actionlist(n2)⌝ ], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(n2)⌝

Proof step 73 from proof infappend-moves (previous step) (back to tree)

⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)

A spec-lemma

Proof step 74 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), af(n2) = τ, af0(n3 + ii0(n2)) = f_n->actionlist(n2)[n3], ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, f_n->actionlist(n2)[n3] ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, ii0(n2) < ii0(n2 + 1), ii0(n) < ii0(n2 + 1), n3 < # f_n->actionlist(n2), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n3 + ii0(n2), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < # ⌜f_n->actionlist(n2)⌝ → ⌜f_n->actionlist(n2)⌝ [n] = τ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 75 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), af(n2) = τ, af0(n3 + ii0(n2)) = f_n->actionlist(n2)[n3], ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ⌜al⌝ = ⌜af0 to ii0(n)⌝ ^, f_n->actionlist(n2)[n3] ≠ τ, f_n->actionlist(n2) ≠ [], ⌜al⌝ ≠ ⌜af0⌝ ^, n3 < # f_n->actionlist(n2), ii0(n) < ii0(n2 + 1), ii0(n2) < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n) ≤ n3 + ii0(n2), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ m. n ≤ m → af(m) = τ, ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. n1 < # f_n->actionlist(n2) → f_n->actionlist(n2)[n1] = τ ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: n3

Additional information

Used terms: n3

Proof step 76 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), ¬ finp(⌜af⌝ ^), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∃ n. ¬(∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 77 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af1⌝ = ⌜af⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ii0(n) abort: F discard: T computed: F

Additional information

Used terms: ii0(n)

Proof step 78 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af1⌝ = ⌜af⌝ ^, ⌜af to n⌝ ^ ≠ ⌜af0 to ii0(n)⌝ ^, startf(sf(0)), finp(σ) → # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ⌜af to n1⌝ ^ = ⌜af0 to ii0(n1)⌝ ^, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: n

Additional information

Used terms: n

Proof step 79 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af⌝ ^ ≠ α ^, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦ ∀ n. ⌜af to n⌝ ^ = (α to ii0(n))^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 80 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af to n1⌝ ^ ≠ (α to ii0(n1))^, ⌜af⌝ ^ ≠ α ^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 3, left 6

Additional information

Proof step 81 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af to n1⌝ ^ ≠ (α to ii0(n1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n1

Additional information

Used simplifier rules: nat freely generated by 0, +1;; ⊦ nf to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ σ to 0 = []; (s) ⊦ [] ^ = []; (s)

Proof step 82 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af to n0 +1⌝ ^ ≠ (α to ii0(n0 +1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ ii0, af, α, startf, sf, n, f_n->actionlist, stepf, f_n->statelist, σ. ¬ ( ii0(0) = 0 ∧ ⌜af to n0⌝ ^ ≠ (α to ii0(n0))^ ∧ startf(sf(0)) ∧ (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)) ∧ (∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1))) ∧ (∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1)) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∧ (∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ) ∧ (∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 83 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af to n0 + 1⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ ii, af0, α0, startf0, sf0, n1, f_n->actionlist0, stepf0, f_n->statelist0, σ0. ii(0) ≠ 0 ∨ ⌜af0 to n0⌝ ^ = (α0 to ii(n0))^ ∨ ¬ startf0(sf0(0)) ∨ ¬ (finp(α0) ⊃ # α0 = ⌜ii(n1)⌝ ∧ (∀ m. n1 ≤ m → f_n->actionlist0(m) = [] ∧ ii(m) = ii(n1));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ∨ ¬(∀ n. move(IOAut(startf0, stepf0))(sf0(n), ⌜af0(n) '⌝ ^, sf0(n + 1))) ∨ ¬ (∀ n0. frag(IOAut(startf0, stepf0))(⌜f_n->statelist0(n0)⌝ , ⌜f_n->actionlist0(n0)⌝ ) ∧ ⌜f_n->actionlist0(n0)⌝ ^ = ⌜af0(n0) '⌝ ^ ∧ f_n->statelist0(n0)[0] = sf0(n0) ∧ f_n->statelist0(n0).last = sf0(n0 + 1)) ∨ ¬(∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # f_n->actionlist0(n) ∧ ¬ # α0 < ⌜ii(n + 1)⌝ ∧ (α0 from ii(n)) to # f_n->actionlist0(n) = ⌜f_n->actionlist0(n)⌝ ) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # f_n->statelist0(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ0 ∧ (σ0 from ii(n)) to # f_n->statelist0(n) = ⌜f_n->statelist0(n)⌝ ) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: ii0, af, α, startf, sf, n, f_n->actionlist, stepf, f_n->statelist, σ abort: F discard: T computed: T

Additional information

Used terms: ii0, af, α, startf, sf, n, f_n->actionlist, stepf, f_n->statelist, σ

Proof step 84 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ⌜af to n0 + 1⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ii0(0) ≠ 0 ∨ ⌜af to n0⌝ ^ = (α to ii0(n0))^ ∨ ¬ startf(sf(0)) ∨ ¬ (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)) ∨ ¬(∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1))) ∨ ¬ (∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1)) ∨ ¬(∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 85 from proof infappend-moves (previous step) (back to tree)

⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(0) = 0, ⌜af to n0 + 1⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-unwind-end-inf, seq: ⊦ nf to m + 1 = (nf to m) + nf(m) ', subst:[m, nf] → [n0, af], <all paths>

Additional information

Used terms: n0, af

Proof step 86 from proof infappend-moves (previous step) (back to tree)

⊦ nf to m + 1 = (nf to m) + nf(m) '

A spec-lemma

Proof step 87 from proof infappend-moves (previous step) (back to tree)

⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(0) = 0, ⌜(af to n0) + af(n0) '⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

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[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 88 from proof infappend-moves (previous step) (back to tree)

⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(0) = 0, (α to ii0(n0))^ + ⌜af(n0) '⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 89 from proof infappend-moves (previous step) (back to tree)

⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜af(n0) '⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 90 from proof infappend-moves (previous step) (back to tree)

⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜af(n0) '⌝ ^ ≠ (α to ii0(n0 + 1))^, startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: n0 abort: F discard: T computed: F

Additional information

Used terms: n0

Proof step 91 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜af(n0) '⌝ ^ ≠ (α to ii0(n0 + 1))^, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 92 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 15 terms: n0 abort: F discard: T computed: F

Additional information

Used terms: n0

Proof step 93 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 94 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: α to ii0(n0 + 1) = (α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0))

Additional information

Used formulas: α to ii0(n0 + 1) = (α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0))

Proof step 95 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , α to ii0(n0 + 1) = (α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0)), (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 96 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, α to ii0(n0 + 1) = (α to ii0(n0)) + ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ ((α to ii0(n0)) + ⌜f_n->actionlist(n0)⌝ )^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-append-fin, seq: ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^, subst:[α2, α1] → [⌜f_n->actionlist(n0)⌝ , α to ii0(n0)], <all paths>

Additional information

Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: ⌜f_n->actionlist(n0)⌝ , α to ii0(n0)

Proof step 97 from proof infappend-moves (previous step) (back to tree)

⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^

A spec-lemma

Proof step 98 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α to ii0(n0 + 1) ≠ (α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0)), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [(α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0)), α to ii0(n0 + 1)], <all paths>

Additional information

Used terms: (α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0)), α to ii0(n0 + 1)

Proof step 99 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 100 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), #(α to ii0(n0 + 1)) ≠ #((α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0))) ∨ (∃ n. ¬(⌜n⌝ < #(α to ii0(n0 + 1)) → (α to ii0(n0 + 1))[n] = ((α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0)))[n])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 101 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ⌜ii0(n0 + 1)⌝ ≠ #(α to ii0(n0)) + ⌜# f_n->actionlist(n0)⌝ ∨ ¬(n1 < ii0(n0 + 1) → α[n1] = ((α to ii0(n0)) + ⌜f_n->actionlist(n0)⌝ )[n1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:size-to, seq:¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ , subst:[n, σ] → [ii0(n0), α], <all paths>

Additional information

Used simplifier rules: lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: ii0(n0), α

Proof step 102 from proof infappend-moves (previous step) (back to tree)

¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝

A spec-lemma

Proof step 103 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0)⌝ , ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ⌜ii0(n0 + 1)⌝ ≠ ⌜ii0(n0)⌝ + ⌜# f_n->actionlist(n0)⌝ ∨ ¬(n1 < ii0(n0 + 1) → α[n1] = ((α to ii0(n0)) + ⌜f_n->actionlist(n0)⌝ )[n1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 104 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n1] ≠ ((α to ii0(n0)) + ⌜f_n->actionlist(n0)⌝ )[n1], n1 < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-ls, seq: ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m], subst:[m, σ1, σ] → [n1, ⌜f_n->actionlist(n0)⌝ , α to ii0(n0)], <all paths>

Additional information

Used simplifier rules: ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) Used terms: n1, ⌜f_n->actionlist(n0)⌝ , α to ii0(n0)

Proof step 105 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 106 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n1] ≠ ((α to ii0(n0)) + ⌜f_n->actionlist(n0)⌝ )[n1], ⌜ii0(n0 + 1)⌝ < # σ, n1 < ii0(n0 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ ⌜n1⌝ < #(α to ii0(n0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

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 ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)

Proof step 107 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n1] ≠ f_n->actionlist(n0)[n1 - ii0(n0)], f_n->actionlist(n0) ≠ [], n1 < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, ii0(n0) < ii0(n0 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0) ≤ n1, ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [n1, ii0(n0), n2]

Additional information

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

Proof step 108 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, n1 = n2 + ii0(n0), (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n1] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], ii0(n0) < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, n1 < ii0(n0 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0) ≤ n1, ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ m + n; (s)

Proof step 109 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], n2 < # f_n->actionlist(n0), ⌜ii0(n0 + 1)⌝ < # σ, ii0(n0) < ii0(n0 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜f_n->actionlist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0)], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0)

Proof step 110 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 111 from proof infappend-moves (previous step) (back to tree)

#((α from ii0(n0)) to # f_n->actionlist(n0)) = # ⌜f_n->actionlist(n0)⌝ , f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], ii0(n0) < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, n2 < # f_n->actionlist(n0), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ⌜n⌝ < #((α from ii0(n0)) to # f_n->actionlist(n0)) → ((α from ii0(n0)) to # f_n->actionlist(n0))[n] = ⌜f_n->actionlist(n0)⌝ [n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 112 from proof infappend-moves (previous step) (back to tree)

#((α from ii0(n0)) to # f_n->actionlist(n0)) = ⌜# f_n->actionlist(n0)⌝ , f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], ii0(n0) < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, n2 < # f_n->actionlist(n0), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0)⌝ , ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. n1 < # f_n->actionlist(n0) → ((α from ii0(n0)) to # f_n->actionlist(n0))[n1] = f_n->actionlist(n0)[n1] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 23 terms: n2 abort: F discard: T computed: T

Additional information

Used terms: n2

Proof step 113 from proof infappend-moves (previous step) (back to tree)

#((α from ii0(n0)) to # f_n->actionlist(n0)) = ⌜# f_n->actionlist(n0)⌝ , f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], n2 < # f_n->actionlist(n0), ⌜ii0(n0 + 1)⌝ < # σ, ii0(n0) < ii0(n0 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0)⌝ , ¬ # α < ⌜ii0(n0 + 1)⌝ , n2 < # f_n->actionlist(n0) → ((α from ii0(n0)) to # f_n->actionlist(n0))[n2] = f_n->actionlist(n0)[n2], (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 114 from proof infappend-moves (previous step) (back to tree)

#((α from ii0(n0)) to # f_n->actionlist(n0)) = ⌜# f_n->actionlist(n0)⌝ , f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ((α from ii0(n0)) to # f_n->actionlist(n0))[n2] = f_n->actionlist(n0)[n2], ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], ii0(n0) < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, n2 < # f_n->actionlist(n0), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0)⌝ , ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-to, seq:m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m], subst:[m, n, σ] → [n2, # f_n->actionlist(n0), α from ii0(n0)], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ # σ < ⌜n⌝ → (#(σ from n) < ⌜n0⌝ ↔ # σ < ⌜n + n0⌝ ); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ m < m + n ↔ n ≠ 0; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ m < n → n ≠ 0; (s) ⊦ m +1 = m + 1; (s) ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic ⊦ m < n → ¬ n < m; (s) Used terms: n2, # f_n->actionlist(n0), α from ii0(n0)

Proof step 115 from proof infappend-moves (previous step) (back to tree)

m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]

A spec-lemma

Proof step 116 from proof infappend-moves (previous step) (back to tree)

#((α from ii0(n0)) to # f_n->actionlist(n0)) = ⌜# f_n->actionlist(n0)⌝ , f_n->statelist(n0).last = sf(n0 + 1), (α from ii0(n0))[n2] = f_n->actionlist(n0)[n2], f_n->statelist(n0)[0] = sf(n0), ⌜af to n0⌝ ^ = (α to ii0(n0))^, ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], ⌜ii0(n0 + 1)⌝ < # σ, ii0(n0) < ii0(n0 + 1), n2 < # f_n->actionlist(n0), frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ #(α from ii0(n0)) < ⌜# f_n->actionlist(n0)⌝ , ¬ # α < ⌜ii0(n0)⌝ , ¬ # α < ⌜ii0(n0 + 1)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ¬ # σ < ⌜n⌝ → (#(σ from n) < ⌜n0⌝ ↔ # σ < ⌜n + n0⌝ ); (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ¬ n∞ < n∞; (s) lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf

Proof step 117 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), (α from ii0(n0))[n2] = f_n->actionlist(n0)[n2], ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ⌜af to n0⌝ ^ = (α to ii0(n0))^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α to ii0(n0))^ + ⌜f_n->actionlist(n0)⌝ ^ ≠ (α to ii0(n0 + 1))^, α[n2 + ii0(n0)] ≠ f_n->actionlist(n0)[n2], f_n->actionlist(n0) ≠ [], n2 < # f_n->actionlist(n0), ii0(n0) < ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(n0)⌝ , ¬ # α < ⌜ii0(n0 + 1)⌝ , ¬ # α < ⌜ii0(n0)⌝ + ⌜# f_n->actionlist(n0)⌝ , (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m < n → (n ≤ m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 118 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), ¬ frag(IOAut(startf, stepf))(σ, α), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [α, σ, stepf, startf], <all paths>

Additional information

Used terms: α, σ, stepf, startf

Proof step 119 from proof infappend-moves (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 120 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , # σ ≠ # α + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # α → stepf(σ[n], α[n], σ[n +1]))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 121 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), # σ ≠ # α + ⌜1⌝ ∨ ¬(⌜n1⌝ < # α → stepf(σ[n1], α[n1], σ[n1 + 1])) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: # σ = # α + ⌜1⌝

Additional information

Used formulas: # σ = # α + ⌜1⌝

Proof step 122 from proof infappend-moves (previous step) (back to tree)

# σ = # α + ⌜1⌝ , ii0(0) = 0, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , # σ ≠ # α + ⌜1⌝ ∨ ¬(⌜n1⌝ < # α → stepf(σ[n1], α[n1], σ[n1 + 1])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 123 from proof infappend-moves (previous step) (back to tree)

# σ = # α + ⌜1⌝ , ii0(0) = 0, ⌜n1⌝ < # α, startf(sf(0)), ¬ stepf(σ[n1], α[n1], σ[n1 + 1]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 124 from proof infappend-moves (previous step) (back to tree)

# σ = # α + ⌜1⌝ , ii0(0) = 0, α = ⌜al0⌝ , ⌜n1⌝ < # α, startf(sf(0)), ¬ stepf(σ[n1], α[n1], σ[n1 + 1]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

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⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ m < n → n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s) ⊦ ⌜x⌝ [n] = x[n]; (s)

Proof step 125 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , ii0(0) = 0, n1 < ii0(n), startf(sf(0)), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

Additional information

Used formulas: ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

Proof step 126 from proof infappend-moves (previous step) (back to tree)

# σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), ii0(0) = 0, n1 < ii0(n), startf(sf(0)), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 127 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , ii0(0) = 0, n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), startf(sf(0)), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 14 terms: n2 abort: F discard: T computed: F

Additional information

Used terms: n2

Proof step 128 from proof infappend-moves (previous step) (back to tree)

# σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 129 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), frag(IOAut(startf, stepf))(⌜f_n->statelist(n2)⌝ , ⌜f_n->actionlist(n2)⌝ ), startf(sf(0)), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜f_n->actionlist(n2)⌝ , ⌜f_n->statelist(n2)⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(n2)⌝ , ⌜f_n->statelist(n2)⌝ , stepf, startf

Proof step 130 from proof infappend-moves (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 131 from proof infappend-moves (previous step) (back to tree)

# ⌜f_n->statelist(n2)⌝ = # ⌜f_n->actionlist(n2)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. ⌜n⌝ < # ⌜f_n->actionlist(n2)⌝ → stepf(⌜f_n->statelist(n2)⌝ [n], ⌜f_n->actionlist(n2)⌝ [n], ⌜f_n->statelist(n2)⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 132 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), startf(sf(0)), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 19 terms: n2 abort: F discard: T computed: F

Additional information

Used terms: n2

Proof step 133 from proof infappend-moves (previous step) (back to tree)

# σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2) ≤ n1, ¬ ii0(n) < ii0(n2 + 1), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

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

Proof step 134 from proof infappend-moves (previous step) (back to tree)

# σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), f_n->actionlist(n2) ≠ [], ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 22 terms: n2 abort: F discard: T computed: F

Additional information

Used terms: n2

Proof step 135 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , f_n->actionlist(n2) ≠ [], n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), startf(sf(0)), ii0(n2) ≤ n1, ii0(n2 + 1) ≤ ii0(n), ¬ ii0(n) < ii0(n2 + 1), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 136 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , f_n->actionlist(n2) ≠ [], n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), startf(sf(0)), ii0(n2) ≤ n1, ii0(n2 + 1) ≤ ii0(n), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[y, x] → [f_n->actionlist(n2), (al0 from ii0(n2)) to # f_n->actionlist(n2)], <all paths>

Additional information

Used terms: f_n->actionlist(n2), (al0 from ii0(n2)) to # f_n->actionlist(n2)

Proof step 137 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 138 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , f_n->actionlist(n2) ≠ [], ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. n < #((al0 from ii0(n2)) to # f_n->actionlist(n2)) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 139 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , f_n->actionlist(n2) ≠ [], n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), startf(sf(0)), ii0(n2) ≤ n1, ii0(n2 + 1) ≤ ii0(n), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜f_n->statelist(n2)⌝ , (σ from ii0(n2)) to # f_n->statelist(n2)], <all paths>

Additional information

Used terms: ⌜f_n->statelist(n2)⌝ , (σ from ii0(n2)) to # f_n->statelist(n2)

Proof step 140 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 141 from proof infappend-moves (previous step) (back to tree)

#((σ from ii0(n2)) to # f_n->statelist(n2)) = # ⌜f_n->statelist(n2)⌝ , #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), f_n->actionlist(n2) ≠ [], ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n. ⌜n⌝ < #((σ from ii0(n2)) to # f_n->statelist(n2)) → ((σ from ii0(n2)) to # f_n->statelist(n2))[n] = ⌜f_n->statelist(n2)⌝ [n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 142 from proof infappend-moves (previous step) (back to tree)

#((σ from ii0(n2)) to # f_n->statelist(n2)) = ⌜# f_n->statelist(n2)⌝ , #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), f_n->actionlist(n2) ≠ [], ii0(n2) < ii0(n), ii0(n2) < ii0(n2 + 1), n1 < ii0(n), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n), ii0(n2) ≤ n1, ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((σ from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: σ

Additional information

Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf

Proof step 143 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((σ from ii0(n2)) to # f_n->statelist(n2)) = ⌜# f_n->statelist(n2)⌝ , # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, σ = ⌜sl0⌝ , f_n->actionlist(n2) ≠ [], n1 < ii0(n2 + 1), n1 < ii0(n), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n), startf(sf(0)), ii0(n2) ≤ n1, ii0(n2 + 1) ≤ ii0(n), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ n3. n3 < # f_n->statelist(n2) → ((σ from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s)

Proof step 144 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n1 < ii0(n0), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ii0(n2) ≤ n1, ¬ stepf(sl0[n1], al0[n1], sl0[n1 + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 28 terms: n1 - ii0(n2) abort: F discard: F computed: F

Additional information

Used terms: n1 - ii0(n2)

Proof step 145 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, f_n->actionlist(n2) ≠ [], n1 < ii0(n2 + 1), n1 < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), startf(sf(0)), ii0(n2) ≤ n1, ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n1], al0[n1], sl0[n1 + 1]), n1 - ii0(n2) < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n1 - ii0(n2)] = f_n->statelist(n2)[n1 - ii0(n2)], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 146 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n1 < ii0(n0), n1 < ii0(n2 + 1), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ii0(n2) ≤ n1, ¬ stepf(sl0[n1], al0[n1], sl0[n1 + 1]), n1 < # f_n->statelist(n2) + ii0(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n1 - ii0(n2)] = f_n->statelist(n2)[n1 - ii0(n2)], ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [n1, ii0(n2), n4]

Additional information

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

Proof step 147 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, n1 = n4 + ii0(n2), f_n->actionlist(n2) ≠ [], n1 < ii0(n2 + 1), n1 < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), startf(sf(0)), ii0(n2) ≤ n1, ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n1], al0[n1], sl0[n1 + 1]), n1 < # f_n->statelist(n2) + ii0(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + n < m + n0 ↔ n < n0; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m ≤ m + n; (s)

Proof step 148 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), n4 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: # f_n->statelist(n2) ≤ n4

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used formulas: # f_n->statelist(n2) ≤ n4

Proof step 149 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), f_n->statelist(n2)[0] = sf(n2), ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, f_n->actionlist(n2) ≠ [], n4 + ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), n4 < # f_n->actionlist(n2), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ¬ # f_n->statelist(n2) ≤ n4, n4 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 150 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, hd(f_n->statelist(n2)) = sf(n2), ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1, f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->statelist(n2), n4 + ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), n4 < # f_n->actionlist(n2), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [ii0(n2) + # f_n->statelist(n2), n1]

Additional information

Used simplifier rules: ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: ii0(n2) + # f_n->statelist(n2), m0

Proof step 151 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, ii0(n2) + # f_n->statelist(n2) = n1 + 1, f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, hd(f_n->statelist(n2)) = sf(n2), ii0(n2 + 1) = n1, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), ii0(n2) + # f_n->statelist(n2) ≠ 0, f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), n4 < # f_n->statelist(n2), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 152 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, hd(f_n->statelist(n2)) = sf(n2), ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), n4 < # f_n->statelist(n2), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [f_n->statelist(n2), a, sl]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: f_n->statelist(n2), a, y

Proof step 153 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, a = sf(n2), f_n->statelist(n2) = a + sl, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->statelist(n2), n4 + ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), n4 < # f_n->actionlist(n2), startf(sf(0)), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], f_n->statelist(n2)[n3 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) ⊦ a + x = a ' + x; (s)

Proof step 154 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), n4 < # f_n->statelist(n2), startf(sf(0)), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n3. n3 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n3], f_n->actionlist(n2)[n3], sl[n3]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 31 terms: n4 abort: F discard: T computed: T

Additional information

Used terms: n4

Proof step 155 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->statelist(n2), n4 + ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), n4 < # f_n->actionlist(n2), startf(sf(0)), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), n4 < # f_n->actionlist(n2) → stepf(f_n->statelist(n2)[n4], f_n->actionlist(n2)[n4], sl[n4]), ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 156 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), n4 < # f_n->statelist(n2), startf(sf(0)), stepf(f_n->statelist(n2)[n4], f_n->actionlist(n2)[n4], sl[n4]), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. n < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n] = f_n->actionlist(n2)[n], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 30 terms: n4 abort: F discard: T computed: T

Additional information

Used terms: n4

Proof step 157 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->statelist(n2), n4 + ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), n4 < # f_n->actionlist(n2), startf(sf(0)), stepf(f_n->statelist(n2)[n4], f_n->actionlist(n2)[n4], sl[n4]), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), n4 < # f_n->actionlist(n2) → ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n4] = f_n->actionlist(n2)[n4], ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 158 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n4] = f_n->actionlist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), n4 < # f_n->statelist(n2), startf(sf(0)), stepf(f_n->statelist(n2)[n4], f_n->actionlist(n2)[n4], sl[n4]), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n3. n3 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n3] = f_n->statelist(n2)[n3] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 31 terms: n4 + 1 abort: F discard: T computed: F

Additional information

Used terms: n4 + 1

Proof step 159 from proof infappend-moves (previous step) (back to tree)

#((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), # al0 = ii0(n0), ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, ii0(n0) + 1 = # sl0, # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), f_n->statelist(n2).last = sf(n2 + 1), ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n4] = f_n->actionlist(n2)[n4], ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(n) = ii0(n0), ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(0) = 0, f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->statelist(n2), n4 + ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), ii0(n2) < ii0(n0), n4 < # f_n->actionlist(n2), startf(sf(0)), stepf(f_n->statelist(n2)[n4], f_n->actionlist(n2)[n4], sl[n4]), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), n4 + 1 < # f_n->statelist(n2) → ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4 + 1] = f_n->statelist(n2)[n4 + 1], ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

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 ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s)

Proof step 160 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n0), #((sl0 from ii0(n2)) to # f_n->statelist(n2)) = # f_n->statelist(n2), #((al0 from ii0(n2)) to # f_n->actionlist(n2)) = # f_n->actionlist(n2), # f_n->actionlist(n2) + 1 = # f_n->statelist(n2), ii0(n0) + 1 = # sl0, ii0(n2) + # f_n->statelist(n2) = ii0(n2 + 1) + 1, f_n->statelist(n2).last = sf(n2 + 1), ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4] = f_n->statelist(n2)[n4], ((al0 from ii0(n2)) to # f_n->actionlist(n2))[n4] = f_n->actionlist(n2)[n4], ((sl0 from ii0(n2)) to # f_n->statelist(n2))[n4 + 1] = sl[n4], ⌜f_n->actionlist(n2)⌝ ^ = ⌜af(n2) '⌝ ^, f_n->statelist(n2) = sf(n2) ' + sl, ii0(0) = 0, ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2), ii0(n) = ii0(n0), f_n->actionlist(n2) ≠ [], f_n->statelist(n2) ≠ [], n4 < # f_n->actionlist(n2), ii0(n2) < ii0(n0), ii0(n2) < ii0(n2 + 1), n4 + ii0(n2) < ii0(n0), n4 < # f_n->statelist(n2), startf(sf(0)), stepf(f_n->statelist(n2)[n4], f_n->actionlist(n2)[n4], sl[n4]), sf(n2) ∈ f_n->statelist(n2), ii0(n2 + 1) ≤ ii0(n0), ¬ stepf(sl0[n4 + ii0(n2)], al0[n4 + ii0(n2)], sl0[(n4 + ii0(n2)) + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:get-finto, seq:¬ # x < n, m < n ⊦ (x to n)[m] = x[m], subst:[x, n, m] → [sl0 from ii0(n2), # f_n->statelist(n2), n4 + 1], <all paths>

Additional information

Used simplifier rules: ⊦ m + m0 < n → ¬ n + n0 < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ ¬ m + n < m; (s) ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m < n → m ≤ n; (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m +1 = m + 1; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ m ≤ m0 ∧ n ≤ n0 → ¬ m0 + n0 < m + n; (s) Used terms: sl0 from ii0(n2), # f_n->statelist(n2), n4 + 1

Proof step 161 from proof infappend-moves (previous step) (back to tree)

¬ # x < n, m < n ⊦ (x to n)[m] = x[m]

A spec-lemma

Proof step 162 from proof infappend-moves (previous step) (back to tree)

# σ = ⌜ii0(n0)⌝ + ⌜1⌝ , # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # al0 = ii0(n), ii0(0) = 0, n1 < ii0(n), startf(sf(0)), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 163 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # σ = ⌜ii0(n)⌝ + ⌜1⌝ , # σ = ⌜ii0(n0)⌝ + ⌜1⌝ , ii0(0) = 0, n1 < ii0(n), startf(sf(0)), ¬ stepf(σ[n1], al0[n1], σ[n1 + 1]), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (al0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->statelist(n2) - 1 ∧ ¬ ii0(n) < ii0(n2 + 1) ∧ (σ from ii0(n2)) to # f_n->statelist(n2) = ⌜f_n->statelist(n2)⌝ , ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 1, left 2, left 3, left 6, left 7, left 8, left 9, left 10, left 12, left 13, left 14

Additional information

Proof step 164 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

User applied rule induction

And obtained the following new goals

Rule argument

indvar: n wfpred: <

Additional information

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

Proof step 165 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1, ii0, n2. n1 < n → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 166 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1, ii0, n2. n1 < n → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: n - 1 abort: F discard: F computed: F

Additional information

Used terms: n - 1

Proof step 167 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1, ii0, n2. n1 < n → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1), ii0(n - 1) ≤ n1 ∧ n1 < ii0((n - 1) + 1)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 168 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n = n0 + 1, n ≠ 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1, ii0, n2. n1 < n → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1), ii0(n0) ≤ n1 ∧ n1 < ii0(n0 + 1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 169 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n1 < ii0(n0), n1 < ii0(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1, ii0, n2. n1 < n0 + 1 → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [n1, ii0, n2] → [n0, ii0, n1]

Additional information

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

Proof step 170 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, n1 < ii0(n0 + 1), n1 < ii0(n0), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1), ∀ n1, ii0, n2. n1 < n0 + 1 → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 171 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ii0(n) < ii0(n0 + 1), ii0(n) < ii0(n0), ii0(n) < ii0(n + 1), n1 < ii0(n0 + 1), n1 < ii0(n0), n1 < ii0(n + 1), ii0(n) ≤ n1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1, ii0, n2. n1 < n0 + 1 → ii0(0) = 0 ∧ n2 < ii0(n1) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) → (∃ m. ii0(m) ≤ n2 ∧ n2 < ii0(m + 1)) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: n

Additional information

Used terms: n

Proof step 172 from proof infappend-moves (previous step) (back to tree)

# σ = # α + ⌜1⌝ , ii0(0) = 0, α = ⌜af0⌝ , ⌜n1⌝ < # α, startf(sf(0)), ¬ stepf(σ[n1], α[n1], σ[n1 + 1]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[IOstatestream] ⊦ ⌜m⌝ < ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (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) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ + ∞ = ∞; (s)

Proof step 173 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: n1 abort: F discard: T computed: F

Additional information

Used terms: n1

Proof step 174 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 175 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, ii0(n) < ii0(n + 1), n1 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2) ⊦

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 176 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, n1 < ii0(n + 1), ii0(n) < ii0(n + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n)⌝ , ⌜f_n->actionlist(n)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 177 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n) < ii0(n + 1), n1 < ii0(n + 1), frag(IOAut(startf, stepf))(⌜f_n->statelist(n)⌝ , ⌜f_n->actionlist(n)⌝ ), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜f_n->actionlist(n)⌝ , ⌜f_n->statelist(n)⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(n)⌝ , ⌜f_n->statelist(n)⌝ , stepf, startf

Proof step 178 from proof infappend-moves (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 179 from proof infappend-moves (previous step) (back to tree)

# ⌜f_n->statelist(n)⌝ = # ⌜f_n->actionlist(n)⌝ + ⌜1⌝ , f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, n1 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ∀ n0. ⌜n0⌝ < # ⌜f_n->actionlist(n)⌝ → stepf(⌜f_n->statelist(n)⌝ [n0], ⌜f_n->actionlist(n)⌝ [n0], ⌜f_n->statelist(n)⌝ [n0 +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 180 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n) < ii0(n + 1), n1 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n2. ii0(n2 + 1) = ii0(n2) + # f_n->actionlist(n2) ∧ (af0 from ii0(n2)) to # f_n->actionlist(n2) = f_n->actionlist(n2), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 181 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), n1 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n) ⊦

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 ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic

Proof step 182 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], ii0(n) < ii0(n + 1), n1 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 183 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), f_n->actionlist(n) ≠ [], n1 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 184 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), (sf0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), f_n->actionlist(n) ≠ [], n1 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[IOstatestream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[y, x] → [f_n->statelist(n), (sf0 from ii0(n)) to # f_n->statelist(n)], <all paths>

Additional information

Used terms: f_n->statelist(n), (sf0 from ii0(n)) to # f_n->statelist(n)

Proof step 185 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 186 from proof infappend-moves (previous step) (back to tree)

#((sf0 from ii0(n)) to # f_n->statelist(n)) = # f_n->statelist(n), # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], ii0(n) < ii0(n + 1), n1 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. n0 < #((sf0 from ii0(n)) to # f_n->statelist(n)) → ((sf0 from ii0(n)) to # f_n->statelist(n))[n0] = f_n->statelist(n)[n0] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)

Proof step 187 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], n1 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 18 terms: n1 - ii0(n) abort: F discard: F computed: F

Additional information

Used terms: n1 - ii0(n)

Proof step 188 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], ii0(n) < ii0(n + 1), n1 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), n1 - ii0(n) < # f_n->statelist(n) → sf0((n1 - ii0(n)) + ii0(n)) = f_n->statelist(n)[n1 - ii0(n)], ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 189 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], n1 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), n1 < # f_n->statelist(n) + ii0(n) → sf0((n1 - ii0(n)) + ii0(n)) = f_n->statelist(n)[n1 - ii0(n)], ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0] ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-sub, seq:n ≤ m ⊦ n0 = m - n ↔ m = n0 + n, subst:[m, n, n0] → [n1, ii0(n), n2]

Additional information

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

Proof step 190 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), n1 = n2 + ii0(n), (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], ii0(n) < ii0(n + 1), n1 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ n1, ¬ stepf(sf0(n1), af0(n1), sf0(n1 + 1)), n1 < # f_n->statelist(n) + ii0(n) → sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ m + n; (s)

Proof step 191 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), startf(sf(0)), ¬ stepf(sf0(n2 + ii0(n)), af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), n2 < # f_n->statelist(n) → sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0] ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: # f_n->statelist(n) ≤ n2

Additional information

Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used formulas: # f_n->statelist(n) ≤ n2

Proof step 192 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], ii0(n) < ii0(n + 1), n2 < # f_n->actionlist(n), startf(sf(0)), ¬ stepf(sf0(n2 + ii0(n)), af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ¬ # f_n->statelist(n) ≤ n2, n2 < # f_n->statelist(n) → sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 193 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, hd(f_n->statelist(n)) = sf(n), ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->statelist(n), ii0(n) < ii0(n + 1), n2 < # f_n->actionlist(n), startf(sf(0)), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [ii0(n) + # f_n->statelist(n), n1]

Additional information

Used simplifier rules: ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: ii0(n) + # f_n->statelist(n), m0

Proof step 194 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n) + # f_n->statelist(n) = n1 + 1, f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, hd(f_n->statelist(n)) = sf(n), ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, ii0(n + 1) = n1, sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), ii0(n) + # f_n->statelist(n) ≠ 0, f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), n2 < # f_n->statelist(n), startf(sf(0)), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 195 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, hd(f_n->statelist(n)) = sf(n), ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), n2 < # f_n->statelist(n), startf(sf(0)), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0] ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [f_n->statelist(n), a, x0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: f_n->statelist(n), a, y

Proof step 196 from proof infappend-moves (previous step) (back to tree)

ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, a = sf(n), f_n->statelist(n) = a + x0, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->statelist(n), ii0(n) < ii0(n + 1), n2 < # f_n->actionlist(n), startf(sf(0)), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], f_n->statelist(n)[n0 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) ⊦ a + x = a ' + x; (s)

Proof step 197 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), n2 < # f_n->statelist(n), startf(sf(0)), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n0. n0 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n0], f_n->actionlist(n)[n0], x0[n0]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 21 terms: n2 abort: F discard: T computed: T

Additional information

Used terms: n2

Proof step 198 from proof infappend-moves (previous step) (back to tree)

ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->statelist(n), ii0(n) < ii0(n + 1), n2 < # f_n->actionlist(n), startf(sf(0)), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), n2 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n2], f_n->actionlist(n)[n2], x0[n2]), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0], ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 199 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), n2 < # f_n->statelist(n), startf(sf(0)), stepf(f_n->statelist(n)[n2], f_n->actionlist(n)[n2], x0[n2]), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->statelist(n) → sf0(n0 + ii0(n)) = f_n->statelist(n)[n0] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 21 terms: n2 + 1 abort: F discard: T computed: F

Additional information

Used terms: n2 + 1

Proof step 200 from proof infappend-moves (previous step) (back to tree)

ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->statelist(n), ii0(n) < ii0(n + 1), n2 < # f_n->actionlist(n), startf(sf(0)), stepf(f_n->statelist(n)[n2], f_n->actionlist(n)[n2], x0[n2]), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), sf0((n2 + ii0(n)) + 1)), n2 + 1 < # f_n->statelist(n) → sf0((n2 + 1) + ii0(n)) = f_n->statelist(n)[n2 + 1], ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

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 ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s)

Proof step 201 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], sf0((n2 + 1) + ii0(n)) = x0[n2], (af0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), n2 < # f_n->statelist(n), startf(sf(0)), stepf(f_n->statelist(n)[n2], f_n->actionlist(n)[n2], x0[n2]), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), x0[n2]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[actionstream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[y, x] → [f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n)], <all paths>

Additional information

Used terms: f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n)

Proof step 202 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 203 from proof infappend-moves (previous step) (back to tree)

#((af0 from ii0(n)) to # f_n->actionlist(n)) = # f_n->actionlist(n), ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), sf0((n2 + 1) + ii0(n)) = x0[n2], sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->statelist(n), ii0(n) < ii0(n + 1), n2 < # f_n->actionlist(n), startf(sf(0)), stepf(f_n->statelist(n)[n2], f_n->actionlist(n)[n2], x0[n2]), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), x0[n2]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. n0 < #((af0 from ii0(n)) to # f_n->actionlist(n)) → ((af0 from ii0(n)) to # f_n->actionlist(n))[n0] = f_n->actionlist(n)[n0] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)

Proof step 204 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n) + # f_n->statelist(n) = ii0(n + 1) + 1, f_n->statelist(n).last = sf(n + 1), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, f_n->statelist(n) = sf(n) ' + x0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), ii0(0) = 0, sf0(n2 + ii0(n)) = f_n->statelist(n)[n2], sf0((n2 + 1) + ii0(n)) = x0[n2], f_n->actionlist(n) ≠ [], f_n->statelist(n) ≠ [], n2 < # f_n->actionlist(n), ii0(n) < ii0(n + 1), n2 < # f_n->statelist(n), startf(sf(0)), stepf(f_n->statelist(n)[n2], f_n->actionlist(n)[n2], x0[n2]), sf(n) ∈ f_n->statelist(n), ¬ stepf(f_n->statelist(n)[n2], af0(n2 + ii0(n)), x0[n2]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. n0 < # f_n->actionlist(n) → af0(n0 + ii0(n)) = f_n->actionlist(n)[n0] ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 21 terms: n2 abort: F discard: T computed: T

Additional information

Used terms: n2

Proof step 205 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, # σ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , # σ ≠ # α + ⌜1⌝ ∨ ¬(⌜n1⌝ < # α → stepf(σ[n1], α[n1], σ[n1 + 1])) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 206 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, # σ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: σ

Additional information

Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 207 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, σ = ⌜sl0⌝ , # σ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

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) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)

Proof step 208 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, ⌜# sl0⌝ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;

Proof step 209 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, α = ⌜al0⌝ , ⌜# sl0⌝ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 210 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: n0 + 1, n abort: F discard: F computed: F

Additional information

Used terms: n0 + 1, n

Proof step 211 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), n0 + 1 ≤ n → ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 212 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), n0 < n → ii0(n0 + 1) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: n + 1, n0 abort: F discard: F computed: F

Additional information

Used terms: n + 1, n0

Proof step 213 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), n0 < n → ii0(n0 + 1) ≤ ii0(n), n + 1 ≤ n0 → ii0(n + 1) ≤ ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 214 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), n0 < n → ii0(n0 + 1) ≤ ii0(n), n < n0 → ii0(n + 1) ≤ ii0(n0), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: n < n0

Additional information

Used formulas: n < n0

Proof step 215 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n < n0, startf(sf(0)), n < n0 → ii0(n + 1) ≤ ii0(n0), n0 < n → ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 216 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n < n0, startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 217 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n < n0, frag(IOAut(startf, stepf))(⌜f_n->statelist(n)⌝ , ⌜f_n->actionlist(n)⌝ ), startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 218 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n < n0, frag(IOAut(startf, stepf))(⌜f_n->statelist(n)⌝ , ⌜f_n->actionlist(n)⌝ ), startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜f_n->actionlist(n)⌝ , ⌜f_n->statelist(n)⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(n)⌝ , ⌜f_n->statelist(n)⌝ , stepf, startf

Proof step 219 from proof infappend-moves (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 220 from proof infappend-moves (previous step) (back to tree)

# ⌜f_n->statelist(n)⌝ = # ⌜f_n->actionlist(n)⌝ + ⌜1⌝ , # al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n < n0, startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n0. ⌜n0⌝ < # ⌜f_n->actionlist(n)⌝ → stepf(⌜f_n->statelist(n)⌝ [n0], ⌜f_n->actionlist(n)⌝ [n0], ⌜f_n->statelist(n)⌝ [n0 +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 221 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n < n0, startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. n1 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n1], f_n->actionlist(n)[n1], f_n->statelist(n)[n1 + 1]) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 222 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n0) + 1 = # sl0, f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (sl0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ii0(n) + 1 ≠ # sl0, n < n0, ii0(n + 1) < # sl0, startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ n1. n1 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n1], f_n->actionlist(n)[n1], f_n->statelist(n)[n1 + 1]), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 223 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), # f_n->actionlist(n) + 1 = # f_n->statelist(n), ii0(n0) + 1 = # sl0, f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, (sl0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), ii0(n) + 1 ≠ # sl0, sl0 ≠ [], n < n0, ii0(n + 1) < # sl0, startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ∀ n1. n1 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n1], f_n->actionlist(n)[n1], f_n->statelist(n)[n1 + 1]), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 224 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (sl0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), (al0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), ii0(n) + 1 ≠ # sl0, sl0 ≠ [], ii0(n + 1) < # sl0, n < n0, startf(sf(0)), ii0(n + 1) ≤ ii0(n0), ¬ ii0(n) < ii0(n + 1), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. n1 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n1], f_n->actionlist(n)[n1], f_n->statelist(n)[n1 + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss)

Proof step 225 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, # f_n->actionlist(n) + 1 = # f_n->statelist(n), f_n->statelist(n).last = sf(n + 1), f_n->statelist(n)[0] = sf(n), ⌜f_n->actionlist(n)⌝ ^ = ⌜af(n) '⌝ ^, ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1, ii0(0) = 0, ii0(n + 1) = ii0(n) + # f_n->actionlist(n), (sl0 from ii0(n)) to # f_n->statelist(n) = f_n->statelist(n), (al0 from ii0(n)) to # f_n->actionlist(n) = f_n->actionlist(n), ii0(n) + 1 ≠ # sl0, sl0 ≠ [], ii0(n + 1) < # sl0, n < n0, startf(sf(0)), ii0(n + 1) ≤ ii0(n), ii0(n + 1) ≤ ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. n1 < # f_n->actionlist(n) → stepf(f_n->statelist(n)[n1], f_n->actionlist(n)[n1], f_n->statelist(n)[n1 + 1]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 19 terms: n0

Additional information

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

Proof step 226 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), ¬ n < n0, n < n0 → ii0(n + 1) ≤ ii0(n0), n0 < n → ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 227 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, startf(sf(0)), n0 ≤ n, n0 < n → ii0(n0 + 1) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: n0 < n

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) Used formulas: n0 < n

Proof step 228 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n0 < n, startf(sf(0)), n0 ≤ n, n0 < n → ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 229 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n0 < n, startf(sf(0)), ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: n0 abort: F discard: T computed: F

Additional information

Used terms: n0

Proof step 230 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n0 < n, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0 + 1) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 231 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n) + 1 ≠ # sl0, n0 < n, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 16 terms: n0 abort: F discard: T computed: F

Additional information

Used terms: n0

Proof step 232 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (sl0 from ii0(n0)) to # f_n->statelist(n0) = f_n->statelist(n0), ii0(n) + 1 ≠ # sl0, n0 < n, ii0(n0 + 1) < # sl0, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0 + 1) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 233 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (sl0 from ii0(n0)) to # f_n->statelist(n0) = f_n->statelist(n0), ii0(n) + 1 ≠ # sl0, sl0 ≠ [], n0 < n, ii0(n0 + 1) < # sl0, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0 + 1) ≤ ii0(n), ii0(n0 + 1) ≤ ii0(n0), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ ¬ ii0(n) < ii0(n1 + 1) ∧ (al0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 17 terms: n0 abort: F discard: T computed: F

Additional information

Used terms: n0

Proof step 234 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), (sl0 from ii0(n0)) to # f_n->statelist(n0) = f_n->statelist(n0), (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0), ii0(n) + 1 ≠ # sl0, sl0 ≠ [], ii0(n0 + 1) < # sl0, n0 < n, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0 + 1) ≤ ii0(n0), ii0(n0 + 1) ≤ ii0(n), ¬ ii0(n) < ii0(n0 + 1), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m ≤ n → (n < m ↔ false); (s)

Proof step 235 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(n0) + 1 = # sl0, f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), (sl0 from ii0(n0)) to # f_n->statelist(n0) = f_n->statelist(n0), (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0), ii0(n) + 1 ≠ # sl0, sl0 ≠ [], ii0(n0 + 1) < # sl0, n0 < n, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ii0(n0 + 1) ≤ ii0(n0), ii0(n0 + 1) ≤ ii0(n), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 20 terms: n

Additional information

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

Proof step 236 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, α = ⌜af0⌝ , ⌜# sl0⌝ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜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 ⊦ ⌜m⌝ + ∞ = ∞; (s)

Proof step 237 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, startf(sf(0)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: ii0(n0) + 1 abort: F discard: T computed: F

Additional information

Used terms: ii0(n0) + 1

Proof step 238 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, startf(sf(0)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∃ m. ii0(m) ≤ ii0(n0) + 1 ∧ ii0(n0) + 1 < ii0(m + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 239 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) < ii0(n + 1), # sl0 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ # sl0, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n + 1

Proof step 240 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, # sl0 < ii0(n + 1), ii0(n) < ii0(n + 1), startf(sf(0)), ii0(n) ≤ # sl0, n0 ≤ n + 1 → tl(f_n->statelist(n + 1)) = [] ∧ ii0(n + 1) = ii0(n0), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n → n ≠ 0; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 241 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, ii0(n) < ii0(n + 1), # sl0 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ # sl0, ¬ n0 ≤ n + 1, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 242 from proof infappend-moves (previous step) (back to tree)

ii0(n0) + 1 = # sl0, ii0(0) = 0, n + 1 < n0, ii0(n) < ii0(n + 1), # sl0 < ii0(n + 1), startf(sf(0)), ii0(n) ≤ # sl0, ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->actionlist(n1) ∧ (af0 from ii0(n1)) to # f_n->actionlist(n1) = f_n->actionlist(n1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ ii0(n1 + 1) < # sl0 ∧ (sl0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: n + 1, n0 abort: F discard: T computed: F

Additional information

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

Proof step 243 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, σ = ⌜sf0⌝ , # σ ≠ # α + ⌜1⌝ , startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (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 ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s)

Proof step 244 from proof infappend-moves (previous step) (back to tree)

# α = ⌜ii0(n)⌝ , ii0(0) = 0, startf(sf(0)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s)

Proof step 245 from proof infappend-moves (previous step) (back to tree)

# α = ⌜ii0(n)⌝ , ii0(0) = 0, α = ⌜al0⌝ , startf(sf(0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 246 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(0) = 0, startf(sf(0)), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0) ∧ ¬ ii0(n) < ii0(n0 + 1) ∧ (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: ii0(n) + 1 abort: F discard: T computed: F

Additional information

Used terms: ii0(n) + 1

Proof step 247 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(0) = 0, startf(sf(0)), ∀ n0. ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0) ∧ ¬ ii0(n) < ii0(n0 + 1) ∧ (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n), ∃ m. ii0(m) ≤ ii0(n) + 1 ∧ ii0(n) + 1 < ii0(m + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 248 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(0) = 0, ii0(n0) < ii0(n0 + 1), ii0(n) + 1 < ii0(n0 + 1), startf(sf(0)), ii0(n0) ≤ ii0(n) + 1, ∀ n0. ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0) ∧ ¬ ii0(n) < ii0(n0 + 1) ∧ (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: n0 + 1 abort: F discard: T computed: F

Additional information

Used terms: n0 + 1

Proof step 249 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(0) = 0, ii0(n) + 1 < ii0(n0 + 1), ii0(n0) < ii0(n0 + 1), startf(sf(0)), ii0(n0) ≤ ii0(n) + 1, n ≤ n0 + 1 → f_n->actionlist(n0 + 1) = [] ∧ ii0(n0 + 1) = ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0) ∧ ¬ ii0(n) < ii0(n0 + 1) ∧ (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

Proof step 250 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(0) = 0, ii0(n0) < ii0(n0 + 1), ii0(n) + 1 < ii0(n0 + 1), startf(sf(0)), ii0(n0) ≤ ii0(n) + 1, ¬ n ≤ n0 + 1, ∀ n0. ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0) ∧ ¬ ii0(n) < ii0(n0 + 1) ∧ (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 251 from proof infappend-moves (previous step) (back to tree)

# al0 = ii0(n), ii0(0) = 0, n0 + 1 < n, ii0(n0) < ii0(n0 + 1), ii0(n) + 1 < ii0(n0 + 1), startf(sf(0)), ii0(n0) ≤ ii0(n) + 1, ∀ n0. ii0(n0 + 1) = ii0(n0) + # f_n->actionlist(n0) ∧ ¬ ii0(n) < ii0(n0 + 1) ∧ (al0 from ii0(n0)) to # f_n->actionlist(n0) = f_n->actionlist(n0), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n1. ii0(n1 + 1) = ii0(n1) + # f_n->statelist(n1) - 1 ∧ (sf0 from ii0(n1)) to # f_n->statelist(n1) = f_n->statelist(n1) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: n0 + 1, n abort: F discard: T computed: F

Additional information

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

Proof step 252 from proof infappend-moves (previous step) (back to tree)

ii0(0) = 0, startf(sf(0)), ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: 0

Proof step 253 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(0).last = sf(0 + 1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(0) = 0, frag(IOAut(startf, stepf))(⌜f_n->statelist(0)⌝ , ⌜f_n->actionlist(0)⌝ ), startf(sf(0)), ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

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

Proof step 254 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(0) = 0, frag(IOAut(startf, stepf))(⌜f_n->statelist(0)⌝ , ⌜f_n->actionlist(0)⌝ ), startf(sf(0)), ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: 0 abort: F discard: T computed: F

Additional information

Used terms: 0

Proof step 255 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # f_n->statelist(0) - 1, (σ from ii0(0)) to # f_n->statelist(0) = ⌜f_n->statelist(0)⌝ , ⌜ii0(0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(0)⌝ , ⌜f_n->actionlist(0)⌝ ), startf(sf(0)), ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 256 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(0) = 0, ii0(1) = # f_n->statelist(0) - 1, σ to # f_n->statelist(0) = ⌜f_n->statelist(0)⌝ , ⌜ii0(1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(0)⌝ , ⌜f_n->actionlist(0)⌝ ), startf(sf(0)), ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 15 terms: 0 abort: F discard: T computed: F

Additional information

Used terms: 0

Proof step 257 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(1) = # f_n->statelist(0) - 1, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # f_n->actionlist(0), σ to # f_n->statelist(0) = ⌜f_n->statelist(0)⌝ , (α from ii0(0)) to # f_n->actionlist(0) = ⌜f_n->actionlist(0)⌝ , ⌜ii0(1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(0)⌝ , ⌜f_n->actionlist(0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(0 + 1)⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 258 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(1) = # f_n->statelist(0) - 1, ii0(0) = 0, ii0(1) = # f_n->actionlist(0), σ to # f_n->statelist(0) = ⌜f_n->statelist(0)⌝ , α to ii0(1) = ⌜f_n->actionlist(0)⌝ , ⌜ii0(1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(0)⌝ , ⌜f_n->actionlist(0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii0(1)⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜f_n->actionlist(0)⌝ , ⌜f_n->statelist(0)⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(0)⌝ , ⌜f_n->statelist(0)⌝ , stepf, startf

Proof step 259 from proof infappend-moves (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 260 from proof infappend-moves (previous step) (back to tree)

# ⌜f_n->statelist(0)⌝ = # ⌜f_n->actionlist(0)⌝ + ⌜1⌝ , f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(1) = # f_n->actionlist(0), ii0(0) = 0, ii0(1) = # f_n->statelist(0) - 1, α to ii0(1) = ⌜f_n->actionlist(0)⌝ , σ to # f_n->statelist(0) = ⌜f_n->statelist(0)⌝ , ⌜ii0(1)⌝ < # σ, startf(sf(0)), ¬ # α < ⌜ii0(1)⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ⌜n⌝ < # ⌜f_n->actionlist(0)⌝ → stepf(⌜f_n->statelist(0)⌝ [n], ⌜f_n->actionlist(0)⌝ [n], ⌜f_n->statelist(0)⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 261 from proof infappend-moves (previous step) (back to tree)

ii0(1) + 1 = # f_n->statelist(0), f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(0) = 0, ii0(1) = # f_n->actionlist(0), σ to ii0(1) + 1 = ⌜f_n->statelist(0)⌝ , α to ii0(1) = ⌜f_n->actionlist(0)⌝ , ⌜ii0(1)⌝ < # σ, startf(sf(0)), ¬ # α < ⌜ii0(1)⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n1. n1 < ii0(1) → stepf(f_n->statelist(0)[n1], f_n->actionlist(0)[n1], f_n->statelist(0)[n1 + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜f_n->statelist(0)⌝ , σ to 1 + ii0(1)], <all paths>

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: ⌜f_n->statelist(0)⌝ , σ to 1 + ii0(1)

Proof step 262 from proof infappend-moves (previous step) (back to tree)

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

A spec-lemma

Proof step 263 from proof infappend-moves (previous step) (back to tree)

#(σ to 1 + ii0(1)) = # ⌜f_n->statelist(0)⌝ , ii0(1) + 1 = # f_n->statelist(0), f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(1) = # f_n->actionlist(0), ii0(0) = 0, α to ii0(1) = ⌜f_n->actionlist(0)⌝ , ⌜ii0(1)⌝ < # σ, startf(sf(0)), ¬ # α < ⌜ii0(1)⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n1. n1 < ii0(1) → stepf(f_n->statelist(0)[n1], f_n->actionlist(0)[n1], f_n->statelist(0)[n1 + 1]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ⌜n⌝ < #(σ to 1 + ii0(1)) → (σ to 1 + ii0(1))[n] = ⌜f_n->statelist(0)⌝ [n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 264 from proof infappend-moves (previous step) (back to tree)

1 + ii0(1) = # f_n->statelist(0), f_n->statelist(0).last = sf(1), f_n->statelist(0)[0] = sf(0), ⌜f_n->actionlist(0)⌝ ^ = ⌜af(0) '⌝ ^, ii0(0) = 0, ii0(1) = # f_n->actionlist(0), α to ii0(1) = ⌜f_n->actionlist(0)⌝ , ⌜ii0(1)⌝ < # σ, startf(sf(0)), ¬ # α < ⌜ii0(1)⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii0(m) = ii0(n));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n1. n1 < ii0(1) → stepf(f_n->statelist(0)[n1], f_n->actionlist(0)[n1], f_n->statelist(0)[n1 + 1]), ∀ n1. ¬ ii0(1) < n1 → σ[n1] = f_n->statelist(0)[n1] ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 17 terms: 0 abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) Used terms: 0

Proof step 265 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, ii ≠ ii0, startf(sf(0)), (finp(σ) ⊃ # σ = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → tl(f_n->statelist(m)) = [] ∧ ii0(m) = ii0(n0));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(α) ⊃ # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → f_n->actionlist(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ σ0, β. ⌜af⌝ ^ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 5, left 6, left 7, left 8, left 10, left 12

Additional information

Proof step 266 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, ii ≠ ii0, startf(sf(0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 267 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, ii(n) ≠ ii0(n), startf(sf(0)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 268 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, ii(n0 +1) ≠ ii0(n0 +1), startf(sf(0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ ii, ii0, startf, sf, stepf, f_n->statelist, f_n->actionlist, af, α, σ. ¬ ( ii(0) = 0 ∧ ii0(0) = 0 ∧ ii(n0) ≠ ii0(n0) ∧ startf(sf(0)) ∧ (∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1)) ∧ (∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ) ∧ (∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 269 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, ii(n0 + 1) ≠ ii0(n0 + 1), startf(sf(0)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ ii1, ii2, startf0, sf0, stepf0, f_n->statelist0, f_n->actionlist0, af0, α0, σ0. ii1(0) ≠ 0 ∨ ii2(0) ≠ 0 ∨ ii1(n0) = ii2(n0) ∨ ¬ startf0(sf0(0)) ∨ ¬ (∀ n0. frag(IOAut(startf0, stepf0))(⌜f_n->statelist0(n0)⌝ , ⌜f_n->actionlist0(n0)⌝ ) ∧ ⌜f_n->actionlist0(n0)⌝ ^ = ⌜af0(n0) '⌝ ^ ∧ f_n->statelist0(n0)[0] = sf0(n0) ∧ f_n->statelist0(n0).last = sf0(n0 + 1)) ∨ ¬ (∀ n. ii1(n + 1) = ii1(n) + # f_n->actionlist0(n) ∧ ¬ # α0 < ⌜ii1(n + 1)⌝ ∧ (α0 from ii1(n)) to # f_n->actionlist0(n) = ⌜f_n->actionlist0(n)⌝ ) ∨ ¬ (∀ n. ii2(n + 1) = ii2(n) + # f_n->statelist0(n) - 1 ∧ ⌜ii2(n + 1)⌝ < # σ0 ∧ (σ0 from ii2(n)) to # f_n->statelist0(n) = ⌜f_n->statelist0(n)⌝ ) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: ii, ii0, startf, sf, stepf, f_n->statelist, f_n->actionlist, af, α, σ abort: F discard: T computed: T

Additional information

Used terms: ii, ii0, startf, sf, stepf, f_n->statelist, f_n->actionlist, af, α, σ

Proof step 270 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii0(0) = 0, ii(n0 + 1) ≠ ii0(n0 + 1), startf(sf(0)), ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ , ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ii(0) ≠ 0 ∨ ii0(0) ≠ 0 ∨ ii(n0) = ii0(n0) ∨ ¬ startf(sf(0)) ∨ ¬ (∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1)) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 271 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii(n0) = ii0(n0), ii0(0) = 0, ii(n0 + 1) ≠ ii0(n0 + 1), startf(sf(0)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # f_n->statelist(n) - 1 ∧ ⌜ii0(n + 1)⌝ < # σ ∧ (σ from ii0(n)) to # f_n->statelist(n) = ⌜f_n->statelist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 272 from proof infappend-moves (previous step) (back to tree)

ii(n0) = ii0(n0), ii(0) = 0, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, startf(sf(0)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 273 from proof infappend-moves (previous step) (back to tree)

ii(0) = 0, ii(n0) = ii0(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, startf(sf(0)), ∀ n0. frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ) ∧ ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^ ∧ f_n->statelist(n0)[0] = sf(n0) ∧ f_n->statelist(n0).last = sf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n0

Proof step 274 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii(n0) = ii0(n0), ii(0) = 0, ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 275 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii(0) = 0, ii(n0) = ii0(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(0) = 0, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ∀ n. ii(n + 1) = ii(n) + # f_n->actionlist(n) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # f_n->actionlist(n) = ⌜f_n->actionlist(n)⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: n0 abort: F discard: T computed: T

Additional information

Used terms: n0

Proof step 276 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii(n0) = ii0(n0), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->actionlist(n0), ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii(n0 + 1)⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 277 from proof infappend-moves (previous step) (back to tree)

f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii(0) = 0, ii(n0) = ii0(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(0) = 0, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, frag(IOAut(startf, stepf))(⌜f_n->statelist(n0)⌝ , ⌜f_n->actionlist(n0)⌝ ), startf(sf(0)), ¬ # α < ⌜ii(n0 + 1)⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜f_n->actionlist(n0)⌝ , ⌜f_n->statelist(n0)⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜f_n->actionlist(n0)⌝ , ⌜f_n->statelist(n0)⌝ , stepf, startf

Proof step 278 from proof infappend-moves (previous step) (back to tree)

⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

Lemma frag

Proof step 279 from proof infappend-moves (previous step) (back to tree)

# ⌜f_n->statelist(n0)⌝ = # ⌜f_n->actionlist(n0)⌝ + ⌜1⌝ , f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii(n0) = ii0(n0), ii(0) = 0, ii(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii0(0) = 0, ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, startf(sf(0)), ¬ # α < ⌜ii(n0 + 1)⌝ , ∀ n. ⌜n⌝ < # ⌜f_n->actionlist(n0)⌝ → stepf(⌜f_n->statelist(n0)⌝ [n], ⌜f_n->actionlist(n0)⌝ [n], ⌜f_n->statelist(n0)⌝ [n +1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 280 from proof infappend-moves (previous step) (back to tree)

# f_n->actionlist(n0) + 1 = # f_n->statelist(n0), f_n->statelist(n0).last = sf(n0 + 1), f_n->statelist(n0)[0] = sf(n0), ⌜f_n->actionlist(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ii(n0 + 1) = ii0(n0) + # f_n->actionlist(n0), ii(0) = 0, ii(n0) = ii0(n0), ii0(n0 + 1) = ii0(n0) + # f_n->statelist(n0) - 1, ii0(0) = 0, (α from ii0(n0)) to # f_n->actionlist(n0) = ⌜f_n->actionlist(n0)⌝ , (σ from ii0(n0)) to # f_n->statelist(n0) = ⌜f_n->statelist(n0)⌝ , ii(n0 + 1) ≠ ii0(n0 + 1), ⌜ii0(n0 + 1)⌝ < # σ, startf(sf(0)), ¬ # α < ⌜ii(n0 + 1)⌝ , ∀ n. n < # f_n->actionlist(n0) → stepf(f_n->statelist(n0)[n], f_n->actionlist(n0)[n], f_n->statelist(n0)[n + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

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

Proof step 281 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ ∀ n. ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 282 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: n

Proof step 283 from proof infappend-moves (previous step) (back to tree)

move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)), startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^) ⊦ ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:move, seq:⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, startf, s2, β, s1] → [stepf, startf, sf(n + 1), ⌜af(n) '⌝ ^, sf(n)], <all paths>

Additional information

Used terms: sf(n + 1), ⌜af(n) '⌝ ^, sf(n), stepf, startf

Proof step 284 from proof infappend-moves (previous step) (back to tree)

⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

Lemma move

Proof step 285 from proof infappend-moves (previous step) (back to tree)

startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ sf(n) = sl[0] ∧ sf(n + 1) = sl.last ∧ α ^ = ⌜af(n) '⌝ ^ ⊦ ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fragstar: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]

Proof step 286 from proof infappend-moves (previous step) (back to tree)

⌜al⌝ ^ = ⌜af(n) '⌝ ^, sf(n) = sl[0], sf(n + 1) = sl.last, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^) ⊦ ∃ sl, al0. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ ⌜al0⌝ ^ = ⌜al⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: sl, al

Additional information

Used terms: sl, al

Proof Tree for infappend-moves (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