[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 7 from proof rmpos-size (
previous step
)
n ≤ # x0, ∀ m, n. # x0 = m + 1 ∧ n ≤ m → #(x0 -1l n) = m ∨ x0 = [] ⊦ x0 = [], #((a ' + x0) -1l n) = # x0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 8
:
n ≤ # x0, ∀ m, n0. # x0 = m + 1 ∧ n0 ≤ m → #(x0 -1l n0) = m ⊦ x0 = [], #((a ' + x0) -1l n) = # x0
Rule argument
Additional information