| IOAut?(IOAut(startf, stepf)) ⊦ EXIOAut?(infguess(IOAut(startf, stepf))) |
IOAut?(IOAut(startf, stepf)), ¬ EXIOAut?(infguess(IOAut(startf, stepf))) ⊦
| IOAut?(IOAut(startf, stepf)), ¬ EXIOAut?(infguess(IOAut(startf, stepf))) ⊦ |
startf(s), ¬ EXIOAut?(infguess(IOAut(startf, stepf))) ⊦
Used simplifier rules: ⊦ IOAut?(IOAut(startf, stepf)) ↔ (∃ s. startf(s)); (s)
| startf(s), ¬ EXIOAut?(infguess(IOAut(startf, stepf))) ⊦ |
⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))
startf(s), ¬ EXIOAut? (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦
Used terms: stepf, startf
| ⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)) |
| startf(s), ¬ EXIOAut? (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦ |
startf(s) ⊦ ∃ s. frag(IOAut(startf, stepf))(s.1, s.2) ∧ startf(s.1[0])
Used simplifier rules: ⊦ EXIOAut?(EXIOAut(startf, stepf)) ↔ (∃ s. startf(s)); (s) ⊦ (σ × α).1 = σ; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| startf(s) ⊦ ∃ s. frag(IOAut(startf, stepf))(s.1, s.2) ∧ startf(s.1[0]) |
Used simplifier rules: ⊦ (σ × α).2 = α; (s) ⊦ frag(IOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ (σ × α).1 = σ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) Used terms: ⌜s '⌝ × []
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.