| ¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^) |
⌜af1⌝ = ⌜af⌝ ^ ⊦ ⌜af1⌝ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^)
Used simplifier rules: remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜af1⌝ = ⌜af⌝ ^ ⊦ ⌜af1⌝ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^) |
⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^ ⊦ ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^
⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ ≠ ⌜af0⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
| ⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^ ⊦ ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ |
⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^ ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^
| ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^ ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ |
⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m)
⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^, ¬ # ⌜af⌝ < ⌜n⌝ → (∃ m. ¬ # ⌜af⌝ ^ < ⌜m⌝ ∧ (⌜af⌝ to n)^ = ⌜af⌝ ^ to m) ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^
Used terms: ⌜af⌝ , n
| ⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m) |
| ⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^, ¬ # ⌜af⌝ < ⌜n⌝ → (∃ m. ¬ # ⌜af⌝ ^ < ⌜m⌝ ∧ (⌜af⌝ to n)^ = ⌜af⌝ ^ to m) ⊦ ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ |
⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^ ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ = ⌜af0⌝ ^ ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^ |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ¬ # ⌜af0⌝ ^ < ⌜n0⌝ → (∃ m. ¬ # ⌜af0⌝ < ⌜m⌝ ∧ ⌜af0⌝ ^ to n0 = (⌜af0⌝ to m)^) ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^
Used terms: ⌜af0⌝ , n0
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| ⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ¬ # ⌜af0⌝ ^ < ⌜n0⌝ → (∃ m. ¬ # ⌜af0⌝ < ⌜m⌝ ∧ ⌜af0⌝ ^ to n0 = (⌜af0⌝ to m)^) ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^ |
⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n0⌝ = ⌜af0 to n1⌝ ^ ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af to n⌝ ^ = ⌜af1 to n0⌝ , ⌜af1⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n0⌝ = ⌜af0 to n1⌝ ^ ⊦ ∃ m. ⌜af1 to n0⌝ = ⌜af0 to m⌝ ^ |
Used terms: n1
| ⌜af1⌝ = ⌜af⌝ ^, ⌜af1⌝ ≠ ⌜af0⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n)
⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, # ⌜af1⌝ ≠ # ⌜af0⌝ ^ ∨ (∃ n. ¬(¬ # ⌜af1⌝ < ⌜n⌝ → ⌜af1⌝ to n = ⌜af0⌝ ^ to n)) ⊦
Used terms: ⌜af1⌝ , ⌜af0⌝ ^
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n) |
| ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, # ⌜af1⌝ ≠ # ⌜af0⌝ ^ ∨ (∃ n. ¬(¬ # ⌜af1⌝ < ⌜n⌝ → ⌜af1⌝ to n = ⌜af0⌝ ^ to n)) ⊦ |
⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦ |
⌜af1⌝ = ⌜af⌝ ^, finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦
⌜af1⌝ = ⌜af⌝ ^, ¬ finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦
Used formulas: finp(⌜af0⌝ ^)
| ⌜af1⌝ = ⌜af⌝ ^, finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦ |
⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ finp(⌜nf⌝ ); (s)
| ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦ |
⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af2⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s)
| ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af2⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s)
| ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ¬ # ⌜af⌝ ^ < ⌜# al + 1⌝ → (∃ m. ¬ # ⌜af⌝ < ⌜m⌝ ∧ ⌜af⌝ ^ to # al + 1 = (⌜af⌝ to m)^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used terms: ⌜af⌝ , # al + 1
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ¬ # ⌜af⌝ ^ < ⌜# al + 1⌝ → (∃ m. ¬ # ⌜af⌝ < ⌜m⌝ ∧ ⌜af⌝ ^ to # al + 1 = (⌜af⌝ to m)^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ # σ < ⌜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)
| ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∃ m0. ⌜af to m⌝ ^ = ⌜af0 to m0⌝ ^ ⊦
Used terms: m
| ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∃ m0. ⌜af to m⌝ ^ = ⌜af0 to m0⌝ ^ ⊦ |
⌜af1 to # al + 1⌝ = ⌜af0 to m0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^ ⊦
| ⌜af1 to # al + 1⌝ = ⌜af0 to m0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^ ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
# ⌜af1 to # al + 1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ⌜n⌝ < # ⌜af1 to # al + 1⌝ → ⌜af1 to # al + 1⌝ [n] = ⌜af0 to m0⌝ ^[n] ⊦
Used terms: ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| # ⌜af1 to # al + 1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ∀ n. ⌜n⌝ < # ⌜af1 to # al + 1⌝ → ⌜af1 to # al + 1⌝ [n] = ⌜af0 to m0⌝ ^[n] ⊦ |
⌜# al⌝ + ⌜1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ∀ n. ¬ # al < n → af1(n) = ⌜af0 to m0⌝ ^[n] ⊦
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (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) ⊦ ⌜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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s)
| ⌜# al⌝ + ⌜1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ∀ n. ¬ # al < n → af1(n) = ⌜af0 to m0⌝ ^[n] ⊦ |
⌜# al⌝ + ⌜1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ¬ # ⌜af0⌝ ^ < # ⌜af0 to m0⌝ ^, ∀ n. ¬ # al < n → af1(n) = ⌜af0 to m0⌝ ^[n] ⊦
Used simplifier rules: not-lessto-inf: ⊦ ¬ # ⌜af⌝ ^ < # ⌜af to n⌝ ^; Used formulas: # ⌜af0⌝ ^ < # ⌜af0 to m0⌝ ^
| ⌜# al⌝ + ⌜1⌝ = # ⌜af0 to m0⌝ ^, ⌜af1 to # al + 1⌝ = ⌜af to m⌝ ^, ⌜al⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ¬ # ⌜af0⌝ ^ < # ⌜af0 to m0⌝ ^, ∀ n. ¬ # al < n → af1(n) = ⌜af0 to m0⌝ ^[n] ⊦ |
Used simplifier rules: ⊦ # σ < ⌜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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (s)
| ⌜af1⌝ = ⌜af⌝ ^, ¬ finp(⌜af0⌝ ^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^, ∞ ≠ # ⌜af0⌝ ^ ∨ ⌜af1 to n⌝ ≠ ⌜af0⌝ ^ to n ⊦ |
⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af1 to n ≠ af2 to n, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used simplifier rules: remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ finp(σ) → # σ = ∞; (s)
| ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af1 to n ≠ af2 to n, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, af1 to n ≠ af2 to n, ¬ # ⌜af⌝ ^ < ⌜n⌝ → (∃ m. ¬ # ⌜af⌝ < ⌜m⌝ ∧ ⌜af⌝ ^ to n = (⌜af⌝ to m)^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used terms: ⌜af⌝ , n
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, af1 to n ≠ af2 to n, ¬ # ⌜af⌝ ^ < ⌜n⌝ → (∃ m. ¬ # ⌜af⌝ < ⌜m⌝ ∧ ⌜af⌝ ^ to n = (⌜af⌝ to m)^), ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n⌝ = ⌜af to n0⌝ ^, af1 to n ≠ af2 to n, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n⌝ = ⌜af to n0⌝ ^, af1 to n ≠ af2 to n, ∀ n. ∃ m. ⌜af to n⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜af1 to n⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af1 to n ≠ af2 to n, ∃ m. ⌜af to n0⌝ ^ = ⌜af0 to m⌝ ^ ⊦
Used terms: n0
| ⌜af1 to n⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af1 to n ≠ af2 to n, ∃ m. ⌜af to n0⌝ ^ = ⌜af0 to m⌝ ^ ⊦ |
⌜af1 to n⌝ = ⌜af0 to n1⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n⌝ = ⌜af to n0⌝ ^, af1 to n ≠ af2 to n ⊦
| ⌜af1 to n⌝ = ⌜af0 to n1⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af1 to n⌝ = ⌜af to n0⌝ ^, af1 to n ≠ af2 to n ⊦ |
⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m)
⌜af1 to n⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1 to n⌝ = ⌜af0 to n1⌝ ^, af1 to n ≠ af2 to n, ¬ # ⌜af0⌝ < ⌜n1⌝ → (∃ m. ¬ # ⌜af0⌝ ^ < ⌜m⌝ ∧ (⌜af0⌝ to n1)^ = ⌜af0⌝ ^ to m) ⊦
Used terms: ⌜af0⌝ , n1
| ⊦ ¬ # α < ⌜n⌝ → (∃ m. ¬ # α ^ < ⌜m⌝ ∧ (α to n)^ = α ^ to m) |
| ⌜af1 to n⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1 to n⌝ = ⌜af0 to n1⌝ ^, af1 to n ≠ af2 to n, ¬ # ⌜af0⌝ < ⌜n1⌝ → (∃ m. ¬ # ⌜af0⌝ ^ < ⌜m⌝ ∧ (⌜af0⌝ to n1)^ = ⌜af0⌝ ^ to m) ⊦ |
⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af2 to n2 ≠ af2 to n ⊦
Used simplifier rules: ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, af2 to n2 ≠ af2 to n ⊦ |
⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, n ≠ n2, af2 to n2 ≠ af2 to n ⊦
Used formulas: n = n2
| ⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, n ≠ n2, af2 to n2 ≠ af2 to n ⊦ |
⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, #(⌜af⌝ ^ to n) ≠ #(⌜af0⌝ ^ to n2), n ≠ n2, af2 to n2 ≠ af2 to n ⊦
Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) Used formulas: #(⌜af⌝ ^ to n) = #(⌜af0⌝ ^ to n2)
| ⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, #(⌜af⌝ ^ to n) ≠ #(⌜af0⌝ ^ to n2), n ≠ n2, af2 to n2 ≠ af2 to n ⊦ |
⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, af2 to n2 ≠ af2 to n ⊦
Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, af2 to n2 ≠ af2 to n ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, #(af2 to n2) ≠ #(af2 to n) ∨ (∃ n0. ¬(n0 < #(af2 to n2) → (af2 to n2)[n0] = (af2 to n)[n0])) ⊦
Used terms: af2 to n2, af2 to n
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| ⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2⌝ = ⌜af0⌝ ^, #(af2 to n2) ≠ #(af2 to n) ∨ (∃ n0. ¬(n0 < #(af2 to n2) → (af2 to n2)[n0] = (af2 to n)[n0])) ⊦ |
⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, n2 ≠ n ⊦
Used simplifier rules: ⊦ #(nf to n) = n; (s)
| ⌜af0 to n1⌝ ^ = ⌜af2 to n2⌝ , af1 to n = af2 to n2, ⌜af2⌝ = ⌜af0⌝ ^, ⌜af1⌝ = ⌜af⌝ ^, ⌜af2 to n2⌝ = ⌜af to n0⌝ ^, n2 ≠ n ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
Used simplifier rules: ⊦ #(nf to n) = n; (s) Used terms: af1 to n, af2 to n2
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
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.