| frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦ ∀ n. ⌜n⌝ < # σ → iNV(σ[n]) |
frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦ ∀ n. ⌜n⌝ < # σ → iNV(σ[n])
| frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦ ∀ n. ⌜n⌝ < # σ → iNV(σ[n]) |
⌜n⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦
| ⌜n⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦ |
⌜0⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[0]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦
⌜n0 +1⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n0 +1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s), ∀ σ, startf, stepf, α, iNV. ¬ ( ⌜n0⌝ < # σ ∧ frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) ∧ ¬ iNV(σ[n0]) ∧ (∀ s. startf(s) → iNV(s)) ∧ (∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0))) ⊦
Used simplifier rules: nat freely generated by 0, +1;;
| ⌜0⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[0]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦ |
Used simplifier rules: ⊦ ⌜0⌝ < # σ ↔ σ ≠ []; (s) Used terms: σ[0]
| ⌜n0 +1⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n0 +1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s), ∀ σ, startf, stepf, α, iNV. ¬ ( ⌜n0⌝ < # σ ∧ frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) ∧ ¬ iNV(σ[n0]) ∧ (∀ s. startf(s) → iNV(s)) ∧ (∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0))) ⊦ |
⌜n0⌝ + ⌜1⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ σ0, startf0, stepf0, α0, iNV0. ¬ ⌜n0⌝ < # σ0 ∨ ¬ frag(IOAut(startf0, stepf0))(σ0, α0) ∨ ¬ startf0(σ0[0]) ∨ iNV0(σ0[n0]) ∨ ¬(∀ s. startf0(s) → iNV0(s)) ∨ ¬(∀ s, a, s0. iNV0(s) ∧ stepf0(s, a, s0) → iNV0(s0)) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (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)
| ⌜n0⌝ + ⌜1⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ σ0, startf0, stepf0, α0, iNV0. ¬ ⌜n0⌝ < # σ0 ∨ ¬ frag(IOAut(startf0, stepf0))(σ0, α0) ∨ ¬ startf0(σ0[0]) ∨ iNV0(σ0[n0]) ∨ ¬(∀ s. startf0(s) → iNV0(s)) ∨ ¬(∀ s, a, s0. iNV0(s) ∧ stepf0(s, a, s0) → iNV0(s0)) ⊦ |
⌜n0⌝ + ⌜1⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s), ¬ ⌜n0⌝ < # σ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ iNV(σ[n0]) ∨ ¬(∀ s. startf(s) → iNV(s)) ∨ ¬(∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0)) ⊦
Used terms: σ, startf, stepf, α, iNV
| ⌜n0⌝ + ⌜1⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s), ¬ ⌜n0⌝ < # σ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ iNV(σ[n0]) ∨ ¬(∀ s. startf(s) → iNV(s)) ∨ ¬(∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0)) ⊦ |
⌜n0⌝ + ⌜1⌝ < # σ, ⌜n0⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦
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 + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf
| ⌜n0⌝ + ⌜1⌝ < # σ, ⌜n0⌝ < # σ, frag(IOAut(startf, stepf))(σ, α), iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# σ = # α + ⌜1⌝ , ⌜n0⌝ < # σ, ⌜n0⌝ + ⌜1⌝ < # σ, iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ n. ⌜n⌝ < # α → stepf(σ[n], α[n], σ[n +1]) ⊦
Used terms: α, σ, stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # σ = # α + ⌜1⌝ , ⌜n0⌝ < # σ, ⌜n0⌝ + ⌜1⌝ < # σ, iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ n. ⌜n⌝ < # α → stepf(σ[n], α[n], σ[n +1]) ⊦ |
# σ = # α + ⌜1⌝ , ⌜n0⌝ < # σ, ⌜n0⌝ < # α, iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s), ∀ n. ⌜n⌝ < # α → stepf(σ[n], α[n], σ[n + 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)
| # σ = # α + ⌜1⌝ , ⌜n0⌝ < # σ, ⌜n0⌝ < # α, iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s), ∀ n. ⌜n⌝ < # α → stepf(σ[n], α[n], σ[n + 1]) ⊦ |
# σ = # α + ⌜1⌝ , ⌜n0⌝ < # α, ⌜n0⌝ < # σ, iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ⌜n0⌝ < # α → stepf(σ[n0], α[n0], σ[n0 + 1]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦
Used terms: n0
| # σ = # α + ⌜1⌝ , ⌜n0⌝ < # α, ⌜n0⌝ < # σ, iNV(σ[n0]), startf(σ[0]), ¬ iNV(σ[n0 + 1]), ⌜n0⌝ < # α → stepf(σ[n0], α[n0], σ[n0 + 1]), ∀ s. startf(s) → iNV(s), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0) ⊦ |
# σ = # α + ⌜1⌝ , ⌜n0⌝ < # σ, ⌜n0⌝ < # α, iNV(σ[n0]), startf(σ[0]), stepf(σ[n0], α[n0], σ[n0 + 1]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦
| # σ = # α + ⌜1⌝ , ⌜n0⌝ < # σ, ⌜n0⌝ < # α, iNV(σ[n0]), startf(σ[0]), stepf(σ[n0], α[n0], σ[n0 + 1]), ¬ iNV(σ[n0 + 1]), ∀ s, a, s0. iNV(s) ∧ stepf(s, a, s0) → iNV(s0), ∀ s. startf(s) → iNV(s) ⊦ |
Used terms: σ[n0], α[n0], σ[n0 + 1]
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.