[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 43 from proof completeness-rec (previous step)

〈build_rec#(i + 1; x2, to2)〉 (to2 = fail → (∀ t, x. x0 ≠ depths(t, i + 1) + x)), 〈build_rec#(i + 1; x, to2)〉 (x = x2 ∧ to2 = some(t0)), ∀ j0, i0, x, x0, to. i→n(j0 - i0) < i→n(i1) → (x = x0 ∧ x0 ≠ [] ∧ i0 ≤ j0 ∧ max(x0) ≤ j0 → 〈build_rec#(i0; x, to)〉 (to = fail → (∀ t, x1. x0 ≠ depths(t, i0) + x1))), x = d ' + y, to2 = fail, d ' + y = depths(t0, i + 1) + x2, d ∈ depths(t0, i + 1), max(d ' + y) ≤ i1 + i, i < d, 0 ≤ i1, x0 = x2 ⊦ 〈build_rec#(i + 1; x2, to2)〉〈if to2 = fail then to0 := fail else to0 := some(Node(t0, to2 .t))〉 (to0 = fail → (∀ t, x. d ' + y ≠ depths(t, i) + x))

Heuristic contract and execute applied rule execute call

And obtained the following new goals

Proof step 42:
〈build_rec#(i + 1; x2, to2)〉 (x2 = x3 ∧ to2 = to1), 〈build_rec#(i + 1; x, to2)〉 (x = x2 ∧ to2 = some(t0)), ∀ j0, i0, x, x0, to. i→n(j0 - i0) < i→n(i1) → (x = x0 ∧ x0 ≠ [] ∧ i0 ≤ j0 ∧ max(x0) ≤ j0 → 〈build_rec#(i0; x, to)〉 (to = fail → (∀ t, x1. x0 ≠ depths(t, i0) + x1))), x = d ' + y, to2 = fail, d ' + y = depths(t0, i + 1) + x2, d ∈ depths(t0, i + 1), max(d ' + y) ≤ i1 + i, i < d, 0 ≤ i1, x0 = x2, to1 = fail → (∀ t, x. x0 ≠ depths(t, i + 1) + x) ⊦ 〈if to1 = fail then to0 := fail else to0 := some(Node(t0, to1 .t))〉 (to0 = fail → (∀ t, x. d ' + y ≠ depths(t, i) + x))

Rule argument

[fmaposlist-arg: (pos: left 1, pos: right 1)]

Additional information

[[CONCRETESIMPRULES : ()]]