[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 size-toAr
n < #r mx ⊦ # toArr(mx, n) = n * #c mx
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
toArr-rec
,
toArr-base
,
Used spec theorems:
Used simplifier rules:
list-data
/list-as-arrayinstance/
size-nil
nat-mult
/
zero
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
f
nat-basic
/
succ
nat-basic
/
c
nat-basic
/
a
nat-basic
/
eq-01
nat-mult
/
rsucc-02
list
/list-as-arrayinstance/
a
matrix+array
/
selrow-size
list
/list-as-arrayinstance/
len
nat-basic
/
nls-fst