[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 4 from proof downcase-A (
previous step
)
pos('Z', sortedchars) < pos('A', sortedchars) ⊦ downcase('A') = 'a'
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 5
:
⊦ pos('Z', sortedchars) = 53
Proof step 6
:
53 < pos('A', sortedchars) ⊦ downcase('A') = 'a'
Rule argument
spec: string-less inst: name: pos-Z seq: ⊦ pos('Z', sortedchars) = 53 subst: flags: rewrite
Additional information
Used terms: