[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 charn8 (conclusion)
User applied rule insert rewrite lemma
And obtained the following new goals
- Proof step 2:
# str = 1 ⊦ s→n(str) = pos(str.char1, '0' + '1' + '2' + '3' + '4' + '5' + '6' + '7' + ('8' + '9'))
- Proof step 3:
# "8" = 1 ⊦ pos("8".char1, '0' + '1' + '2' + '3' + '4' + '5' + '6' + '7' + ('8' + '9')) = 8
Rule argument
spec: string2nat
inst:
name: s2n-char-01
seq: # str = 1
⊦ s→n(str)
= pos
(str.char1,
'0' + '1' + '2' + '3' + '4' + '5' + '6' + '7' + ('8' + '9'))
subst: [str] → ["8"]
flags: rewrite, currentAdditional information
Used simplifier rules:
str ≠ "" ⊦ # (* str) = # str.rstring + 1;% ⊦ # "" = 0;
Used terms: "8"