[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 1 from proof s2n-app (conclusion)
⊦ str ≠ "" ∧ str0 ≠ "" → s→n(str + str0) = s→n(str) * 10 ^ # str0 + s→n(str0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
⊦ str = "", str0 = "", s→n(str + str0) = s→n(str) * 10 ^ # str0 + s→n(str0)
Rule argument
Additional information