[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 n2s-char
⊦ n < 10 → n→s(n) = ('0' + '1' + '2' + '3' + '4' + '5' + '6' + '7' + ('8' + '9'))[n] + ""
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
char0
,
char1
,
char2
,
char3
,
char4
,
char5
,
char6
,
char7
,
char8
,
char9
,
inject-n2s
,
n2s-chars
,
n2s-empty
,
n2s-length
,
n2s-s2n-identity
,
n2s-zero
,
Used by units in proved state:
string-ops
,
Proof exists?: No