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

x2 = x ⊦ 〈build_rec#(0; x, to)〉〈to0 := to, x0 := x ; if ¬ is_empty(x0) then to0 := fail〉 (to0 = fail → (∀ t. x2 ≠ depths(t, 0)))

User applied rule cut formula

And obtained the following new goals

Proof step 28:
x2 = x, x = [] ∨ ¬ 0 ≤ max(x) ⊦ 〈build_rec#(0; x, to)〉〈to0 := to, x0 := x ; if ¬ is_empty(x0) then to0 := fail〉 (to0 = fail → (∀ t. x2 ≠ depths(t, 0)))
Proof step 47:
x2 = x, ¬ (x = [] ∨ ¬ 0 ≤ max(x)) ⊦ 〈build_rec#(0; x, to)〉〈to0 := to, x0 := x ; if ¬ is_empty(x0) then to0 := fail〉 (to0 = fail → (∀ t. x2 ≠ depths(t, 0)))

Rule argument

[fma-arg: (x = [] ∨ ¬ 0 ≤ max(x))]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRAFMAS : ((x = [] ∨ ¬ 0 ≤ max(x)))]]