[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 30 from proof completeness (
previous step
)
x ≠ [], x = x0, i ≤ j, max(x) ≤ j ⊦ 〈build_rec#(i; x, to)〉 (to = fail → ¬ (∃ t, x1. x0 = depths(t, i) + x1))
Lemma
completeness-rec