[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof reach-n-split-le (conclusion) (back to tree)

reachable-n(h, n, r, r0), m ≤ n ⊦ ∃ r1. reachable-n(h, m, r, r1) ∧ reachable-n(h, n - m, r1, r0)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:reach-n-split, seq:reachable-n(h, n, r, r0), m < n ⊦ ∃ r1. reachable-n(h, m, r, r1) ∧ reachable-n(h, n - m, r1, r0), subst:[r0, h, n, m, r] → [r0, h, n, m, r]

Additional information

Used simplifier rules: reachable-n-base: ⊦ reachable-n(h, 0, r, r0) ↔ r = r0; ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) ⊦ m ≤ m; (s) ⊦ m - m = 0; (s) Used terms: r0, h, n, m, r

Proof step 2 from proof reach-n-split-le (previous step) (back to tree)

reachable-n(h, n, r, r0), m < n ⊦ ∃ r1. reachable-n(h, m, r, r1) ∧ reachable-n(h, n - m, r1, r0)

Lemma reach-n-split

Proof Tree for reach-n-split-le (View conclusion)

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.

the proof tree