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