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

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

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 22:
⊦
Proof step 28:
〈build_rec#(i + 1; x2, to2)〉 (x2 = [] ∧ to2 = some(t)), ∀ 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 → x0 = depths(to .t, i0) + x)), x1 = [], x2 = depths(t, i + 1), to2 = fail, d ' + y = depths(t, i + 1), 0 ≠ i1, d ∈ depths(t, i + 1), max(depths(t, i + 1)) ≤ i1 + i, i < d, 0 < i1 ⊦ 〈x := x1, d0 := i + 1〉〈if is_empty(x) then to := fail else let h = head(x) in if h < d0 then to := fail else if h = d0 then { x := pop(x) ; to := some(Leaf) } else let to0 = fail, to1 = fail in { build_rec#(d0 + 1; x, to0) ; if to0 = fail then to := fail else { build_rec#(d0 + 1; x, to1) ; if to1 = fail then to := fail else to := some(Node(to0 .t, to1 .t)) } }〉〈to2 := to ; if to2 = fail then to0 := fail else to0 := some(Node(t, to2 .t))〉 (to0 ≠ fail → d ' + y = depths(to0 .t, i) + x)

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ()]]