| ⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []) |
β ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
| β ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
β ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
| β ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⌜al0⌝ ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = []
⌜af⌝ ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = [] |
⊦ ⌜al1⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. ⌜al1⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])
⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], ⌜al0⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al2, α. ⌜al0⌝ = ⌜al2⌝ + α ∧ al2 ≠ [] ∧ ⌜al2⌝ ^ = ⌜al⌝ ∧ al2.last = al.last ∧ α ^ = []) ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = []
Used terms: al0, al
| ⊦ ⌜al1⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. ⌜al1⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []) |
| ⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], ⌜al0⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al2, α. ⌜al0⌝ = ⌜al2⌝ + α ∧ al2 ≠ [] ∧ ⌜al2⌝ ^ = ⌜al⌝ ∧ al2.last = al.last ∧ α ^ = []) ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = [] |
al2.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , ⌜al2⌝ ^ = ⌜al⌝ , β ^ = [], ⌜al0⌝ = ⌜al2⌝ + β, al ≠ [], al2 ≠ [] ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = []
| al2.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , ⌜al2⌝ ^ = ⌜al⌝ , β ^ = [], ⌜al0⌝ = ⌜al2⌝ + β, al ≠ [], al2 ≠ [] ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = [] |
Used terms: al2, β
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ)
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
Used terms: af
| ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) |
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used formulas: ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af⌝ = ⌜af to n0 + 1⌝ + ⌜af from n0 + 1⌝ ∧ af to n0 + 1 ≠ [] ∧ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used terms: af to n0 + 1, ⌜af from n0 + 1⌝
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af⌝ = ⌜af to n0 + 1⌝ + ⌜af from n0 + 1⌝ ∧ af to n0 + 1 ≠ [] ∧ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ nf to n = [] ↔ n = 0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf to n⌝ + ⌜nf from n⌝ = ⌜nf⌝ ↔ true; (ss)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [], ¬ # ⌜af⌝ < ⌜n0 + 1⌝ ∧ (∀ m. n0 + 1 ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ)
(⌜af⌝ to n0 + 1)^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ¬ # ⌜af⌝ < ⌜n0 + 1⌝ , ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n0 + 1 ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used terms: ⌜af⌝ , n0 + 1
| ¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ |
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [], ¬ # ⌜af⌝ < ⌜n0 + 1⌝ ∧ (∀ m. n0 + 1 ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n1) ≠ τ, af(n0) ≠ τ, al ≠ [], n0 < n1, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) 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) ⊦ ¬ ∞ < n∞; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ⌜af⌝ ^ = ⌜al⌝ , af(n1) ≠ τ, af(n0) ≠ τ, al ≠ [], n0 < n1, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
Used terms: n1
| (⌜af⌝ to n0 + 1)^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ¬ # ⌜af⌝ < ⌜n0 + 1⌝ , ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n0 + 1 ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
⌜af to n0 + 1⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) 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) ⊦ ¬ ∞ < n∞; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜af to n0 + 1⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
⊦ nf to m + 1 = (nf to m) + nf(m) '
⌜(af to n0) + af(n0) '⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ((af to n0) + af(n0) ').last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used terms: n0, af
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| ⌜(af to n0) + af(n0) '⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ((af to n0) + af(n0) ').last = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = al.last ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: remtau-fin-append: ⊦ (⌜al⌝ + ⌜al2⌝ )^ = ⌜al⌝ ^ + ⌜al2⌝ ^; remtau-one: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (x + a ').last = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = al.last ∧ ⌜af from n0 + 1⌝ ^ = [] |
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al⌝ , al = al0 + a ', af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: al, a, y
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al⌝ , al = al0 + a ', af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = [] |
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x + a ' ≠ []; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = [] |
∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ∀ n. ⌜n⌝ < # ⌜af from n0 + 1⌝ → ⌜af from n0 + 1⌝ [n] = τ, af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < # ⌜af from n0 + 1⌝ → ⌜af from n0 + 1⌝ [n] = τ ⊦ af(n0) = a ∧ [] = []
Used terms: ⌜af from n0 + 1⌝
| ∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [] |
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ∀ n. ⌜n⌝ < # ⌜af from n0 + 1⌝ → ⌜af from n0 + 1⌝ [n] = τ, af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = [] |
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, af(n1 + n0 + 1) ≠ τ, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []
Used simplifier rules: ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, af(n1 + n0 + 1) ≠ τ, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = [] |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ 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: n1 + n0 + 1
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < # ⌜af from n0 + 1⌝ → ⌜af from n0 + 1⌝ [n] = τ ⊦ af(n0) = a ∧ [] = [] |
⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, af(n0) ≠ a, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, af(n0) ≠ a, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#(⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ) = #(⌜al0⌝ + ⌜a '⌝ ), af(n0) ≠ τ, af(n0) ≠ a, ∀ n1. af(n1 + n0 + 1) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < #(⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ) → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[n] = (⌜al0⌝ + ⌜a '⌝ )[n] ⊦
Used terms: ⌜al0⌝ + ⌜a '⌝ , ⌜af to n0⌝ ^ + ⌜af(n0) '⌝
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #(⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ) = #(⌜al0⌝ + ⌜a '⌝ ), af(n0) ≠ τ, af(n0) ≠ a, ∀ n1. af(n1 + n0 + 1) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < #(⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ) → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[n] = (⌜al0⌝ + ⌜a '⌝ )[n] ⊦ |
# ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ a, af(n0) ≠ τ, ∀ n1. af(n1 + n0 + 1) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n1. ¬ # al0 < n1 → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[n1] = (al0 + a ')[n1] ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) 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⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s)
| # ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ a, af(n0) ≠ τ, ∀ n1. af(n1 + n0 + 1) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n1. ¬ # al0 < n1 → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[n1] = (al0 + a ')[n1] ⊦ |
# ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ a, af(n0) ≠ τ, ¬ # al0 < # al0 → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[# al0] = (al0 + a ')[# al0], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦
Used terms: # al0
| # ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ a, af(n0) ≠ τ, ¬ # al0 < # al0 → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[# al0] = (al0 + a ')[# al0], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦ |
# ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ τ, af(n0) ≠ (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[# al0], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (x + a ')[# x] = a; (s) ⊦ ¬ n < n; (s)
| # ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ τ, af(n0) ≠ (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[# al0], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (s) Used terms: # al0, ⌜af(n0) '⌝ , ⌜af to n0⌝ ^
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ
Used formulas: ∃ n. af(n) ≠ τ
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [] |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used simplifier rules: <; (wellfounded) Used terms: n
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , n = 0, af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used formulas: n = 0
| ⌜af⌝ ^ = ⌜al⌝ , n = 0, af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. af(m) = τ, ∀ n0, af, al, n2. n0 < 0 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used simplifier rules: ⊦ 0 ≤ m; (s)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. af(m) = τ, ∀ n0, af, al, n2. n0 < 0 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
Used terms: n0
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n - 1) ≠ τ ∧ (∀ m. n - 1 < m → af(m) = τ)
Used terms: n - 1
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n - 1) ≠ τ ∧ (∀ m. n - 1 < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n - 1) ≠ τ ∧ (¬ n1 < n → af(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 < n + 1 ↔ ¬ n < m; (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n - 1) ≠ τ ∧ (¬ n1 < n → af(n1) = τ) |
⌜af⌝ ^ = ⌜al⌝ , n = n3 + 1, af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n3) ≠ τ ∧ (¬ n1 < n → af(n1) = τ)
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m0
| ⌜af⌝ ^ = ⌜al⌝ , n = n3 + 1, af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n3) ≠ τ ∧ (¬ n1 < n → af(n1) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n3) ≠ τ ∧ (n3 < n1 → af(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 < n + 1 ↔ ¬ n < m; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + 1 ≠ 0; (s)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n3) ≠ τ ∧ (n3 < n1 → af(n1) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
⌜af⌝ ^ = ⌜al⌝ , af(n1) ≠ τ, af(n0) ≠ τ, al ≠ [], n3 < n1, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ⌜af⌝ ^ = ⌜al⌝ ∧ af(n0) ≠ τ ∧ al ≠ [] ∧ (∀ m. n3 ≤ m → af(m) = τ)
⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n3, af, al, n0
| ⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ⌜af⌝ ^ = ⌜al⌝ ∧ af(n0) ≠ τ ∧ al ≠ [] ∧ (∀ m. n3 ≤ m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, af(n) ≠ τ, al ≠ [], n3 ≤ n, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, af(n) ≠ τ, al ≠ [], n3 ≤ n, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) Used terms: n
| ⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, af(n) ≠ τ, al ≠ [], ∀ m. n < m → af(m) = τ, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, af(n) ≠ τ, al ≠ [], ∀ m. n < m → af(m) = τ, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
Used terms: n
| ⌜af⌝ ^ = ⌜al⌝ , af(n1) ≠ τ, af(n0) ≠ τ, al ≠ [], n3 < n1, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, af(n1) ≠ τ, al ≠ [], n3 < n1, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, af(n1) ≠ τ, al ≠ [], n3 < n1, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
Used terms: n1
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ |
∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []
⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∀ n. ⌜n⌝ < # ⌜af⌝ → ⌜af⌝ [n] = τ, ∃ n. af(n) ≠ τ, ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)
Used simplifier rules: ⊦ ⌜x⌝ = [] ↔ x = []; (s) Used terms: ⌜af⌝
| ∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [] |
| ⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∀ n. ⌜n⌝ < # ⌜af⌝ → ⌜af⌝ [n] = τ, ∃ n. af(n) ≠ τ, ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) |
⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ
Used simplifier rules: ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)
| ⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ |
Used terms: n0
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.