| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ aexec(AIOAut(astartf, astepf))(aσ, α1) ∧ cexec(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^)))
Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ fwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), λ as, cs. ∃ cσ, α, aσ, α1, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α1) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α1 to ii(n0))^))) |
⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)))
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ (∀ cs. cstartf(cs) → (∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs0 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)))))
Used terms: λ as, cs. ∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)), astepf, astartf, cstepf, cstartf
| ⊦ fwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0))) |
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ (∀ cs. cstartf(cs) → (∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ cstepf(cs, a, cs0) → (∃ as0. amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs0 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))))) |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ( cstartf(cs) → (∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as))) ∧ ( as = aσ[ii(n)] ∧ cs0 = cσ[n] ∧ ⌜ii(n)⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) ∧ cstepf(cσ[n], a, cs1) → (∃ as0. amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs1 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)))))
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ( cstartf(cs) → (∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as))) ∧ ( as = aσ[ii(n)] ∧ cs0 = cσ[n] ∧ ⌜ii(n)⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) ∧ cstepf(cσ[n], a, cs1) → (∃ as0. amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs1 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))))) |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstartf(cs), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
as = aσ[ii(n)], cs0 = cσ[n], ii(n) = m, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs1 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)))
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstartf(cs), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstartf(cs), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
| C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstartf(cs), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α))
cstartf(cs), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used terms: astepf, astartf, cstepf, cstartf
| ⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α)) |
| cstartf(cs), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
⊦ ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)))
cstartf(cs), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used terms: cs, cstartf, cstepf
| ⊦ ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) |
| cstartf(cs), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ cσ, α. cs = cσ[0] ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ⊦ ∃ as. (∃ cσ, α, aσ, α0, m, n. as = aσ[m] ∧ cs = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
| cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ctrace(CIOAut(cstartf, cstepf))(α ^) → atrace(AIOAut(astartf, astepf))(α ^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used terms: α ^
| cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ctrace(CIOAut(cstartf, cstepf))(α ^) → atrace(AIOAut(astartf, astepf))(α ^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ctrace(CIOAut(cstartf, cstepf))(α ^), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
atrace(AIOAut(astartf, astepf))(α ^), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
| cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ctrace(CIOAut(cstartf, cstepf))(α ^), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β))
cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ σ, β. ¬(α ^ = β ^ ∧ cexec(CIOAut(cstartf, cstepf))(σ, β)) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used terms: α ^, cstepf, cstartf
| ⊦ ctrace(CIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ cexec(CIOAut(startf, stepf))(σ, β)) |
| cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ σ, β. ¬(α ^ = β ^ ∧ cexec(CIOAut(cstartf, cstepf))(σ, β)) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ σ, β. α ^ ≠ β ^ ∨ ¬ cfrag(CIOAut(cstartf, cstepf))(σ, β) ∨ ¬ cstartf(σ[0]) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used simplifier rules: ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ σ, β. α ^ ≠ β ^ ∨ ¬ cfrag(CIOAut(cstartf, cstepf))(σ, β) ∨ ¬ cstartf(σ[0]) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
Used terms: cσ, α
| atrace(AIOAut(astartf, astepf))(α ^), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β))
cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ σ, β. α ^ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used terms: α ^, astepf, astartf
| ⊦ atrace(AIOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ aexec(AIOAut(startf, stepf))(σ, β)) |
| cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ σ, β. α ^ = β ^ ∧ aexec(AIOAut(astartf, astepf))(σ, β) ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as)
Used simplifier rules: ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as. (∃ cσ0, α, aσ, α0, m, n. as = aσ[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(as) |
α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ (∃ cσ0, α, aσ0, α0, m, n. aσ[0] = aσ0[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ0 ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(aσ[0])
Used terms: aσ[0]
| α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ (∃ cσ0, α, aσ0, α0, m, n. aσ[0] = aσ0[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ0 ∧ (α to n0)^ = (α0 to ii(n0))^))) ∧ astartf(aσ[0]) |
α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ0, α, aσ0, α0, m, n. aσ[0] = aσ0[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ0 ∧ (α to n0)^ = (α0 to ii(n0))^))
| α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ cσ0, α, aσ0, α0, m, n. aσ[0] = aσ0[m] ∧ cσ[0] = cσ0[n] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n⌝ < # cσ0 ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ0, α) ∧ cstartf(cσ0[0]) ∧ (finp(cσ0) → ¬(∃ a, cs0. cstepf(cσ0.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ0 → ⌜ii(n0)⌝ < # aσ0 ∧ (α to n0)^ = (α0 to ii(n0))^)) |
α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ aσ[0] = aσ[0] ∧ cσ[0] = cσ[0] ∧ ⌜0⌝ < # aσ ∧ ⌜0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. 0 ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))
Used terms: cσ, α, aσ, α0, 0, 0
| α ^ = α0 ^, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ aσ[0] = aσ[0] ∧ cσ[0] = cσ[0] ∧ ⌜0⌝ < # aσ ∧ ⌜0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. 0 ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)
Used simplifier rules: ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) ⊦ ¬ afrag(AIOAut(startf, stepf))([], α); (s) ⊦ 0 ≤ m; (s) ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)) ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)), ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)
Used formulas: ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^))
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)) ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ (⌜0⌝ < # cσ ⊃ f_n->n(0);f_n->n(# cσ.l - 1)) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜(⌜n0⌝ < # cσ ⊃ f_n->n(n0);f_n->n(# cσ.l - 1))⌝ < # aσ ∧ (α to n0)^ = (α0 to (⌜n0⌝ < # cσ ⊃ f_n->n(n0);f_n->n(# cσ.l - 1)))^)
Used terms: λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ (⌜0⌝ < # cσ ⊃ f_n->n(0);f_n->n(# cσ.l - 1)) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜(⌜n0⌝ < # cσ ⊃ f_n->n(n0);f_n->n(# cσ.l - 1))⌝ < # aσ ∧ (α to n0)^ = (α0 to (⌜n0⌝ < # cσ ⊃ f_n->n(n0);f_n->n(# cσ.l - 1)))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^)
Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # cσ → ⌜f_n->n(0)⌝ < # aσ ∧ (α to 0)^ = (α0 to f_n->n(0))^ ∧ (∀ m0. m0 < f_n->n(0) → (α to 0)^ ≠ (α0 to m0)^), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^)
Used terms: 0
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜0⌝ < # cσ → ⌜f_n->n(0)⌝ < # aσ ∧ (α to 0)^ = (α0 to f_n->n(0))^ ∧ (∀ m0. m0 < f_n->n(0) → (α to 0)^ ≠ (α0 to m0)^), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^) |
[] = (α0 to f_n->n(0))^, α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜f_n->n(0)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(0) → [] ≠ (α0 to m0)^ ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^)
Used simplifier rules: ⊦ [] ^ = []; (s) ⊦ σ to 0 = []; (s) ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s)
| [] = (α0 to f_n->n(0))^, α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜f_n->n(0)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(0) → [] ≠ (α0 to m0)^ ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^) |
[] = (α0 to f_n->n(0))^, α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜f_n->n(0)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), 0 < f_n->n(0) → [] ≠ (α0 to 0)^, ∀ m0. m0 < f_n->n(0) → [] ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^)
Used terms: 0
| [] = (α0 to f_n->n(0))^, α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜f_n->n(0)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), 0 < f_n->n(0) → [] ≠ (α0 to 0)^, ∀ m0. m0 < f_n->n(0) → [] ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ f_n->n(0) = 0 ∧ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^) |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^)
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) ⊦ [] ^ = []; (s) ⊦ σ to 0 = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))) ∧ (⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^) |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n0⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ mon≤(λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ |
⊦ mon≤(ii) ↔ (∀ n. ii(n) ≤ ii(n + 1))
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ¬ (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)) ≤ (⌜n + 1⌝ < # cσ ⊃ f_n->n(n + 1);f_n->n(# cσ.l - 1)) ⊦
Used terms: λ n. (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1))
| ⊦ mon≤(ii) ↔ (∀ n. ii(n) ≤ ii(n + 1)) |
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ n. ¬ (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)) ≤ (⌜n + 1⌝ < # cσ ⊃ f_n->n(n + 1);f_n->n(# cσ.l - 1)) ⊦ |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], (⌜n⌝ + ⌜1⌝ < # cσ ⊃ f_n->n(n + 1);f_n->n(# cσ.l - 1)) < (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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 + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], (⌜n⌝ + ⌜1⌝ < # cσ ⊃ f_n->n(n + 1);f_n->n(# cσ.l - 1)) < (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], f_n->n(n + 1) < (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)), ⌜n⌝ + ⌜1⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], f_n->n(# cσ.l - 1) < (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n⌝ + ⌜1⌝ < # cσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], f_n->n(n + 1) < (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)), ⌜n⌝ + ⌜1⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (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 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
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ < # cσ → ⌜f_n->n(n)⌝ < # aσ ∧ (α to n)^ = (α0 to f_n->n(n))^ ∧ (∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦
Used terms: n
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ < # cσ → ⌜f_n->n(n)⌝ < # aσ ∧ (α to n)^ = (α0 to f_n->n(n))^ ∧ (∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ |
(α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| (α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ |
α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n + 1⌝ < # cσ → ⌜f_n->n(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to f_n->n(n + 1))^ ∧ (∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦
Used terms: n + 1
| α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n + 1⌝ < # cσ → ⌜f_n->n(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to f_n->n(n + 1))^ ∧ (∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦ |
(α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, (α to n + 1)^ = (α0 to f_n->n(n + 1))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^ ⊦
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)
| (α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, (α to n + 1)^ = (α0 to f_n->n(n + 1))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^ ⊦ |
⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝
(α to n + 1)^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦
((α to n) + ⌜α[n] '⌝ )^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → ((α to n) + ⌜α[n] '⌝ )^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦
Used terms: n, α
| ⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝ |
| (α to n + 1)^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦ |
(α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, (α to n + 1)^ = (α0 to f_n->n(n + 1))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, # α < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^ ⊦
Used simplifier rules: lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| (α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, (α to n + 1)^ = (α0 to f_n->n(n + 1))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, # α < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α to n + 1)^ ≠ (α0 to m0)^ ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜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 Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| ((α to n) + ⌜α[n] '⌝ )^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → ((α to n) + ⌜α[n] '⌝ )^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦ |
(α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, ((α to n) + ⌜α[n] '⌝ )^ = (α0 to f_n->n(n + 1))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # α, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦
| (α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, ((α to n) + ⌜α[n] '⌝ )^ = (α0 to f_n->n(n + 1))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # α, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦ |
⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^
(α to n)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(α to n), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: ⌜α[n] '⌝ , α to n
| ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^ |
| (α to n)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, (α to n)^ = (α0 to f_n->n(n))^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(α to n), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^ ⊦ |
(α to n)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, (α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # α, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s)
| (α to n)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, (α to n)^ = (α0 to f_n->n(n))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # α, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α to n)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n))^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α0 to f_n->n(n))^ ≠ (α0 to m0)^ ⊦
| (α0 to f_n->n(n))^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, f_n->n(n + 1) < f_n->n(n), ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α0 to f_n->n(n))^ ≠ (α0 to m0)^ ⊦ |
⊦ m < n ↔ (∃ m0. m + m0 = n ∧ m0 ≠ 0)
(α0 to f_n->n(n))^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # α, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α0 to f_n->n(n))^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∃ m0. f_n->n(n + 1) + m0 = f_n->n(n) ∧ m0 ≠ 0 ⊦
Used terms: f_n->n(n), f_n->n(n + 1)
| ⊦ m < n ↔ (∃ m0. m + m0 = n ∧ m0 ≠ 0) |
| (α0 to f_n->n(n))^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # α, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n) → (α0 to f_n->n(n))^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∃ m0. f_n->n(n + 1) + m0 = f_n->n(n) ∧ m0 ≠ 0 ⊦ |
f_n->n(n + 1) + n0 = f_n->n(n), (α0 to f_n->n(n))^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α0 to f_n->n(n))^ ≠ (α0 to m0)^ ⊦
| f_n->n(n + 1) + n0 = f_n->n(n), (α0 to f_n->n(n))^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n) → (α0 to f_n->n(n))^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1) + n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦
| (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1) + n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^ ⊦
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)
| (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), f_n->n(n + 1) < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦
Used terms: f_n->n(n + 1)
| (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), f_n->n(n + 1) < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < m + n ↔ n ≠ 0; (s)
| (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, # α0 < ⌜f_n->n(n + 1)⌝ , ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦
# σ0 = ⌜f_n->n(n + 1)⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = σ0 ^, α ^ = α0 ^, f_n->n(0) = 0, α0 = σ0 + σ1, (α0 to f_n->n(n + 1) + n0)^ ≠ σ0 ^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜f_n->n(n + 1)⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → σ0 ^ ≠ (α0 to m0)^ ⊦
Used simplifier rules: ⊦ ¬ # σ < ⌜n⌝ → (σ0 = σ to n ∧ σ1 = σ from n ↔ σ = σ0 + σ1 ∧ # σ0 = ⌜n⌝ ); (elim) Used terms: α0, f_n->n(n + 1), σ0, σ1
| (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, # α0 < ⌜f_n->n(n + 1)⌝ , ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^ ⊦ |
(α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , # α0 < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^ ⊦
Used simplifier rules: ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , # α0 < # aσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^ ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# aσ = # α0 + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, # α0 < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n. ⌜n⌝ < # α0 → astepf(aσ[n], α0[n], aσ[n +1]) ⊦
Used terms: α0, aσ, astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # aσ = # α0 + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, # α0 < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n. ⌜n⌝ < # α0 → astepf(aσ[n], α0[n], aσ[n +1]) ⊦ |
# aσ = # α0 + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , # α0 < # aσ, astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ n1. ⌜n1⌝ < # α0 → astepf(aσ[n1], α0[n1], aσ[n1 + 1]) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # aσ = # α0 + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , # α0 < # aσ, astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ n1. ⌜n1⌝ < # α0 → astepf(aσ[n1], α0[n1], aσ[n1 + 1]) ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , # aσ = # α0 + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, # α0 < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, astartf(aσ[0]), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. ⌜n1⌝ < # α0 → astepf(aσ[n1], α0[n1], aσ[n1 + 1]), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , # aσ = # α0 + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, # α0 < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, astartf(aσ[0]), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. ⌜n1⌝ < # α0 → astepf(aσ[n1], α0[n1], aσ[n1 + 1]), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ |
# aσ = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , # α0 < # aσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, astartf(aσ[0]), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ n1. ⌜n1⌝ < # α0 → astepf(aσ[n1], α0[n1], aσ[n1 + 1]), ∀ n1. ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (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∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s)
| # aσ = # α0 + ⌜1⌝ , # cσ = # α + ⌜1⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = (α0 to f_n->n(n + 1))^, α ^ = α0 ^, f_n->n(0) = 0, (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to f_n->n(n + 1))^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜n⌝ < # cσ, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, # α0 < ⌜f_n->n(n + 1)⌝ , # α0 < # aσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, astartf(aσ[0]), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) → (α0 to f_n->n(n + 1))^ ≠ (α0 to m0)^, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ n1. ⌜n1⌝ < # α0 → astepf(aσ[n1], α0[n1], aσ[n1 + 1]), ∀ n1. ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]) ⊦ |
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜m⌝ + ∞ = ∞; (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 ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ¬ n < n; (s) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # σ0 = ⌜f_n->n(n + 1)⌝ , (α0 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = σ0 ^, α ^ = α0 ^, f_n->n(0) = 0, α0 = σ0 + σ1, (α0 to f_n->n(n + 1) + n0)^ ≠ σ0 ^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜f_n->n(n + 1)⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (α0 to f_n->n(n + 1) + n0)^ ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → σ0 ^ ≠ (α0 to m0)^ ⊦ |
# σ0 = ⌜f_n->n(n + 1)⌝ , (σ0 + σ1 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = σ0 ^, α ^ = (σ0 + σ1)^, f_n->n(0) = 0, (σ0 + σ1 to f_n->n(n + 1) + n0)^ ≠ σ0 ^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, σ0 + σ1), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (σ0 + σ1 to f_n->n(n + 1) + n0)^ ≠ (σ0 + σ1 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (σ0 + σ1 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (σ0 + σ1 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → σ0 ^ ≠ (σ0 + σ1 to m0)^ ⊦
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∞ + n∞1 < n∞1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # σ0 = ⌜f_n->n(n + 1)⌝ , (σ0 + σ1 to f_n->n(n + 1) + n0)^ + ⌜α[n] '⌝ ^ = σ0 ^, α ^ = (σ0 + σ1)^, f_n->n(0) = 0, (σ0 + σ1 to f_n->n(n + 1) + n0)^ ≠ σ0 ^, aσ ≠ [], cσ ≠ [], n0 ≠ 0, ⌜f_n->n(n + 1)⌝ + ⌜n0⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜f_n->n(n + 1)⌝ < # aσ, ⌜n⌝ < # α, afrag(AIOAut(astartf, astepf))(aσ, σ0 + σ1), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < f_n->n(n + 1) + n0 → (σ0 + σ1 to f_n->n(n + 1) + n0)^ ≠ (σ0 + σ1 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (σ0 + σ1 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (σ0 + σ1 to m0)^), ∀ m0. m0 < f_n->n(n + 1) → σ0 ^ ≠ (σ0 + σ1 to m0)^ ⊦ |
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜al⌝ ^ ≠ ∞; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ ⌜x⌝ + σ to m + # x = ⌜x⌝ + (σ to m); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ σ + σ0 = σ ↔ σ0 = [] ∨ # σ = ∞; (s)
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], f_n->n(# cσ.l - 1) < (⌜n⌝ < # cσ ⊃ f_n->n(n);f_n->n(# cσ.l - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n⌝ + ⌜1⌝ < # cσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], csl ≠ [], f_n->n(n) ≠ 0, f_n->n(# csl - 1) < (n < # csl ⊃ f_n->n(n);f_n->n(# csl - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(hd(csl)), # csl ≤ n + 1, ∀ n0. n0 < # csl → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: ⊦ ¬ n < n; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ .l = x; (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 ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ⌜m⌝ < ∞; (s)
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], csl ≠ [], f_n->n(n) ≠ 0, f_n->n(# csl - 1) < (n < # csl ⊃ f_n->n(n);f_n->n(# csl - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(hd(csl)), # csl ≤ n + 1, ∀ n0. n0 < # csl → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0) |
α ^ = α0 ^, csl = cs2 + csl0, f_n->n(0) = 0, aσ ≠ [], csl ≠ [], f_n->n(n) ≠ 0, f_n->n(# csl - 1) < (n < # csl ⊃ f_n->n(n);f_n->n(# csl - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(cs2), # csl ≤ n + 1, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n0 < # csl → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0)
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y
| α ^ = α0 ^, csl = cs2 + csl0, f_n->n(0) = 0, aσ ≠ [], csl ≠ [], f_n->n(n) ≠ 0, f_n->n(# csl - 1) < (n < # csl ⊃ f_n->n(n);f_n->n(# csl - 1)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(cs2), # csl ≤ n + 1, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n0 < # csl → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0) |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], f_n->n(n) ≠ 0, f_n->n(# csl0) < (¬ # csl0 < n ⊃ f_n->n(n);f_n->n(# csl0)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs2 '⌝ + ⌜csl0⌝ , α), cstartf(cs2), # csl0 ≤ n, ∀ n0. ¬ # csl0 < n0 → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf((cs2 ' + csl0).last, a, cs0)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ a + x = a ' + x; (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) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ a ' + x ≠ []; (s)
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], f_n->n(n) ≠ 0, f_n->n(# csl0) < (¬ # csl0 < n ⊃ f_n->n(n);f_n->n(# csl0)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜cs2 '⌝ + ⌜csl0⌝ , α), cstartf(cs2), # csl0 ≤ n, ∀ n0. ¬ # csl0 < n0 → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf((cs2 ' + csl0).last, a, cs0) |
Used simplifier rules: ⊦ m < n → m ≤ n; (s) ⊦ ¬ n < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s)
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n0⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^) ⊦ ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ |
α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n0⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^
| α ^ = α0 ^, f_n->n(0) = 0, aσ ≠ [], cσ ≠ [], ⌜n0⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # cσ → ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ ∧ (∀ m0. m0 < f_n->n(n0) → (α to n0)^ ≠ (α0 to m0)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ⌜f_n->n(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to f_n->n(n0))^ |
Used terms: n0
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∀ n. ⌜n⌝ < # cσ → (∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)), ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^), ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii. ii(0) = 0 ∧ mon≤(ii) ∧ (∀ n0. ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^), ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m)
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
Used terms: α, n
| ⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m) |
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ # α < ⌜n⌝ → ¬ # α0 ^ < ⌜n0⌝ ∧ (α to n)^ = α0 ^ to n0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ # α < ⌜n⌝ → ¬ # α0 ^ < ⌜n0⌝ ∧ (α to n)^ = α0 ^ to n0, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], # α < ⌜n⌝ , ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
α ^ = α0 ^, (α to n)^ = α0 ^ to n0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], # α < ⌜n⌝ , ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, # α < ⌜n⌝ , # α < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
Used simplifier rules: ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, # α < ⌜n⌝ , # α < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , α ^ = α0 ^, aσ ≠ [], cσ ≠ [], # α < # cσ, # α < ⌜n⌝ , ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , α ^ = α0 ^, aσ ≠ [], cσ ≠ [], # α < # cσ, # α < ⌜n⌝ , ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
α ^ = α0 ^, ⌜# csl⌝ = # α + ⌜1⌝ , aσ ≠ [], csl ≠ [], n < # csl, # α < ⌜n⌝ , # α < ⌜# csl⌝ , afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(hd(csl)), ∀ n0. ⌜n0⌝ < # α → cstepf(csl[n0], α[n0], csl[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^)
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ⌜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 ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ m +1 = m + 1; (s)
| α ^ = α0 ^, ⌜# csl⌝ = # α + ⌜1⌝ , aσ ≠ [], csl ≠ [], n < # csl, # α < ⌜n⌝ , # α < ⌜# csl⌝ , afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(hd(csl)), ∀ n0. ⌜n0⌝ < # α → cstepf(csl[n0], α[n0], csl[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a, cs0. cstepf(csl.last, a, cs0), ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
Used simplifier rules: ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ a ' + x ≠ []; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜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 ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a + x = a ' + x; (s) lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y
| α ^ = α0 ^, (α to n)^ = α0 ^ to n0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ (α to n)^ = (α0 to m)^ ∧ (∀ m0. m0 < m → (α to n)^ ≠ (α0 to m0)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
α ^ = α0 ^, (α to n)^ = α0 ^ to n0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ # α0 ^ < ⌜n0⌝ → (∃ m. ¬ # α0 < ⌜m⌝ ∧ α0 ^ to n0 = (α0 to m)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
Used terms: α0, n0
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| α ^ = α0 ^, (α to n)^ = α0 ^ to n0, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ¬ # α0 ^ < ⌜n0⌝ → (∃ m. ¬ # α0 < ⌜m⌝ ∧ α0 ^ to n0 = (α0 to m)^), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
Used simplifier rules: <; (wellfounded) Used terms: n1
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
α ^ = α0 ^, (α to n)^ = α0 ^ to n0, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
| α ^ = α0 ^, (α to n)^ = α0 ^ to n0, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^), ⌜n1⌝ < # aσ ∧ α0 ^ to n0 = (α0 to n1)^ ∧ (∀ m0. m0 < n1 → α0 ^ to n0 ≠ (α0 to m0)^)
Used terms: n1
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^), ⌜n1⌝ < # aσ ∧ α0 ^ to n0 = (α0 to n1)^ ∧ (∀ m0. m0 < n1 → α0 ^ to n0 ≠ (α0 to m0)^) |
α ^ = α0 ^, (α to n)^ = α0 ^ to n0, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^), ⌜n1⌝ < # aσ ∧ (n2 < n1 → α0 ^ to n0 ≠ (α0 to n2)^)
| α ^ = α0 ^, (α to n)^ = α0 ^ to n0, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^), ⌜n1⌝ < # aσ ∧ (n2 < n1 → α0 ^ to n0 ≠ (α0 to n2)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n1⌝ < # aσ, ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n2)^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], n2 < n1, ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ ⌜n1⌝ < # aσ, ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
(α to n)^ = α ^ to n0, α ^ = ⌜af⌝ ^, α ^ to n0 = ⌜af to n1⌝ ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜af⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α ^ < ⌜n0⌝ , ¬ ⌜n1⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α ^ to n0 = ⌜af to m⌝ ^ ∧ (∀ m0. m0 < m → α ^ to n0 ≠ ⌜af to m0⌝ ^)
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ afrag(AIOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α)); (ss) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf
| (α to n)^ = α ^ to n0, α ^ = ⌜af⌝ ^, α ^ to n0 = ⌜af to n1⌝ ^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, ⌜af⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α ^ < ⌜n0⌝ , ¬ ⌜n1⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α ^ to n0 = ⌜af to m⌝ ^ ∧ (∀ m0. m0 < m → α ^ to n0 ≠ ⌜af to m0⌝ ^) |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ ⌜m⌝ + ∞ = ∞; (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 ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜m⌝ < ∞; (s) Used terms: ⌜af⌝ , aσ, astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n2)^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], n2 < n1, ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 < ⌜n1⌝ , ¬ # α0 ^ < ⌜n0⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n2)^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], n2 < n1, ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n2)^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], n2 < n1, ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
α ^ = α0 ^, (α to n)^ = α0 ^ to n0, α0 ^ to n0 = (α0 to n1)^, α0 ^ to n0 = (α0 to n2)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, n2 < n1, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^), ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
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) ⊦ m < n → ¬ n < m; (s) Used terms: n2, α, n, α0, n0, aσ, cσ, astartf, astepf, cstartf, cstepf
| α ^ = α0 ^, (α to n)^ = α0 ^ to n0, α0 ^ to n0 = (α0 to n1)^, α0 ^ to n0 = (α0 to n2)^, aσ ≠ [], cσ ≠ [], ⌜n⌝ < # cσ, n2 < n1, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^), ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
(α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n3)^, α0 ^ to n0 = (α0 to n2)^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n3⌝ < # aσ, n2 < n1, ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < n3 → α0 ^ to n0 ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^)
| (α to n)^ = α0 ^ to n0, α ^ = α0 ^, α0 ^ to n0 = (α0 to n3)^, α0 ^ to n0 = (α0 to n2)^, α0 ^ to n0 = (α0 to n1)^, aσ ≠ [], cσ ≠ [], ⌜n3⌝ < # aσ, n2 < n1, ⌜n⌝ < # cσ, afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), ¬ # α0 ^ < ⌜n0⌝ , ¬ # α0 < ⌜n1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ m0. m0 < n3 → α0 ^ to n0 ≠ (α0 to m0)^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n, α, n0, α0, n3, aσ, cσ, astartf, astepf, cstartf, cstepf. n < n1 → (α to n0)^ = α0 ^ to n3 ∧ α ^ = α0 ^ ∧ α0 ^ to n3 = (α0 to n)^ ∧ aσ ≠ [] ∧ cσ ≠ [] ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ ¬ # α0 ^ < ⌜n3⌝ ∧ ¬ # α0 < ⌜n⌝ ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1) → (∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n3 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n3 ≠ (α0 to m0)^)) ⊦ ∃ m. ⌜m⌝ < # aσ ∧ α0 ^ to n0 = (α0 to m)^ ∧ (∀ m0. m0 < m → α0 ^ to n0 ≠ (α0 to m0)^) |
Used terms: n3
| as = aσ[ii(n)], cs0 = cσ[n], ii(n) = m, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs1 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) |
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs1 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^)))
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ∃ as0. amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, as0) ∧ (∃ cσ, α, aσ, α0, m, n. as0 = aσ[m] ∧ cs1 = cσ[n] ∧ ⌜m⌝ < # aσ ∧ ⌜n⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n) = m ∧ mon≤(ii) ∧ (∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^))) |
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, aσ[ii(n + 1)]) ∧ (∃ cσ, α, aσ0, α0, m, n0. aσ[ii(n + 1)] = aσ0[m] ∧ cs1 = cσ[n0] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n0) = m ∧ mon≤(ii) ∧ (∀ n1. n0 ≤ n1 ∧ ⌜n1⌝ < # cσ → ⌜ii(n1)⌝ < # aσ0 ∧ (α to n1)^ = (α0 to ii(n1))^)))
Used terms: aσ[ii(n + 1)]
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, aσ[ii(n + 1)]) ∧ (∃ cσ, α, aσ0, α0, m, n0. aσ[ii(n + 1)] = aσ0[m] ∧ cs1 = cσ[n0] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n0) = m ∧ mon≤(ii) ∧ (∀ n1. n0 ≤ n1 ∧ ⌜n1⌝ < # cσ → ⌜ii(n1)⌝ < # aσ0 ∧ (α to n1)^ = (α0 to ii(n1))^))) |
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, aσ[ii(n + 1)]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ∃ cσ, α, aσ0, α0, m, n0. aσ[ii(n + 1)] = aσ0[m] ∧ cs1 = cσ[n0] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n0) = m ∧ mon≤(ii) ∧ (∀ n1. n0 ≤ n1 ∧ ⌜n1⌝ < # cσ → ⌜ii(n1)⌝ < # aσ0 ∧ (α to n1)^ = (α0 to ii(n1))^))
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ amove(AIOAut(astartf, astepf))(aσ[ii(n)], ⌜a '⌝ ^, aσ[ii(n + 1)]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ |
⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ aσ[ii(n)] = sl[0] ∧ aσ[ii(n + 1)] = sl.last ∧ α ^ = ⌜a '⌝ ^) ⊦
Used terms: aσ[ii(n + 1)], ⌜a '⌝ ^, aσ[ii(n)], astepf, astartf
| ⊦ amove(AIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. afrag*(AIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ α, sl. ¬(afrag*(AIOAut(astartf, astepf))(⌜sl⌝ , α) ∧ aσ[ii(n)] = sl[0] ∧ aσ[ii(n + 1)] = sl.last ∧ α ^ = ⌜a '⌝ ^) ⊦ |
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ α1, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α1) ∨ ¬ finp(α1) ∨ aσ[ii(n)] ≠ sl[0] ∨ aσ[ii(n + 1)] ≠ sl.last ∨ α1 ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ afrag*(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ α1, sl. ¬ afrag(AIOAut(astartf, astepf))(⌜sl⌝ , α1) ∨ ¬ finp(α1) ∨ aσ[ii(n)] ≠ sl[0] ∨ aσ[ii(n + 1)] ≠ sl.last ∨ α1 ^ ≠ ⌜a '⌝ ^ ⊦ |
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) +1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) +1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) +1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used terms: (α0 to ii(n + 1)) from ii(n), ((aσ to ii(n + 1) +1) from ii(n)).l
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) +1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) +1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) +1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n ∧ ⌜n⌝ < # cσ → ⌜ii(n)⌝ < # aσ ∧ (α to n)^ = (α0 to ii(n))^, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used terms: n
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n ∧ ⌜n⌝ < # cσ → ⌜ii(n)⌝ < # aσ ∧ (α to n)^ = (α0 to ii(n))^, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ m ≤ m; (s)
| (α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n + 1 ∧ ⌜n + 1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used terms: n + 1
| (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n + 1 ∧ ⌜n + 1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
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) ⊦ m ≤ m + n; (s)
| (α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ mon≤(ii) ↔ (∀ m, n. m ≤ n → ii(m) ≤ ii(n))
(α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used terms: ii
| ⊦ mon≤(ii) ↔ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) |
| (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
| (α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n + 1 → ii(n) ≤ ii(n + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used terms: n, n + 1
| (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n + 1 → ii(n) ≤ ii(n + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ m + n; (s)
| (α to n)^ = (α0 to ii(n))^, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
(α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used formulas: ⌜n⌝ + ⌜1⌝ < # cσ
| (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (α0 to ii(n + 1))^, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
| (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (α0 to ii(n + 1))^, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
# σ0 = ⌜ii(n)⌝ , (α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = σ0 + σ1, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ ¬ # σ < ⌜n⌝ → (σ0 = σ to n ∧ σ1 = σ from n ↔ σ = σ0 + σ1 ∧ # σ0 = ⌜n⌝ ); (elim) Used terms: α0 to ii(n + 1), ii(n), σ0, σ1
| (α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (α0 to ii(n + 1))^, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , #(α0 to ii(n + 1)) < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (α0 to ii(n + 1))^, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , #(α0 to ii(n + 1)) < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝
(α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, # α0 < ⌜ii(n + 1)⌝ , #(α0 to ii(n + 1)) < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) Used terms: ii(n + 1), α0
| ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ |
| (α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, # α0 < ⌜ii(n + 1)⌝ , #(α0 to ii(n + 1)) < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (α0 to ii(n + 1))^, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , #(α0 to ii(n + 1)) < # aσ, # α0 < ⌜ii(n + 1)⌝ , # α0 < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (α0 to ii(n + 1))^, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , #(α0 to ii(n + 1)) < # aσ, # α0 < ⌜ii(n + 1)⌝ , # α0 < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, α0 = ⌜al0⌝ , # α0 < # aσ, # α0 < ⌜ii(n + 1)⌝ , #(α0 to ii(n + 1)) < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s)
| (α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, α0 = ⌜al0⌝ , # α0 < # aσ, # α0 < ⌜ii(n + 1)⌝ , #(α0 to ii(n + 1)) < # aσ, #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, (α to n)^ = ⌜al0 to ii(n)⌝ ^, #(al0 to ii(n + 1)) < ii(n + 1), ⌜# al0⌝ < # aσ, # al0 < ii(n + 1), ⌜#(al0 to ii(n + 1))⌝ < # aσ, #(al0 to ii(n + 1)) < ii(n), ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦
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 ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s)
| (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, (α to n)^ = ⌜al0 to ii(n)⌝ ^, #(al0 to ii(n + 1)) < ii(n + 1), ⌜# al0⌝ < # aσ, # al0 < ii(n + 1), ⌜#(al0 to ii(n + 1))⌝ < # aσ, #(al0 to ii(n + 1)) < ii(n), ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = ⌜al0 to ii(n)⌝ ^, (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, aσ = ⌜asl0⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, #(al0 to ii(n + 1)) < ii(n), ⌜#(al0 to ii(n + 1))⌝ < # aσ, # al0 < ii(n + 1), ⌜# al0⌝ < # aσ, #(al0 to ii(n + 1)) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ afrag(AIOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| (α to n)^ = ⌜al0 to ii(n)⌝ ^, (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, aσ = ⌜asl0⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, #(al0 to ii(n + 1)) < ii(n), ⌜#(al0 to ii(n + 1))⌝ < # aσ, # al0 < ii(n + 1), ⌜# al0⌝ < # aσ, #(al0 to ii(n + 1)) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, ⌜al0⌝ ), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n)^ = ⌜al0 to ii(n)⌝ ^, (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, #(al0 to ii(n + 1)) + 1 < # asl0, #(al0 to ii(n + 1)) < # asl0, # al0 + 1 < # asl0, # al0 < # asl0, ii(n) < # asl0, ii(n + 1) < # asl0, #(al0 to ii(n + 1)) < ii(n), # al0 < ii(n + 1), #(al0 to ii(n + 1)) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astartf(hd(asl0)), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(asl0 to ii(n + 1) + 1) from ii(n)⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ asl0[ii(n + 1)] ≠ ((asl0 to ii(n + 1) + 1) from ii(n)).last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ m +1 = m + 1; (s) ⊦ # x = 0 ↔ x = []; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) 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) ⊦ n + 0 = n; (s) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| (α to n)^ = ⌜al0 to ii(n)⌝ ^, (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, #(al0 to ii(n + 1)) + 1 < # asl0, #(al0 to ii(n + 1)) < # asl0, # al0 + 1 < # asl0, # al0 < # asl0, ii(n) < # asl0, ii(n + 1) < # asl0, #(al0 to ii(n + 1)) < ii(n), # al0 < ii(n + 1), #(al0 to ii(n + 1)) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astartf(hd(asl0)), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(asl0 to ii(n + 1) + 1) from ii(n)⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ asl0[ii(n + 1)] ≠ ((asl0 to ii(n + 1) + 1) from ii(n)).last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, (α to n)^ = ⌜al0 to ii(n)⌝ ^, asl0 = as + asl, asl0 ≠ [], #(al0 to ii(n + 1)) < ii(n + 1), # al0 < ii(n + 1), #(al0 to ii(n + 1)) < ii(n), ii(n + 1) < # asl0, ii(n) < # asl0, # al0 < # asl0, # al0 + 1 < # asl0, #(al0 to ii(n + 1)) < # asl0, #(al0 to ii(n + 1)) + 1 < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(asl0 to ii(n + 1) + 1) from ii(n)⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ asl0[ii(n + 1)] ≠ ((asl0 to ii(n + 1) + 1) from ii(n)).last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: asl0, as, y
| (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, (α to n)^ = ⌜al0 to ii(n)⌝ ^, asl0 = as + asl, asl0 ≠ [], #(al0 to ii(n + 1)) < ii(n + 1), # al0 < ii(n + 1), #(al0 to ii(n + 1)) < ii(n), ii(n + 1) < # asl0, ii(n) < # asl0, # al0 < # asl0, # al0 + 1 < # asl0, #(al0 to ii(n + 1)) < # asl0, #(al0 to ii(n + 1)) + 1 < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ , ⌜al0⌝ ), astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(asl0 to ii(n + 1) + 1) from ii(n)⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ asl0[ii(n + 1)] ≠ ((asl0 to ii(n + 1) + 1) from ii(n)).last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
(α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, (α to n)^ = ⌜al0 to ii(n)⌝ ^, asl ≠ [], #(al0 to ii(n + 1)) < # asl, # al0 < # asl, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, #(al0 to ii(n + 1)) < ii(n + 1), # al0 < ii(n + 1), #(al0 to ii(n + 1)) < ii(n), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl⌝ , ⌜al0⌝ ), astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n + 1) ≤ # asl, ii(n) ≤ # asl, ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜as ' + (asl to ii(n + 1)) from ii(n)⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ (as ' + asl)[ii(n + 1)] ≠ (as ' + (asl to ii(n + 1)) from ii(n)).last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ a + x = a ' + x; (s) ⊦ a ' + x to n + 1 = a + (x to n); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s)
| (α to n + 1)^ = ⌜al0 to ii(n + 1)⌝ ^, (α to n)^ = ⌜al0 to ii(n)⌝ ^, asl ≠ [], #(al0 to ii(n + 1)) < # asl, # al0 < # asl, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, #(al0 to ii(n + 1)) < ii(n + 1), # al0 < ii(n + 1), #(al0 to ii(n + 1)) < ii(n), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜as '⌝ + ⌜asl⌝ , ⌜al0⌝ ), astartf(as), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n + 1) ≤ # asl, ii(n) ≤ # asl, ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜as ' + (asl to ii(n + 1)) from ii(n)⌝ , ⌜(al0 to ii(n + 1)) from ii(n)⌝ ) ∨ (as ' + asl)[ii(n + 1)] ≠ (as ' + (asl to ii(n + 1)) from ii(n)).last ∨ ⌜(al0 to ii(n + 1)) from ii(n)⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] 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 trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ # x = 0 ↔ x = []; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m < n → ¬ n < m; (s) Used terms: ⌜al0⌝ , ⌜as '⌝ + ⌜asl⌝ , astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ0 = ⌜ii(n)⌝ , (α to n + 1)^ = (α0 to ii(n + 1))^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = σ0 + σ1, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ #(α0 to ii(n + 1)) < ⌜ii(n)⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦ |
# σ0 = ⌜ii(n)⌝ , (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (σ0 + σ1)^, α0 to ii(n + 1) = σ0 + σ1, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦
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∞ + n∞1 < n∞1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # σ0 = ⌜ii(n)⌝ , (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = (σ0 + σ1)^, α0 to ii(n + 1) = σ0 + σ1, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦ |
# σ0 = ⌜ii(n)⌝ , (α to n + 1)^ = (σ0 + σ1)^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = σ0 + σ1, σ0 = ⌜al0⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ ≠ σ to n; (s)
| # σ0 = ⌜ii(n)⌝ , (α to n + 1)^ = (σ0 + σ1)^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = σ0 + σ1, σ0 = ⌜al0⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + σ1 ^, α0 to ii(n + 1) = ⌜al0⌝ + σ1, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)
| # al0 = ii(n), (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + σ1 ^, α0 to ii(n + 1) = ⌜al0⌝ + σ1, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + σ1 ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + σ1, σ1 = ⌜al1⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦
# al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + σ1 ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + σ1, σ1 = ⌜af0⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + σ1 ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + σ1, σ1 = ⌜al1⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , ⌜al1⌝ ) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| # al0 = ii(n), (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , ⌜al1⌝ ) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), # σ0 = ⌜ii(n + 1) + 1⌝ , (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, aσ = σ0 + σ1, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ # aσ < ⌜ii(n + 1) + 1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(σ0 from ii(n)).l⌝ , ⌜al1⌝ ) ∨ aσ[ii(n)] ≠ (σ0 from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ (σ0 from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ¬ # σ < ⌜n⌝ → (σ0 = σ to n ∧ σ1 = σ from n ↔ σ = σ0 + σ1 ∧ # σ0 = ⌜n⌝ ); (elim) Used terms: aσ, ii(n + 1) + 1, σ0, σ1
| # al0 = ii(n), # σ0 = ⌜ii(n + 1) + 1⌝ , (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, aσ = σ0 + σ1, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ # aσ < ⌜ii(n + 1) + 1⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(σ0 from ii(n)).l⌝ , ⌜al1⌝ ) ∨ aσ[ii(n)] ≠ (σ0 from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ (σ0 from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), # σ0 = ⌜ii(n + 1)⌝ + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # σ0 + # σ1, ⌜ii(n + 1)⌝ < # σ0 + # σ1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(σ0 + σ1, α0), astartf((σ0 + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(σ0 from ii(n)).l⌝ , ⌜al1⌝ ) ∨ (σ0 + σ1)[ii(n)] ≠ (σ0 from ii(n)).l[0] ∨ (σ0 + σ1)[ii(n + 1)] ≠ (σ0 from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
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∞ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < 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) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # al0 = ii(n), # σ0 = ⌜ii(n + 1)⌝ + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # σ0 + # σ1, ⌜ii(n + 1)⌝ < # σ0 + # σ1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(σ0 + σ1, α0), astartf((σ0 + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(σ0 from ii(n)).l⌝ , ⌜al1⌝ ) ∨ (σ0 + σ1)[ii(n)] ≠ (σ0 from ii(n)).l[0] ∨ (σ0 + σ1)[ii(n + 1)] ≠ (σ0 from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# σ0 = ⌜ii(n + 1)⌝ + ⌜1⌝ , # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , σ0 = ⌜asl0⌝ , ⌜ii(n + 1)⌝ < # σ0 + # σ1, ⌜ii(n)⌝ < # σ0 + # σ1, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(σ0 + σ1, α0), astartf((σ0 + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(σ0 from ii(n)).l⌝ , ⌜al1⌝ ) ∨ (σ0 + σ1)[ii(n)] ≠ (σ0 from ii(n)).l[0] ∨ (σ0 + σ1)[ii(n + 1)] ≠ (σ0 from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜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
| # σ0 = ⌜ii(n + 1)⌝ + ⌜1⌝ , # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , σ0 = ⌜asl0⌝ , ⌜ii(n + 1)⌝ < # σ0 + # σ1, ⌜ii(n)⌝ < # σ0 + # σ1, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(σ0 + σ1, α0), astartf((σ0 + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜(σ0 from ii(n)).l⌝ , ⌜al1⌝ ) ∨ (σ0 + σ1)[ii(n)] ≠ (σ0 from ii(n)).l[0] ∨ (σ0 + σ1)[ii(n + 1)] ≠ (σ0 from ii(n)).l.last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < ⌜# asl0⌝ + # σ1, ⌜ii(n + 1)⌝ < ⌜# asl0⌝ + # σ1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ (⌜asl0⌝ + σ1)[ii(n)] ≠ asl0[ii(n)] ∨ (⌜asl0⌝ + σ1)[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (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) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m = n + 1 → ¬ m ≤ n; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ # ⌜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)
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < ⌜# asl0⌝ + # σ1, ⌜ii(n + 1)⌝ < ⌜# asl0⌝ + # σ1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ (⌜asl0⌝ + σ1)[ii(n)] ≠ asl0[ii(n)] ∨ (⌜asl0⌝ + σ1)[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜ii(n + 1)⌝ < ⌜# asl0⌝ + # σ1, ⌜ii(n)⌝ < ⌜# asl0⌝ + # σ1, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜ii(n + 1)⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ (⌜asl0⌝ + σ1)[ii(n)] ≠ asl0[ii(n)] ∨ ⌜asl0⌝ [ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: ii(n + 1), σ1, ⌜asl0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , ⌜ii(n + 1)⌝ < ⌜# asl0⌝ + # σ1, ⌜ii(n)⌝ < ⌜# asl0⌝ + # σ1, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜ii(n + 1)⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ (⌜asl0⌝ + σ1)[ii(n)] ≠ asl0[ii(n)] ∨ ⌜asl0⌝ [ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ (⌜asl0⌝ + σ1)[ii(n)] ≠ asl0[ii(n)] ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
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) 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 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 → ⌜m⌝ < ⌜n⌝ + n∞0; (s) ⊦ ¬ n < n; (s) ⊦ m ≤ m; (s) ⊦ # x = 0 ↔ x = []; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ (⌜asl0⌝ + σ1)[ii(n)] ≠ asl0[ii(n)] ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜ii(n)⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜asl0⌝ [ii(n)] ≠ asl0[ii(n)] ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: ii(n), σ1, ⌜asl0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜ii(n)⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜asl0⌝ [ii(n)] ≠ asl0[ii(n)] ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
# al0 = ii(n), ii(n + 1) + 1 = # asl0, ((α to n) + ⌜α[n] '⌝ )^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used terms: n, α
| ⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝ |
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, # α < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, # α < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜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 Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, ((α to n) + ⌜α[n] '⌝ )^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^
# al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(α to n), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: ⌜α[n] '⌝ , α to n
| ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^ |
| # al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(α to n), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s)
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n)).last ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ x ≠ [] → x[# x - 1] = x.last
# al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], asl0 from ii(n) ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[#(asl0 from ii(n)) - 1] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ n < # x → (x from n = [] ↔ false); (s) Used terms: asl0 from ii(n)
| ⊦ x ≠ [] → x[# x - 1] = x.last |
| # al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], asl0 from ii(n) ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[#(asl0 from ii(n)) - 1] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[# asl0 - ii(n) - 1] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m < n → ¬ n < m; (s) ⊦ n < # x → (x from n = [] ↔ false); (s)
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[# asl0 - ii(n) - 1] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, # asl0 - ii(n) = n0 + 1, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , # asl0 - ii(n) ≠ 0, asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[n0] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ n < m → m - n ≠ 0; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # asl0 - ii(n), m
| # al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, # asl0 - ii(n) = n0 + 1, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , # asl0 - ii(n) ≠ 0, asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[n0] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, # asl0 - ii(n) = n0 + 1, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[n0] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ n < m → m - n ≠ 0; (s)
| # al0 = ii(n), ii(n + 1) + 1 = # asl0, (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, # asl0 - ii(n) = n0 + 1, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, ii(n + 1) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[n0] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), # asl0 = n1 + ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, n1 = n0 + 1, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ii(n) ≤ # asl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[n0] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ m < n → m ≤ n; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: # asl0, ii(n), n1
| # al0 = ii(n), # asl0 = n1 + ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ii(n + 1) + 1 = # asl0, (α to n)^ = (α0 to ii(n))^, n1 = n0 + 1, α0 to ii(n + 1) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ii(n + 1) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ii(n) ≤ # asl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ asl0[ii(n + 1)] ≠ (asl0 from ii(n))[n0] ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ m + n; (s) ⊦ m ≤ m; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (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 let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ¬ m + n < m; (s) m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) ⊦ m = n + 1 → ¬ m ≤ n; (s) ⊦ m < n → m ≤ n; (s)
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (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∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (s)
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. ⌜n1⌝ < # α → cstepf(cσ[n1], α[n1], cσ[n1 + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used terms: n
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cstepf(cσ[n], α[n], cσ[n + 1]) ∧ cstepf(cσ[n], a, cs1) → α[n] = a ∧ cσ[n + 1] = cs1, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used terms: cσ[n], α[n], a, cσ[n + 1], cs1
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), cstepf(cσ[n], a, cs1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), cstepf(cσ[n], α[n], cσ[n + 1]) ∧ cstepf(cσ[n], a, cs1) → α[n] = a ∧ cσ[n + 1] = cs1, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], # α0 < ⌜ii(n)⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # α1 = ⌜ii(n)⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = α1 ^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , α0 = α1 + α2, asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ # α0 < ⌜ii(n)⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: ⊦ ¬ # σ < ⌜n⌝ → (σ0 = σ to n ∧ σ1 = σ from n ↔ σ = σ0 + σ1 ∧ # σ0 = ⌜n⌝ ); (elim) Used terms: α0, ii(n), α1, α2
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], # α0 < ⌜ii(n)⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α0 < ⌜ii(n)⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α0 < ⌜ii(n)⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜asl0⌝ + σ1) = # α0 + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], # α0 < ⌜ii(n)⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → astepf((⌜asl0⌝ + σ1)[n], α0[n], (⌜asl0⌝ + σ1)[n +1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used terms: α0, ⌜asl0⌝ + σ1, astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜asl0⌝ + σ1) = # α0 + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], # α0 < ⌜ii(n)⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < # α0 → astepf((⌜asl0⌝ + σ1)[n], α0[n], (⌜asl0⌝ + σ1)[n +1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ⌜# asl0⌝ + # σ1 = # α0 + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α0 < ⌜ii(n)⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. ⌜n1⌝ < # α0 → astepf((⌜asl0⌝ + σ1)[n1], α0[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, ⌜# asl0⌝ + # σ1 = # α0 + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α0 < ⌜ii(n)⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. ⌜n1⌝ < # α0 → astepf((⌜asl0⌝ + σ1)[n1], α0[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , ⌜# asl0⌝ + # σ1 = # α0 + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , α0 = ⌜al2⌝ , asl0 ≠ [], # α0 < ⌜ii(n)⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. ⌜n1⌝ < # α0 → astepf((⌜asl0⌝ + σ1)[n1], α0[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s)
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , ⌜# asl0⌝ + # σ1 = # α0 + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = (α0 to ii(n))^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , α0 = ⌜al2⌝ , asl0 ≠ [], # α0 < ⌜ii(n)⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. ⌜n1⌝ < # α0 → astepf((⌜asl0⌝ + σ1)[n1], α0[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , ⌜# asl0⌝ + # σ1 = ⌜# al2⌝ + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), al0 + al1 = al2 to n0 + ii(n), (α to n)^ = ⌜al2 to ii(n)⌝ ^, asl0 ≠ [], # al2 < n0 + ii(n), # al2 < # asl0, # al2 < ii(n), ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al2 → astepf((⌜asl0⌝ + σ1)[n1], al2[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
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 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 → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m +1 = m + 1; (s) trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , ⌜# asl0⌝ + # σ1 = ⌜# al2⌝ + ⌜1⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), al0 + al1 = al2 to n0 + ii(n), (α to n)^ = ⌜al2 to ii(n)⌝ ^, asl0 ≠ [], # al2 < n0 + ii(n), # al2 < # asl0, # al2 < ii(n), ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al2 → astepf((⌜asl0⌝ + σ1)[n1], al2[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ + ⌜n1⌝ ↔ n + m = n0 + n1; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m + m0 ≤ m ↔ m0 = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ n + m ≤ m0 → ¬ n0 + m0 < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # α1 = ⌜ii(n)⌝ , (α to n)^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = α1 ^, α0 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , α0 = α1 + α2, asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α0), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ # α0 < ⌜ii(n)⌝ , finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # α1 = ⌜ii(n)⌝ , α1 ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = α1 ^, α1 + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α1 + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
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∞ + n∞1 < n∞1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # α1 = ⌜ii(n)⌝ , α1 ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = α1 ^, α1 + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α1 + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# α1 = ⌜ii(n)⌝ , # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), α1 ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = α1 ^, α1 + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , α1 = ⌜al2⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α1 + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s)
| # α1 = ⌜ii(n)⌝ , # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), α1 ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = α1 ^, α1 + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , α1 = ⌜al2⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, α1 + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# al2 = ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = ⌜al2⌝ ^, ⌜al2⌝ + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al2 = ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = ⌜al2⌝ ^, ⌜al2⌝ + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
⊦ # x < m → ⌜x⌝ + σ to m = ⌜x⌝ + (σ to (m - # x))
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # al2 = ii(n), ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al2⌝ ^, ⌜al2⌝ + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ # al2 < ii(n) + n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # al2 = ii(n), ⌜al2⌝ + (α2 to (ii(n) + n0 - # al2)) = ⌜al0⌝ + ⌜al1⌝ , ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al2⌝ ^, asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, # al2 < ii(n) + n0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: ii(n) + n0, α2, al2
| ⊦ # x < m → ⌜x⌝ + σ to m = ⌜x⌝ + (σ to (m - # x)) |
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # al2 = ii(n), ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al2⌝ ^, ⌜al2⌝ + α2 to n0 + ii(n) = ⌜al0⌝ + ⌜al1⌝ , asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ # al2 < ii(n) + n0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# asl0 = 1 + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , α[n] = τ, (α to n)^ = ⌜al0⌝ ^, ii(n) = ii(n + 1), asl0 ≠ [], ⌜n⌝ < # cσ, ⌜n⌝ < # α, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], τ, cσ[n + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , []), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ # ⌜al⌝ ^ ≠ ∞; (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∞ + ⌜0⌝ = n∞; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (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) ⊦ # [] = 0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ σ + [] = σ; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m = m + n ↔ n = 0; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ σ + σ0 = σ ↔ σ0 = [] ∨ # σ = ∞; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ # x = n → x to n = x; (s) ⊦ m + m0 ≤ m ↔ m0 = 0; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) ⊦ m ≤ # x → ⌜x⌝ + σ to m = ⌜x to m⌝ ; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # asl0 = 1 + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , α[n] = τ, (α to n)^ = ⌜al0⌝ ^, ii(n) = ii(n + 1), asl0 ≠ [], ⌜n⌝ < # cσ, ⌜n⌝ < # α, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], τ, cσ[n + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , []), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m < n → ¬ n < m; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m + 1 = n → n - m = 1; (s) ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s) Used terms: [], ⌜asl0 from ii(n)⌝ , astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # al2 = ii(n), ⌜al2⌝ + (α2 to (ii(n) + n0 - # al2)) = ⌜al0⌝ + ⌜al1⌝ , ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al2⌝ ^, asl0 ≠ [], ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, # al2 < ii(n) + n0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# al2 = ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), ⌜al2⌝ + (α2 to n0) = ⌜al0⌝ + ⌜al1⌝ , n0 + ii(n) = ii(n + 1), ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = ⌜al2⌝ ^, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[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 < m + n ↔ n ≠ 0; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m + n - m = n; (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 lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| # al2 = ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), ⌜al2⌝ + (α2 to n0) = ⌜al0⌝ + ⌜al1⌝ , n0 + ii(n) = ii(n + 1), ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, (α to n)^ = ⌜al2⌝ ^, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
⊦ finp(σ) ∧ # σ = # σ1 → (σ + σ0 = σ1 + σ2 ↔ σ = σ1 ∧ σ0 = σ2)
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # al2 = ii(n), # ⌜al2⌝ = # ⌜al0⌝ , ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al2⌝ ^, α2 to n0 = ⌜al1⌝ , ⌜al2⌝ = ⌜al0⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(⌜al2⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) Used terms: ⌜al1⌝ , ⌜al0⌝ , α2 to n0, ⌜al2⌝
| ⊦ finp(σ) ∧ # σ = # σ1 → (σ + σ0 = σ1 + σ2 ↔ σ = σ1 ∧ σ0 = σ2) |
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # al2 = ii(n), # ⌜al2⌝ = # ⌜al0⌝ , ⌜al2⌝ ^ + ⌜α[n] '⌝ ^ = ⌜al0⌝ ^ + ⌜al1⌝ ^, n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al2⌝ ^, α2 to n0 = ⌜al1⌝ , ⌜al2⌝ = ⌜al0⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al2⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(⌜al2⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ) ∨ ⌜al1⌝ ^ ≠ ⌜α[n] '⌝ ^ ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜al⌝ ^ ≠ ∞; (s) ⊦ σ + σ1 = σ + σ2 ↔ σ1 = σ2 ∨ # σ = ∞; (ws) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s)
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ afrag(AIOAut(astartf, astepf))(⌜asl0 from ii(n)⌝ , ⌜al1⌝ ), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # ⌜asl0 from ii(n)⌝ ≠ # ⌜al1⌝ + ⌜1⌝ ∨ (∃ n0. ¬(⌜n0⌝ < # ⌜al1⌝ → astepf(⌜asl0 from ii(n)⌝ [n0], ⌜al1⌝ [n0], ⌜asl0 from ii(n)⌝ [n0 +1]))) ⊦
Used terms: ⌜al1⌝ , ⌜asl0 from ii(n)⌝ , astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # ⌜asl0 from ii(n)⌝ ≠ # ⌜al1⌝ + ⌜1⌝ ∨ (∃ n0. ¬(⌜n0⌝ < # ⌜al1⌝ → astepf(⌜asl0 from ii(n)⌝ [n0], ⌜al1⌝ [n0], ⌜asl0 from ii(n)⌝ [n0 +1]))) ⊦ |
# cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 + 1 ≠ # asl0 - ii(n) ∨ ¬(n1 < # al1 → astepf((asl0 from ii(n))[n1], al1[n1], (asl0 from ii(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 < n ⊦ #(x from n) = # x - n; (s) ⊦ m < n → ¬ n < m; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # cσ = # α + ⌜1⌝ , # al0 = ii(n), # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 + 1 ≠ # asl0 - ii(n) ∨ ¬(n1 < # al1 → astepf((asl0 from ii(n))[n1], al1[n1], (asl0 from ii(n))[n1 + 1])) ⊦ |
# asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = n2 + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ii(n) ≤ # asl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 + 1 ≠ n2 ∨ ¬(n1 < # al1 → astepf((asl0 from ii(n))[n1], al1[n1], (asl0 from ii(n))[n1 + 1])) ⊦
Used simplifier rules: ⊦ m < n → m ≤ n; (s) n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: # asl0, ii(n), n2
| # asl0 = (n0 + 1) + ii(n), # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = n2 + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ii(n) ≤ # asl0, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 + 1 ≠ n2 ∨ ¬(n1 < # al1 → astepf((asl0 from ii(n))[n1], al1[n1], (asl0 from ii(n))[n1 + 1])) ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 ≠ n0 ∨ ¬(n1 < # al1 → astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1])) ⊦
Used simplifier rules: m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]; (s) 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 < m + n0 ↔ n < n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ ¬ m + 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 fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + n = m + n0 ↔ n = n0; (s) eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m < n → m ≤ n; (s)
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 ≠ n0 ∨ ¬(n1 < # al1 → astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1])) ⊦ |
# asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 = n0, n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 ≠ n0 ∨ ¬(n1 < # al1 → astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1])) ⊦
# asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 ≠ n0 ∨ ¬(n1 < # al1 → astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1])) ⊦
Used formulas: # al1 = n0
| # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 = n0, n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 ≠ n0 ∨ ¬(n1 < # al1 → astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1])) ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) ⊦ m + n < m + n0 ↔ n < n0; (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
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜asl0⌝ + σ1) = #(⌜al0⌝ + α2) + ⌜1⌝ , # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α2) → astepf((⌜asl0⌝ + σ1)[n], (⌜al0⌝ + α2)[n], (⌜asl0⌝ + σ1)[n +1]) ⊦
Used terms: ⌜al0⌝ + α2, ⌜asl0⌝ + σ1, astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜asl0⌝ + σ1) = #(⌜al0⌝ + α2) + ⌜1⌝ , # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α2) → astepf((⌜asl0⌝ + σ1)[n], (⌜al0⌝ + α2)[n], (⌜asl0⌝ + σ1)[n +1]) ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[n0], (⌜al0⌝ + α2)[n0], (⌜asl0⌝ + σ1)[n0 + 1]) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[n0], (⌜al0⌝ + α2)[n0], (⌜asl0⌝ + σ1)[n0 + 1]) ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜ii(n) + n1⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used terms: ii(n) + n1
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜ii(n) + n1⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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⌝ + n∞1 < ⌜n⌝ + n∞2 ↔ n∞1 < n∞2; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to # al1 = ⌜al1⌝ , al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n1⌝ < # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , α2 = ⌜al2⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), ⌜n1⌝ < # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , α2 = ⌜af0⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), ⌜n1⌝ < # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , α2 = ⌜al2⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), ⌜n1⌝ < # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n1 < # al2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n1 < # al2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, σ1 = ⌜asl1⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), n1 < # al2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (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 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, σ1 = ⌜asl1⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), n1 < # al2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n1 < # al2 → astepf((asl0 + asl1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (asl0 + asl1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[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 ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ + ⌜n2⌝ ↔ n1 + n + m = n0 + n2; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n1 < # al2 → astepf((asl0 + asl1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (asl0 + asl1)[(ii(n) + n1) + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ n1 < # al2, ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf((asl0 + asl1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ n1 < # al2, ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, # al2 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), # al2 ≤ n1, ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, # al2 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), # al2 ≤ n1, ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
Used simplifier rules: ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) 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
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf((asl0 + asl1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf((asl0 + asl1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ ii(n) + n1 < # al0, ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m +1 = m + 1; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (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: ii(n) + n1, al2, al0
| ⊦ n < # x → (x + y)[n] = x[n] |
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf((asl0 + asl1)[ii(n) + n1], (al0 + al2)[ii(n) + n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ ii(n) + n1 < # al0, ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf((asl0 + asl1)[ii(n) + n1], al2[n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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) ⊦ m ≤ m + n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf((asl0 + asl1)[ii(n) + n1], al2[n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ m < n ↔ ¬ n ≤ m; (ss) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n → ¬ 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: ii(n) + n1, asl1, asl0
| ⊦ n < # x → (x + y)[n] = x[n] |
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], (asl0 + asl1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, (ii(n) + n1) + 1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceA-IOstatestream] ⊦ 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 Used terms: (ii(n) + n1) + 1, asl1, asl0
| ⊦ n < # x → (x + y)[n] = x[n] |
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, (ii(n) + n1) + 1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al2 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(al2 to # al1) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < #(al2 to # al1) → (al2 to # al1)[n] = al1[n] ⊦
Used terms: al1, al2 to # al1
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(al2 to # al1) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < #(al2 to # al1) → (al2 to # al1)[n] = al1[n] ⊦ |
#(al2 to # al1) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al1 → (al2 to # al1)[n] = al1[n] ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic
| #(al2 to # al1) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < # al1 → (al2 to # al1)[n] = al1[n] ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to # al1) = # al1, # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n1 < # al1 → (al2 to # al1)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used terms: n1
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to # al1) = # al1, # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n1 < # al1 → (al2 to # al1)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
#(al2 to # al1) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (al2 to # al1)[n1] = al1[n1], (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
| #(al2 to # al1) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ii(n) + # al2 + 1 = # asl0 + # asl1, # al1 + ii(n) = ii(n + 1), (al2 to # al1)[n1] = al1[n1], (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
¬ # x < n, m < n ⊦ (x to n)[m] = x[m]
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to # al1) = # al1, # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, (al2 to # al1)[n1] = al1[n1], ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ¬ # al2 < # al1 ∧ n1 < # al1
Used simplifier rules: ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n1, # al1, al2
| ¬ # x < n, m < n ⊦ (x to n)[m] = x[m] |
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to # al1) = # al1, # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, (al2 to # al1)[n1] = al1[n1], ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ¬ # al2 < # al1 ∧ n1 < # al1 |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to # al1) = # al1, # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, (al2 to # al1)[n1] = al1[n1], ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], # al2 < # al1, ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to # al1) = # al1, # al1 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, (al2 to # al1)[n1] = al1[n1], ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], # al2 < # al1, ii(n) + n1 < # asl0, n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), astepf(asl0[ii(n) + n1], al2[n1], asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
Used simplifier rules: ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) 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
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to # al1 = ⌜al1⌝ , α2 = ⌜af0⌝ , al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), ⌜n1⌝ < # α2 → astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + α2)[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ⌜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) ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf((⌜asl0⌝ + σ1)[ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
# σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ⌜ii(n) + n1⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(⌜asl0⌝ [ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s) ⊦ ⌜n⌝ .n = n; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜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 fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n → ¬ 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: ii(n) + n1, σ1, ⌜asl0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| # σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ⌜ii(n) + n1⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(⌜asl0⌝ [ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (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) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| # σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ ⌜ii(n) + n1⌝ < # ⌜al0⌝ , ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (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 lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m +1 = m + 1; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (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: ii(n) + n1, ⌜af0⌝ , ⌜al0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], (⌜al0⌝ + ⌜af0⌝ )[ii(n) + n1], (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ ⌜ii(n) + n1⌝ < # ⌜al0⌝ , ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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) ⊦ m ≤ 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 ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), (⌜asl0⌝ + σ1)[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
# σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ⌜(ii(n) + n1) + 1⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), ⌜asl0⌝ [(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s) ⊦ ⌜n⌝ .n = n; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n1 + n + m < n0; (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 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 Used terms: (ii(n) + n1) + 1, σ1, ⌜asl0⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| # σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, ⌜(ii(n) + n1) + 1⌝ < # ⌜asl0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), ⌜asl0⌝ [(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
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 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) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n1 + n + m < n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, af0 to # al1 = al1, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(af0 to # al1) = # al1, # σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < #(af0 to # al1) → (af0 to # al1)[n] = al1[n] ⊦
Used terms: al1, af0 to # al1
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(af0 to # al1) = # al1, # σ1 = ∞, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (# al1 + 1) + ii(n), # al1 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, al1 ≠ [], asl0 ≠ [], ii(n) + n1 < # asl0, ii(n) < # asl0, # al1 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, n1 < # al1, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. n < #(af0 to # al1) → (af0 to # al1)[n] = al1[n] ⊦ |
# asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n0 < # al1 → af0(n0) = al1[n0] ⊦
Used simplifier rules: 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)
| # asl0 = (# al1 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), # σ1 = ∞, # al1 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, al1 ≠ [], asl0 ≠ [], n1 < # al1, ⌜n⌝ < # α, ⌜n⌝ < # cσ, # al1 + ii(n) < # asl0, ii(n) < # asl0, ii(n) + n1 < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), astepf(asl0[ii(n) + n1], af0(n1), asl0[(ii(n) + n1) + 1]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), ¬ astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n0 < # al1 → af0(n0) = al1[n0] ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n1
| # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, α2 to n0 = ⌜al1⌝ , # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, # al1 ≠ n0 ∨ ¬(n1 < # al1 → astepf(asl0[ii(n) + n1], al1[n1], asl0[ii(n) + n1 + 1])) ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 to n0 = ⌜al1⌝ , # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#(α2 to n0) = # ⌜al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < #(α2 to n0) → (α2 to n0)[n] = ⌜al1⌝ [n] ⊦
Used terms: ⌜al1⌝ , α2 to n0
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #(α2 to n0) = # ⌜al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < #(α2 to n0) → (α2 to n0)[n] = ⌜al1⌝ [n] ⊦ |
#(α2 to n0) = ⌜# al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1] ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| #(α2 to n0) = ⌜# al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1] ⊦ |
¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), #(α2 to n0) = ⌜# al1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, # α2 < ⌜n0⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) Used terms: n0, α2
| ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ |
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), #(α2 to n0) = ⌜# al1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, # α2 < ⌜n0⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
#(α2 to n0) = ⌜# al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α2 < ⌜n0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1] ⊦
| #(α2 to n0) = ⌜# al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α2 < ⌜n0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(⌜asl0⌝ + σ1, ⌜al0⌝ + α2), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1] ⊦ |
⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜asl0⌝ + σ1) = #(⌜al0⌝ + α2) + ⌜1⌝ , # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), #(α2 to n0) = ⌜# al1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, # α2 < ⌜n0⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α2) → astepf((⌜asl0⌝ + σ1)[n], (⌜al0⌝ + α2)[n], (⌜asl0⌝ + σ1)[n +1]) ⊦
Used terms: ⌜al0⌝ + α2, ⌜asl0⌝ + σ1, astepf, astartf
| ⊦ afrag(AIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜asl0⌝ + σ1) = #(⌜al0⌝ + α2) + ⌜1⌝ , # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), #(α2 to n0) = ⌜# al1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, # α2 < ⌜n0⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n. ⌜n⌝ < #(⌜al0⌝ + α2) → astepf((⌜asl0⌝ + σ1)[n], (⌜al0⌝ + α2)[n], (⌜asl0⌝ + σ1)[n +1]) ⊦ |
#(α2 to n0) = ⌜# al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α2 < ⌜n0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ n1. ⌜n1⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[n1], (⌜al0⌝ + α2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| #(α2 to n0) = ⌜# al1⌝ , # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), n0 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # α2 < ⌜n0⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ n1. ⌜n1⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[n1], (⌜al0⌝ + α2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]) ⊦ |
# al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), #(α2 to n0) = ⌜# al1⌝ , ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 = ⌜al2⌝ , # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, # α2 < ⌜n0⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. ⌜n1⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[n1], (⌜al0⌝ + α2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s)
| # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), #(α2 to n0) = ⌜# al1⌝ , ⌜# asl0⌝ + # σ1 = (⌜ii(n)⌝ + # α2) + ⌜1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, α2 = ⌜al2⌝ , # al1 ≠ n0, asl0 ≠ [], n0 ≠ 0, # α2 < ⌜n0⌝ , ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. ⌜n1⌝ < ⌜ii(n)⌝ + # α2 → astepf((⌜asl0⌝ + σ1)[n1], (⌜al0⌝ + α2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ n1. n1 < # al1 → (α2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
#(al2 to n0) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], # al2 < n0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < ii(n) + # al2 → astepf((⌜asl0⌝ + σ1)[n1], (al0 + al2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ n1. n1 < # al1 → (al2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[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⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s)
| #(al2 to n0) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , n0 + ii(n) = ii(n + 1), (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], # al2 < n0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < ii(n) + # al2 → astepf((⌜asl0⌝ + σ1)[n1], (al0 + al2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]), ∀ n1. n1 < # al1 → (al2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to n0) = # al1, n0 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, σ1 = ⌜asl1⌝ , # al1 ≠ n0, asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # al2 < n0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (al2 to n0)[n1] = al1[n1], ∀ n1. n1 < ii(n) + # al2 → astepf((⌜asl0⌝ + σ1)[n1], (al0 + al2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]) ⊦
Used simplifier rules: astatestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (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
| # asl0 = (n0 + 1) + ii(n), # cσ = # α + ⌜1⌝ , # al0 = ii(n), #(al2 to n0) = # al1, n0 + ii(n) = ii(n + 1), ⌜# asl0⌝ + # σ1 = ⌜ii(n)⌝ + ⌜# al2⌝ + ⌜1⌝ , ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, (α to n)^ = ⌜al0⌝ ^, σ1 = ⌜asl1⌝ , # al1 ≠ n0, asl0 ≠ [], ⌜n⌝ < # α, ⌜n⌝ < # cσ, n0 + ii(n) < # asl0, ii(n) < # asl0, # al2 < n0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((⌜asl0⌝ + σ1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < # al1 → (al2 to n0)[n1] = al1[n1], ∀ n1. n1 < ii(n) + # al2 → astepf((⌜asl0⌝ + σ1)[n1], (al0 + al2)[n1], (⌜asl0⌝ + σ1)[n1 + 1]) ⊦ |
#(al2 to n0) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], # al2 < n0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al1 → (al2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < ii(n) + # al2 → astepf((asl0 + asl1)[n1], (al0 + al2)[n1], (asl0 + asl1)[n1 + 1]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceA-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[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 ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ + ⌜n2⌝ ↔ n1 + n + m = n0 + n2; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| #(al2 to n0) = # al1, # al0 = ii(n), # cσ = # α + ⌜1⌝ , # asl0 = (n0 + 1) + ii(n), n0 + ii(n) = ii(n + 1), ii(n) + # al2 + 1 = # asl0 + # asl1, (α to n)^ = ⌜al0⌝ ^, ⌜al1⌝ ^ = ⌜α[n] '⌝ ^, # al1 ≠ n0, asl0 ≠ [], # al2 < n0, ii(n) < # asl0, n0 + ii(n) < # asl0, ⌜n⌝ < # cσ, ⌜n⌝ < # α, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), astartf((asl0 + asl1)[0]), cstartf(cσ[0]), cstepf(cσ[n], α[n], cσ[n + 1]), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n1. n1 < # al1 → (al2 to n0)[n1] = al1[n1], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n1. n1 < ii(n) + # al2 → astepf((asl0 + asl1)[n1], (al0 + al2)[n1], (asl0 + asl1)[n1 + 1]) ⊦ |
Used simplifier rules: ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) 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
| # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + σ1 ^, (α to n)^ = (α0 to ii(n))^, α0 to ii(n + 1) = ⌜al0⌝ + σ1, σ1 = ⌜af0⌝ , ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , σ1) ∨ ¬ finp(σ1) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ σ1 ^ ≠ ⌜a '⌝ ^ ⊦ |
# al0 = ii(n), (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜af0⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ¬ afrag(AIOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)
| # al0 = ii(n), (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, α0 to ii(n + 1) = ⌜al0⌝ + ⌜af0⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#(α0 to ii(n + 1)) = #(⌜al0⌝ + ⌜af0⌝ ), # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, (α to n)^ = (α0 to ii(n))^, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < #(α0 to ii(n + 1)) → (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0] ⊦
Used terms: ⌜al0⌝ + ⌜af0⌝ , α0 to ii(n + 1)
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #(α0 to ii(n + 1)) = #(⌜al0⌝ + ⌜af0⌝ ), # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, (α to n)^ = (α0 to ii(n))^, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < #(α0 to ii(n + 1)) → (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0] ⊦ |
#(α0 to ii(n + 1)) = ∞, # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, (α to n)^ = (α0 to ii(n))^, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0] ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ∞; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] 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) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| #(α0 to ii(n + 1)) = ∞, # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, (α to n)^ = (α0 to ii(n))^, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0] ⊦ |
¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝
# al0 = ii(n), #(α0 to ii(n + 1)) = ∞, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, # α0 < ⌜ii(n + 1)⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used simplifier rules: ⊦ ⌜n⌝ ≠ ∞; (s) Used terms: ii(n + 1), α0
| ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ |
| # al0 = ii(n), #(α0 to ii(n + 1)) = ∞, (α to n)^ = (α0 to ii(n))^, (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, # α0 < ⌜ii(n + 1)⌝ , ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, ⌜ii(n + 1)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0], ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
#(α0 to ii(n + 1)) = ∞, # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, (α to n)^ = (α0 to ii(n))^, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, # α0 < ⌜ii(n + 1)⌝ , # α0 < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0] ⊦
Used simplifier rules: ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| #(α0 to ii(n + 1)) = ∞, # al0 = ii(n), (α to n + 1)^ = ⌜al0⌝ ^ + ⌜af0⌝ ^, (α to n)^ = (α0 to ii(n))^, ⌜ii(n + 1)⌝ < # aσ, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ, # α0 < ⌜ii(n + 1)⌝ , # α0 < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. (α0 to ii(n + 1))[n0] = (⌜al0⌝ + ⌜af0⌝ )[n0] ⊦ |
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), ii(n) ≤ ii(n + 1), ¬ ⌜n⌝ + ⌜1⌝ < # cσ, ⌜n⌝ + ⌜1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ |
n + 1 = # csl, (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), ii(n) ≤ ii(n + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[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) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ¬ n < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ n∞0 + ⌜1⌝ = n∞ → (⌜n⌝ + ⌜1⌝ < n∞ ↔ ⌜n⌝ < n∞0); (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) ⊦ ⌜m⌝ < n∞ → (⌜m⌝ + ⌜1⌝ < n∞ ↔ ⌜m⌝ + ⌜1⌝ ≠ n∞); (ss)
| n + 1 = # csl, (α to n)^ = (α0 to ii(n))^, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), ii(n) ≤ ii(n + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0) |
n + 1 = # csl, (α to n)^ = (α0 to ii(n))^, csl = csl0 + cs2 ', csl ≠ [], ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), ii(n) ≤ ii(n + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: csl, cs2, y
| n + 1 = # csl, (α to n)^ = (α0 to ii(n))^, csl = csl0 + cs2 ', csl ≠ [], ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), ii(n) ≤ ii(n + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(n + 1) + 1) from ii(n)).l⌝ , (α0 to ii(n + 1)) from ii(n)) ∨ ¬ finp((α0 to ii(n + 1)) from ii(n)) ∨ aσ[ii(n)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l[0] ∨ aσ[ii(n + 1)] ≠ ((aσ to ii(n + 1) + 1) from ii(n)).l.last ∨ ((α0 to ii(n + 1)) from ii(n))^ ≠ ⌜a '⌝ ^ ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
(α to # csl0)^ = (α0 to ii(# csl0))^, ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs2 '⌝ , α), cstartf((csl0 + cs2 ')[0]), cstepf(cs2, a, cs1), ii(# csl0) ≤ ii(# csl0 + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(# csl0 + 1) + 1) from ii(# csl0)).l⌝ , (α0 to ii(# csl0 + 1)) from ii(# csl0)) ∨ ¬ finp((α0 to ii(# csl0 + 1)) from ii(# csl0)) ∨ aσ[ii(# csl0)] ≠ ((aσ to ii(# csl0 + 1) + 1) from ii(# csl0)).l[0] ∨ aσ[ii(# csl0 + 1)] ≠ ((aσ to ii(# csl0 + 1) + 1) from ii(# csl0)).l.last ∨ ((α0 to ii(# csl0 + 1)) from ii(# csl0))^ ≠ ⌜a '⌝ ^ ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ n = # x → (x + a ')[n] = a; (s) ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)
| (α to # csl0)^ = (α0 to ii(# csl0))^, ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs2 '⌝ , α), cstartf((csl0 + cs2 ')[0]), cstepf(cs2, a, cs1), ii(# csl0) ≤ ii(# csl0 + 1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ¬ afrag(AIOAut(astartf, astepf))(⌜((aσ to ii(# csl0 + 1) + 1) from ii(# csl0)).l⌝ , (α0 to ii(# csl0 + 1)) from ii(# csl0)) ∨ ¬ finp((α0 to ii(# csl0 + 1)) from ii(# csl0)) ∨ aσ[ii(# csl0)] ≠ ((aσ to ii(# csl0 + 1) + 1) from ii(# csl0)).l[0] ∨ aσ[ii(# csl0 + 1)] ≠ ((aσ to ii(# csl0 + 1) + 1) from ii(# csl0)).l.last ∨ ((α0 to ii(# csl0 + 1)) from ii(# csl0))^ ≠ ⌜a '⌝ ^ ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
Used terms: a, cs1
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ∃ cσ, α, aσ0, α0, m, n0. aσ[ii(n + 1)] = aσ0[m] ∧ cs1 = cσ[n0] ∧ ⌜m⌝ < # aσ0 ∧ ⌜n0⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ0, α0) ∧ astartf(aσ0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii. ii(n0) = m ∧ mon≤(ii) ∧ (∀ n1. n0 ≤ n1 ∧ ⌜n1⌝ < # cσ → ⌜ii(n1)⌝ < # aσ0 ∧ (α to n1)^ = (α0 to ii(n1))^)) |
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ aσ[ii(n + 1)] = aσ[ii(n + 1)] ∧ cs1 = cσ[n + 1] ∧ ⌜ii(n + 1)⌝ < # aσ ∧ ⌜n + 1⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii0. ii0(n + 1) = ii(n + 1) ∧ mon≤(ii0) ∧ (∀ n1. n + 1 ≤ n1 ∧ ⌜n1⌝ < # cσ → ⌜ii0(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii0(n1))^))
Used terms: cσ, α, aσ, α0, ii(n + 1), n + 1
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ aσ[ii(n + 1)] = aσ[ii(n + 1)] ∧ cs1 = cσ[n + 1] ∧ ⌜ii(n + 1)⌝ < # aσ ∧ ⌜n + 1⌝ < # cσ ∧ afrag(AIOAut(astartf, astepf))(aσ, α0) ∧ astartf(aσ[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(cσ, α) ∧ cstartf(cσ[0]) ∧ (finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0))) ∧ (∃ ii0. ii0(n + 1) = ii(n + 1) ∧ mon≤(ii0) ∧ (∀ n1. n + 1 ≤ n1 ∧ ⌜n1⌝ < # cσ → ⌜ii0(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii0(n1))^)) |
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ cs1 = cσ[n + 1] ∧ ⌜ii(n + 1)⌝ < # aσ ∧ ⌜n⌝ + ⌜1⌝ < # cσ ∧ (∃ ii0. ii0(n + 1) = ii(n + 1) ∧ mon≤(ii0) ∧ (∀ n1. n < n1 ∧ ⌜n1⌝ < # cσ → ⌜ii0(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii0(n1))^))
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) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ cs1 = cσ[n + 1] ∧ ⌜ii(n + 1)⌝ < # aσ ∧ ⌜n⌝ + ⌜1⌝ < # cσ ∧ (∃ ii0. ii0(n + 1) = ii(n + 1) ∧ mon≤(ii0) ∧ (∀ n1. n < n1 ∧ ⌜n1⌝ < # cσ → ⌜ii0(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii0(n1))^)) |
cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ + ⌜1⌝ < # cσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii0. ii0(n + 1) = ii(n + 1) ∧ mon≤(ii0) ∧ (∀ n1. n < n1 ∧ ⌜n1⌝ < # cσ → ⌜ii0(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii0(n1))^)
| cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# cσ = # α + ⌜1⌝ , cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦
Used terms: α, cσ, cstepf, cstartf
| ⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # cσ = # α + ⌜1⌝ , cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ n. ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n +1]) ⊦ |
# cσ = # α + ⌜1⌝ , cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # cσ = # α + ⌜1⌝ , cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦ |
# cσ = # α + ⌜1⌝ , cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n ∧ ⌜n⌝ < # cσ → ⌜ii(n)⌝ < # aσ ∧ (α to n)^ = (α0 to ii(n))^, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used terms: n
| # cσ = # α + ⌜1⌝ , cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n ∧ ⌜n⌝ < # cσ → ⌜ii(n)⌝ < # aσ ∧ (α to n)^ = (α0 to ii(n))^, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦
Used simplifier rules: ⊦ m ≤ m; (s)
| # cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]) ⊦ |
# cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
| # cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. ⌜n0⌝ < # α → cstepf(cσ[n0], α[n0], cσ[n0 + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used terms: n
| # cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ⌜n⌝ < # α → cstepf(cσ[n], α[n], cσ[n + 1]), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
# cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
# cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), cstepf(cσ[n], α[n], cσ[n + 1]), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
| # cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ < # α, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
(α to n)^ = (α0 to ii(n))^, ⌜# csl⌝ = # α + ⌜1⌝ , cs1 ≠ csl[n + 1], csl ≠ [], n < # csl, ⌜ii(n)⌝ < # aσ, # α < ⌜# csl⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(hd(csl)), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ < # α, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0)
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ⌜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 ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf
| (α to n)^ = (α0 to ii(n))^, ⌜# csl⌝ = # α + ⌜1⌝ , cs1 ≠ csl[n + 1], csl ≠ [], n < # csl, ⌜ii(n)⌝ < # aσ, # α < ⌜# csl⌝ , C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(hd(csl)), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ < # α, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0) |
(α to n)^ = (α0 to ii(n))^, csl = cs2 + csl0, ⌜# csl⌝ = # α + ⌜1⌝ , cs1 ≠ csl[n + 1], csl ≠ [], # α < ⌜# csl⌝ , ⌜ii(n)⌝ < # aσ, n < # csl, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ < # α, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0)
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs2, y
| (α to n)^ = (α0 to ii(n))^, csl = cs2 + csl0, ⌜# csl⌝ = # α + ⌜1⌝ , cs1 ≠ csl[n + 1], csl ≠ [], # α < ⌜# csl⌝ , ⌜ii(n)⌝ < # aσ, n < # csl, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ < # α, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0) |
α ^ = (α0 to ii(# csl0))^, ⌜# csl0⌝ = # α, cs1 ≠ csl0[# csl0], ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# csl0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf((cs2 ' + csl0).last, a0, cs0)
Used simplifier rules: ⊦ m ≤ m; (s) ⊦ # σ = ⌜n⌝ → σ to n = σ; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf ⊦ a + x = a ' + 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⌝ + ⌜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) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s)
| α ^ = (α0 to ii(# csl0))^, ⌜# csl0⌝ = # α, cs1 ≠ csl0[# csl0], ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# csl0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf((cs2 ' + csl0).last, a0, cs0) |
α ^ = (α0 to ii(# csl0))^, α = ⌜al0⌝ , ⌜# csl0⌝ = # α, cs1 ≠ csl0[# csl0], ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# csl0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf((cs2 ' + csl0).last, a0, cs0)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s)
| α ^ = (α0 to ii(# csl0))^, α = ⌜al0⌝ , ⌜# csl0⌝ = # α, cs1 ≠ csl0[# csl0], ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# csl0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf((cs2 ' + csl0).last, a0, cs0) |
# csl0 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf((cs2 ' + csl0).last, a0, cs0)
Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # csl0 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf((cs2 ' + csl0).last, a0, cs0) |
# csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs2 ' + csl0 ≠ [], cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: cs2 ' + csl0, cs3, y
| # csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs2 ' + csl0 ≠ [], cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((cs2 ' + csl0)[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
# csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((csl + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cs2 ∈ csl ∨ cs2 = cs3, cs3 = cs2 ∨ cs3 ∈ csl0 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] ⊦ a ' + x ≠ []; (s)
| # csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((csl + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cs2 ∈ csl ∨ cs2 = cs3, cs3 = cs2 ∨ cs3 ∈ csl0 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
# csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, csl = [], cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((csl + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cs3 = cs2 ∨ cs3 ∈ csl0, cs2 ∈ csl ∨ cs2 = cs3 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
# csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, csl = cs0 + csl1, cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((csl + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cs3 = cs2 ∨ cs3 ∈ csl0, cs2 ∈ csl ∨ cs2 = cs3 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
Used simplifier rules: cstatelist freely generated by [], +;;
| # csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, csl = [], cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((csl + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cs3 = cs2 ∨ cs3 ∈ csl0, cs2 ∈ csl ∨ cs2 = cs3 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
[] = (α0 to ii(0))^, cs1 ≠ [][0], ⌜ii(0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf(cs2, a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: ⊦ a '[0] = a; (s) ⊦ # [] = 0; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ [] + x = x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| [] = (α0 to ii(0))^, cs1 ≠ [][0], ⌜ii(0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf(cs2, a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
Used terms: a, cs1
| # csl0 = # al0, cs2 ' + csl0 = csl + cs3 ', ⌜al0⌝ ^ = (α0 to ii(# al0))^, csl = cs0 + csl1, cs1 ≠ csl0[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs2), cstepf((csl + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, cs3 = cs2 ∨ cs3 ∈ csl0, cs2 ∈ csl ∨ cs2 = cs3 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
# csl1 + 1 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ (csl1 + cs3 ')[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs0), cstepf(((cs0 ' + csl1) + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[traceC-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)
| # csl1 + 1 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ (csl1 + cs3 ')[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs0), cstepf(((cs0 ' + csl1) + cs3 ')[# al0], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# csl1 + 1 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ (csl1 + cs3 ')[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs0), cstepf(cs3 '[# al0 - #(cs0 ' + csl1)], a, cs1), mon≤(ii), ¬ # al0 < #(cs0 ' + csl1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
Used simplifier rules: ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (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; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al0, cs3 ', cs0 ' + csl1
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # csl1 + 1 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, cs1 ≠ (csl1 + cs3 ')[# al0], ⌜ii(# al0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs0), cstepf(cs3 '[# al0 - #(cs0 ' + csl1)], a, cs1), mon≤(ii), ¬ # al0 < #(cs0 ' + csl1), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
# csl1 + 1 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, al0 ≠ [], cs1 ≠ (csl1 + cs3 ')[# al0], ⌜ii(# al0)⌝ < # aσ, # csl1 < # al0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs0), cstepf(cs3, a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0)
Used simplifier rules: ⊦ a '[0] = a; (s) ⊦ m - m = 0; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ 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 eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # csl1 + 1 = # al0, ⌜al0⌝ ^ = (α0 to ii(# al0))^, al0 ≠ [], cs1 ≠ (csl1 + cs3 ')[# al0], ⌜ii(# al0)⌝ < # aσ, # csl1 < # al0, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cs0), cstepf(cs3, a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs3, a0, cs0) |
Used terms: a, cs1
| # cσ = # α + ⌜1⌝ , (α to n)^ = (α0 to ii(n))^, cs1 ≠ cσ[n + 1], ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), cstepf(cσ[n], α[n], cσ[n + 1]), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
Used terms: cσ[n], a, α[n], cs1, cσ[n + 1]
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
ii(n) < ii(n + 1), ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf
| ii(n) < ii(n + 1), ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ |
⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ii(n) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n + 1 ∧ ⌜n + 1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦
Used terms: n + 1
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, ii(n) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), n ≤ n + 1 ∧ ⌜n + 1⌝ < # cσ → ⌜ii(n + 1)⌝ < # aσ ∧ (α to n + 1)^ = (α0 to ii(n + 1))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
n + 1 = # csl, ⌜ii(n)⌝ < # aσ, ii(n) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[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) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s) ⊦ ⌜m⌝ < n∞ → (⌜m⌝ + ⌜1⌝ < n∞ ↔ ⌜m⌝ + ⌜1⌝ ≠ n∞); (ss) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m ≤ m + n; (s)
| n + 1 = # csl, ⌜ii(n)⌝ < # aσ, ii(n) < ii(n + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0) |
n + 1 = # csl, csl = csl0 + cs2 ', csl ≠ [], ii(n) < ii(n + 1), ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: csl, cs2, y
| n + 1 = # csl, csl = csl0 + cs2 ', csl ≠ [], ii(n) < ii(n + 1), ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ¬ ⌜ii(n + 1)⌝ < # aσ, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
⌜ii(# csl0)⌝ < # aσ, ii(# csl0) < ii(# csl0 + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs2 '⌝ , α), cstartf((csl0 + cs2 ')[0]), cstepf(cs2, a, cs1), mon≤(ii), ¬ ⌜ii(# csl0 + 1)⌝ < # aσ, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ n = # x → (x + a ')[n] = a; (s) ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)
| ⌜ii(# csl0)⌝ < # aσ, ii(# csl0) < ii(# csl0 + 1), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs2 '⌝ , α), cstartf((csl0 + cs2 ')[0]), cstepf(cs2, a, cs1), mon≤(ii), ¬ ⌜ii(# csl0 + 1)⌝ < # aσ, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
Used terms: a, cs1
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), ¬ ⌜n⌝ + ⌜1⌝ < # cσ, finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ |
n + 1 = # csl, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ¬ n < n0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[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) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[traceC-IOstatestream] ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (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) ⊦ ¬ n < n; (s) ⊦ ⌜m⌝ < n∞ → (⌜m⌝ + ⌜1⌝ < n∞ ↔ ⌜m⌝ + ⌜1⌝ ≠ n∞); (ss)
| n + 1 = # csl, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ¬ n < n0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ∃ a0, cs0. cstepf(csl.last, a0, cs0) |
n + 1 = # csl, csl = csl0 + cs2 ', csl ≠ [], ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ∀ n0. n ≤ n0 ∧ ¬ n < n0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: csl, cs2, y
| n + 1 = # csl, csl = csl0 + cs2 ', csl ≠ [], ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , α), cstartf(csl[0]), cstepf(csl[n], a, cs1), mon≤(ii), ∀ n0. n ≤ n0 ∧ ¬ n < n0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs2 '⌝ , α), cstartf((csl0 + cs2 ')[0]), cstepf(cs2, a, cs1), mon≤(ii), ∀ n0. # csl0 ≤ n0 ∧ ¬ # csl0 < n0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ n = # x → (x + a ')[n] = a; (s) ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s)
| ⌜ii(# csl0)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs2 '⌝ , α), cstartf((csl0 + cs2 ')[0]), cstepf(cs2, a, cs1), mon≤(ii), ∀ n0. # csl0 ≤ n0 ∧ ¬ # csl0 < n0 → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ a0, cs0. cstepf(cs2, a0, cs0) |
Used terms: a, cs1
| ⌜ii(n)⌝ < # aσ, ⌜n⌝ < # cσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^, ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1 ⊦ ∃ ii0. ii0(n + 1) = ii(n + 1) ∧ mon≤(ii0) ∧ (∀ n1. n < n1 ∧ ⌜n1⌝ < # cσ → ⌜ii0(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii0(n1))^) |
⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ii(n + 1) = ii(n + 1) ∧ mon≤(ii) ∧ (∀ n1. n < n1 ∧ ⌜n1⌝ < # cσ → ⌜ii(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii(n1))^)
Used terms: ii
| ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ii(n + 1) = ii(n + 1) ∧ mon≤(ii) ∧ (∀ n1. n < n1 ∧ ⌜n1⌝ < # cσ → ⌜ii(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii(n1))^) |
⌜n1⌝ < # cσ, n < n1, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ⌜ii(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii(n1))^
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ⌜n1⌝ < # cσ, n < n1, ⌜n⌝ < # cσ, ⌜ii(n)⌝ < # aσ, C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), afrag(AIOAut(astartf, astepf))(aσ, α0), astartf(aσ[0]), cfrag(CIOAut(cstartf, cstepf))(cσ, α), cstartf(cσ[0]), cstepf(cσ[n], a, cs1), mon≤(ii), finp(cσ) → ¬(∃ a, cs0. cstepf(cσ.l.last, a, cs0)), ∀ cs, a0, a1, cs0, cs1. cstepf(cs, a0, cs0) ∧ cstepf(cs, a1, cs1) → a0 = a1 ∧ cs0 = cs1, ∀ n0. n ≤ n0 ∧ ⌜n0⌝ < # cσ → ⌜ii(n0)⌝ < # aσ ∧ (α to n0)^ = (α0 to ii(n0))^ ⊦ ⌜ii(n1)⌝ < # aσ ∧ (α to n1)^ = (α0 to ii(n1))^ |
Used simplifier rules: ⊦ m < n → m ≤ n; (s) Used terms: n1
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.