| startf(sf(0)), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ trace(IOAut(startf, stepf))(⌜af⌝ ^) |
startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦
| startf(sf(0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ^), ∀ n. move(IOAut(startf, stepf))(sf(n), ⌜af(n) '⌝ ^, sf(n + 1)) ⊦ |
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) ⊦
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)
Used formulas: ∀ n. ∃ sl, al. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af(n) '⌝ ^ ∧ sl[0] = sf(n) ∧ sl.last = sf(n + 1)
| 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) ⊦ |
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)) ⊦
| 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)) ⊦ |
⊦ ∃ σ, 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))
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)) ⊦
Used terms: f_n->actionlist
| ⊦ ∃ σ, 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)) |
| 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)) ⊦ |
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)) ⊦
| 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)) ⊦ |
∀ 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))
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) ≠ []
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)) ⊦
Used terms: f_n->statelist
| ∀ 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)) |
| 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) ≠ [] |
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) ≠ []
| 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) ≠ [] |
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) ≠ []
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) ≠ []
Used simplifier rules: ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: f_n->statelist(n0 + 1), head, tail
| 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) ≠ [] |
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) ≠ []
| 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) ≠ [] |
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
| 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) ≠ [] |
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) ≠ []
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)
| 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) ≠ [] |
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) ≠ []
Used terms: n0
| 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) ≠ [] |
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) ≠ []
| 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) ≠ [] |
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)⌝ ⊦
Used simplifier rules: not-frag-empty: ⊦ ¬ frag(IOAut(startf, stepf))([], α); ⊦ ⌜[]⌝ = []; (s)
| 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)⌝ ⊦ |
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
| 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)) ⊦ |
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)) ⊦
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)
| 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)) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
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))(σ, β)) ⊦
Used terms: ⌜af⌝ ^, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| 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))(σ, β)) ⊦ |
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]) ⊦
Used simplifier rules: exec: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]);
| 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]) ⊦ |
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)⌝ ⊦
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)⌝ ⊦
Used formulas: ii = ii0
| 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)⌝ ⊦ |
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]) ⊦
| 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]) ⊦ |
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]) ⊦
Used terms: σ, α
| 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]) ⊦ |
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)) ⊦
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)) ⊦
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)) ⊦
| 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)) ⊦ |
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))^ ⊦
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))^
Used formulas: ∀ n. ⌜af to n⌝ ^ = (α to ii0(n))^
| 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))^ ⊦ |
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)) ⊦
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)) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| 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)) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# 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) ⊦
Used terms: n
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ # x = n → x to n = x; (s)
| # 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) ⊦ |
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
# 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] = τ)
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) Used terms: n, ⌜af⌝
| ¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ |
| # 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] = τ) |
# 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) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s)
| # 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) ⊦ |
# 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) ⊦
Used terms: n1
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s)
| # 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) ⊦ |
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) Used terms: n1
| 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)) ⊦ |
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)) ⊦
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)
| 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)) ⊦ |
¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^)
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) ⊦
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)^) ⊦
Used terms: af0, af
| ¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^) |
| 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) ⊦ |
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) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| 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) ⊦ |
⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ)
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)) ⊦
Used terms: af
| ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) |
| 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)) ⊦ |
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) = τ ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| 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) = τ ⊦ |
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
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] = τ)
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] = τ ⊦
Used terms: ⌜af⌝ , n
| ¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ |
| 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] = τ) |
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) = τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s)
| 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) = τ ⊦ |
Used terms: n1
| 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] = τ ⊦ |
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) = τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| 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) = τ ⊦ |
⌜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) ⊦
Used terms: n
| ⌜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) ⊦ |
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) = τ ⊦
| 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) = τ ⊦ |
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
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] = τ)
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) Used terms: ⌜af0⌝ , ii0(n)
| ¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ |
| 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] = τ) |
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) = τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s)
| 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) = τ ⊦ |
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) ⊦
Used terms: n1
| 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) ⊦ |
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) ⊦
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
| 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) ⊦ |
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) = τ ⊦
Used terms: 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) ≠ τ, ⌜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) = τ ⊦ |
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) = τ ⊦
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
| 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) = τ ⊦ |
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)⌝ ⊦
Used terms: 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, (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)⌝ ⊦ |
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) = τ ⊦
| 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) = τ ⊦ |
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)⌝ ⊦
Used terms: 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, (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)⌝ ⊦ |
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) = τ ⊦
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) = τ ⊦
| 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) = τ ⊦ |
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) = τ ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)
| 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) = τ ⊦ |
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
| 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) = τ ⊦ |
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) = τ ⊦
Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)
| 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) = τ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((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] ⊦
Used terms: f_n->actionlist(n2), (af0 from ii0(n2)) to # f_n->actionlist(n2)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((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] ⊦ |
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] ⊦
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)
| 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] ⊦ |
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)⌝ ⊦
Used terms: n1 - ii0(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)), 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)⌝ ⊦ |
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)⌝ ⊦
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)
| 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)⌝ ⊦ |
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) = τ ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n1, ii0(n2), n3
| 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) = τ ⊦ |
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)⌝ ⊦
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)
| 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)⌝ ⊦ |
⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)
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] = τ ⊦
Used terms: ⌜f_n->actionlist(n2)⌝
| ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ) |
| 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] = τ ⊦ |
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] = τ ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| 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] = τ ⊦ |
Used terms: n3
| 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)^) ⊦ |
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⌝ ^
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)
| 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⌝ ^ |
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)) ⊦
Used terms: ii0(n)
| 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)) ⊦ |
Used terms: n
| 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))^ |
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)) ⊦
| 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)) ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
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)⌝ )) ⊦
Used simplifier rules: nat freely generated by 0, +1;; ⊦ nf to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ σ to 0 = []; (s) ⊦ [] ^ = []; (s)
| 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)⌝ )) ⊦ |
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)⌝ ) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| 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)⌝ ) ⊦ |
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)⌝ ) ⊦
Used terms: ii0, af, α, startf, sf, n, f_n->actionlist, stepf, f_n->statelist, σ
| 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)⌝ ) ⊦ |
⌜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)⌝ ⊦
| ⌜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)⌝ ⊦ |
⊦ nf to m + 1 = (nf to m) + nf(m) '
⌜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)) ⊦
Used terms: n0, af
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| ⌜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)) ⊦ |
⌜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)⌝ ⊦
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)
| ⌜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)⌝ ⊦ |
⌜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)) ⊦
Used terms: n0
| ⌜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)) ⊦ |
⌜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)⌝ ⊦
| ⌜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)⌝ ⊦ |
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)) ⊦
Used terms: 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), (α 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)) ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
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)) ⊦
Used terms: 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->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)) ⊦ |
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) ⊦
| 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) ⊦ |
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)) ⊦
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)) ⊦
Used formulas: α to ii0(n0 + 1) = (α to ii0(n0)) + ((α from ii0(n0)) to # 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->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)) ⊦ |
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) ⊦
| 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) ⊦ |
⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^
Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: ⌜f_n->actionlist(n0)⌝ , α to ii0(n0)
| ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^ |
| 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)) ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
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])) ⊦
Used terms: (α to ii0(n0)) + ((α from ii0(n0)) to # f_n->actionlist(n0)), α to ii0(n0 + 1)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| 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])) ⊦ |
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]) ⊦
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)
| 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]) ⊦ |
¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝
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]) ⊦
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), α
| ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ |
| 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]) ⊦ |
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)) ⊦
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)
| 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)) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
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) ⊦
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)
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| 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) ⊦ |
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)) ⊦
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)
| 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)) ⊦ |
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) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n1, ii0(n0), n2
| 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) ⊦ |
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)) ⊦
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)
| 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)) ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#((α 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] ⊦
Used terms: ⌜f_n->actionlist(n0)⌝ , (α from ii0(n0)) to # f_n->actionlist(n0)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #((α 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] ⊦ |
#((α 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] ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| #((α 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] ⊦ |
#((α 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)) ⊦
Used terms: n2
| #((α 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)) ⊦ |
#((α 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) ⊦
| #((α 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) ⊦ |
m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]
#((α 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)) ⊦
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)
| m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m] |
| #((α 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)) ⊦ |
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) ⊦
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
| 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) ⊦ |
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)
| 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)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +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⌝ ∨ (∃ n. ¬(⌜n⌝ < # α → stepf(σ[n], α[n], σ[n +1]))) ⊦
Used terms: α, σ, stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +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⌝ ∨ (∃ n. ¬(⌜n⌝ < # α → stepf(σ[n], α[n], σ[n +1]))) ⊦ |
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])) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| 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])) ⊦ |
# σ = # α + ⌜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])) ⊦
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])) ⊦
Used formulas: # σ = # α + ⌜1⌝
| # σ = # α + ⌜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])) ⊦ |
# σ = # α + ⌜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)) ⊦
| # σ = # α + ⌜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)) ⊦ |
# σ = # α + ⌜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)⌝ ⊦
# σ = # α + ⌜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)⌝ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| # σ = # α + ⌜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)⌝ ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# σ = ⌜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) ⊦
# σ = ⌜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)
Used formulas: ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)
| # σ = ⌜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) ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# σ = ⌜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) ⊦
Used terms: n2
| # σ = ⌜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) ⊦ |
# 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) ⊦
| # 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) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜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]) ⊦
Used terms: ⌜f_n->actionlist(n2)⌝ , ⌜f_n->statelist(n2)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜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]) ⊦ |
# 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]) ⊦
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)
| # 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]) ⊦ |
# σ = ⌜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) ⊦
Used terms: 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(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) ⊦ |
# σ = ⌜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) ⊦
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)
| # σ = ⌜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) ⊦ |
# 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]) ⊦
Used terms: n2
| # 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]) ⊦ |
# 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]) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ n → (n < m ↔ false); (s)
| # 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]) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((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] ⊦
Used terms: f_n->actionlist(n2), (al0 from ii0(n2)) to # f_n->actionlist(n2)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((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] ⊦ |
# 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]) ⊦
| # 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]) ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#((σ 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] ⊦
Used terms: ⌜f_n->statelist(n2)⌝ , (σ from ii0(n2)) to # f_n->statelist(n2)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #((σ 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] ⊦ |
#((σ 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] ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| #((σ 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] ⊦ |
# 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]) ⊦
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
| # 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]) ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
#((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]) ⊦
Used terms: n1 - ii0(n2)
| #((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]) ⊦ |
# 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] ⊦
Used simplifier rules: n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| # 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] ⊦ |
#((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]) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n1, ii0(n2), n4
| #((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]) ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
#((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]) ⊦
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
| #((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]) ⊦ |
#((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]) ⊦
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)
| #((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]) ⊦ |
# 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] ⊦
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
| # 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] ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
#((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]) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: f_n->statelist(n2), a, y
| #((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]) ⊦ |
# 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]) ⊦
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)
| # 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]) ⊦ |
#((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) ⊦
Used terms: n4
| #((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) ⊦ |
# 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] ⊦
| # 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] ⊦ |
#((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) ⊦
Used terms: n4
| #((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) ⊦ |
# 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] ⊦
| # 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] ⊦ |
#((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) ⊦
Used terms: n4 + 1
| #((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) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
¬ # x < n, m < n ⊦ (x to n)[m] = x[m]
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
| ¬ # x < n, m < n ⊦ (x to n)[m] = x[m] |
| # σ = ⌜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) |
# 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)
| # 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) |
ii0(0) = 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1)
| ii0(0) = 0, n1 < ii0(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ ∃ m. ii0(m) ≤ n1 ∧ n1 < ii0(m + 1) |
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)
Used simplifier rules: <; (wellfounded) Used terms: n
| 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(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(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(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)
Used terms: n - 1
| 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) |
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)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m0
| 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) |
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)
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)
| 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) |
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)
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
| 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) |
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)
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
| 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) |
Used terms: n
| # σ = # α + ⌜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)⌝ ⊦ |
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) ⊦
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)
| 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) ⊦ |
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) ⊦
Used terms: n1
| 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) ⊦ |
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) ⊦
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
| 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) ⊦ |
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) ⊦
Used terms: 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, 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) ⊦ |
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) ⊦
| 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) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜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]) ⊦
Used terms: ⌜f_n->actionlist(n)⌝ , ⌜f_n->statelist(n)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜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]) ⊦ |
# 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]) ⊦
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)
| # 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]) ⊦ |
# 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) ⊦
Used terms: 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(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) ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# 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]) ⊦
Used terms: 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->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]) ⊦ |
# 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]) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic
| # 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]) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((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] ⊦
Used terms: f_n->statelist(n), (sf0 from ii0(n)) to # f_n->statelist(n)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((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] ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
# 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) ⊦
Used terms: n1 - ii0(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)), 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) ⊦ |
# 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] ⊦
Used simplifier rules: n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| # 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] ⊦ |
# 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) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n1, ii0(n), n2
| # 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) ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# 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] ⊦
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
| # 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] ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
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) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: f_n->statelist(n), a, y
| 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) ⊦ |
# 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]) ⊦
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)
| # 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]) ⊦ |
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) ⊦
Used terms: n2
| 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) ⊦ |
# 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] ⊦
| # 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] ⊦ |
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) ⊦
Used terms: n2 + 1
| 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) ⊦ |
# 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)) ⊦
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)
| # 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)) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((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] ⊦
Used terms: f_n->actionlist(n), (af0 from ii0(n)) to # f_n->actionlist(n)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((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] ⊦ |
# 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] ⊦
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)
| # 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] ⊦ |
Used terms: n2
| 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])) ⊦ |
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)) ⊦
| 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)) ⊦ |
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)⌝ ⊦
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)⌝ ⊦
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;;
| 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)⌝ ⊦ |
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) ⊦
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)
| 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) ⊦ |
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) ⊦
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) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| 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) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# 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) ⊦
Used terms: n0 + 1, n
| # 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) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# 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) ⊦
Used terms: n + 1, n0
| # 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) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# 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) ⊦
# 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) ⊦
Used formulas: n < n0
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → ¬ n < m; (s)
| # 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) ⊦ |
# 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) ⊦
Used terms: n
| # 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) ⊦ |
# 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) ⊦
| # 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) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜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]) ⊦
Used terms: ⌜f_n->actionlist(n)⌝ , ⌜f_n->statelist(n)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜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]) ⊦ |
# 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]) ⊦
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)
| # 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]) ⊦ |
# 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) ⊦
Used terms: n
| # 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) ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# 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]) ⊦
Used terms: n
| # 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]) ⊦ |
# 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]) ⊦
Used simplifier rules: lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # 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]) ⊦ |
Used simplifier rules: ⊦ m < n → m ≤ n; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic Used terms: n0
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) Used formulas: n0 < n
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → m ≤ n; (s)
| # 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) ⊦ |
# 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) ⊦
Used terms: n0
| # 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) ⊦ |
# 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) ⊦
| # 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) ⊦ |
# 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) ⊦
Used terms: n0
| # 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) ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# 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) ⊦
Used terms: n0
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m ≤ n → (n < m ↔ false); (s)
| # 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) ⊦ |
Used simplifier rules: ⊦ m < n → m ≤ n; (s) Used terms: n
| 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) ⊦ |
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) ⊦
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)
| 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) ⊦ |
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) ⊦
Used terms: ii0(n0) + 1
| 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) ⊦ |
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) ⊦
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
| 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) ⊦ |
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) ⊦
Used terms: n + 1
| 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) ⊦ |
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) ⊦
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
| 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) ⊦ |
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) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)
| 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) ⊦ |
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
| 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)⌝ ⊦ |
# α = ⌜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)) ⊦
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)
| # α = ⌜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)) ⊦ |
# α = ⌜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) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s)
| # α = ⌜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) ⊦ |
# 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) ⊦
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)
| # 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) ⊦ |
# 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) ⊦
Used terms: ii0(n) + 1
| # 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) ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# 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) ⊦
Used terms: n0 + 1
| # 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) ⊦ |
# 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) ⊦
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
| # 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) ⊦ |
# 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) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)
| # 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) ⊦ |
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
| 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)) ⊦ |
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)⌝ ⊦
Used terms: 0
| 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)⌝ ⊦ |
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)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| 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)) ⊦ |
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)⌝ ⊦
Used terms: 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(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)⌝ ⊦ |
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)⌝ ⊦
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)
| 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)⌝ ⊦ |
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)) ⊦
Used terms: 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->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)) ⊦ |
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)) ⊦
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)
| 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)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜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]) ⊦
Used terms: ⌜f_n->actionlist(0)⌝ , ⌜f_n->statelist(0)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜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]) ⊦ |
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]) ⊦
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)
| 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]) ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#(σ 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] ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: ⌜f_n->statelist(0)⌝ , σ to 1 + ii0(1)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #(σ 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] ⊦ |
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] ⊦
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)
| 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] ⊦ |
Used simplifier rules: ⊦ ¬ n < 0; (s) Used terms: 0
| 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)⌝ ⊦ |
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) ⊦
| 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) ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
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)⌝ )) ⊦
Used simplifier rules: nat freely generated by 0, +1;;
| 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)⌝ )) ⊦ |
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)⌝ ) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| 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)⌝ ) ⊦ |
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)⌝ ) ⊦
Used terms: ii, ii0, startf, sf, stepf, f_n->statelist, f_n->actionlist, af, α, σ
| 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)⌝ ) ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
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) ⊦
Used terms: 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)⌝ < # σ, 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) ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
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)⌝ ⊦
Used terms: n0
| 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)⌝ ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
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)⌝ ⊦
Used terms: n0
| 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)⌝ ⊦ |
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)⌝ ⊦
| 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)⌝ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜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]) ⊦
Used terms: ⌜f_n->actionlist(n0)⌝ , ⌜f_n->statelist(n0)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜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]) ⊦ |
# 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]) ⊦
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)
| # 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]) ⊦ |
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
| 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) |
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)
| 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) |
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)
Used terms: n
| 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) |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
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)
Used terms: sf(n + 1), ⌜af(n) '⌝ ^, sf(n), stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| 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) |
⌜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)
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]
| ⌜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) |
Used terms: sl, al
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.