| α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
| α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ)
∃ n. ¬(⌜n⌝ < # α → α[n] = τ) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
Used terms: α
| ⊦ α ^ = [] ↔ (∀ n. ⌜n⌝ < # α → α[n] = τ) |
| ∃ n. ¬(⌜n⌝ < # α → α[n] = τ) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n] ≠ τ, ⌜n⌝ < # α ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
| α[n] ≠ τ, ⌜n⌝ < # α ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n] ≠ τ, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
Used simplifier rules: <; (wellfounded) Used terms: n
| α[n] ≠ τ, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n] ≠ τ, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
| α[n] ≠ τ, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n] ≠ τ, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ), ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
Used terms: n
| α[n] ≠ τ, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ), ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n0] ≠ τ, α[n] ≠ τ, n0 < n, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| α[n0] ≠ τ, α[n] ≠ τ, n0 < n, ⌜n⌝ < # α, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n0] ≠ τ, α[n] ≠ τ, ⌜n⌝ < # α, n0 < n, ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ), ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
Used simplifier rules: lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < n → ¬ n < m; (s) Used terms: n0, α
| α[n0] ≠ τ, α[n] ≠ τ, ⌜n⌝ < # α, n0 < n, ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ), ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
α[n0] ≠ τ, α[n] ≠ τ, α[n1] ≠ τ, ⌜n1⌝ < # α, n0 < n, ⌜n⌝ < # α, ∀ m. m < n1 → α[m] = τ, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
| α[n0] ≠ τ, α[n] ≠ τ, α[n1] ≠ τ, ⌜n1⌝ < # α, n0 < n, ⌜n⌝ < # α, ∀ m. m < n1 → α[m] = τ, ∀ n1, α. n1 < n → α[n1] ≠ τ ∧ ⌜n1⌝ < # α → (∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)) ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
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.