[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
,
Theorem Char-upcase-yes
⊦ pos('a', sortedchars) ≤ pos(char, sortedchars) ∧ pos(char, sortedchars) ≤ pos('z', sortedchars) → upcase(char) = s→l(sortedchars)[pos(char, sortedchars) - (pos('a', sortedchars) - pos('A', sortedchars))]
Type: An axiom
Validity: The proof is valid.
Features:
Comment: This definition is not based on actual positions in the sortedchars. (But ASCII ordering is needed.)
Used by:
upcase-a
,
Used by units in proved state:
Proof exists?: No