[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 14 from proof upcase-a (
previous step
)
58 ≤ 83 ⊦ s→l(sortedchars)[58 - (58 - pos('A', sortedchars))] = 'A', 83 = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 15
:
⊦ s→l(sortedchars)[58 - (58 - pos('A', sortedchars))] = 'A'
Rule argument
Additional information