[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 in-toArr-ind
n ≤ #r mx ⊦ i ∈ toArr(mx, n) ↔ (∃ r, c. r < n ∧ c < #c mx ∧ mx[r, c] = i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
in-toArr
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 17
Used lemmas:
toArr-rec
,
toArr-base
,
Used spec theorems:
list-del
/list-as-arrayinstance/
in-get
Used simplifier rules:
nat
/
lez
list
/list-as-arrayinstance/
in-empty
nat-basic
/
less-zero
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
list
/list-as-arrayinstance/
a
list
/list-as-arrayinstance/
in-append
nat
/
succ-01
nat
/
lels-03
nat-basic
/
trans-nat
nat-basic
/
lf
nat-basic
/
ls-02
matrix+array
/
selrow-get
matrix+array
/
selrow-size
nat-basic
/
refl-nat
nat
/
fle-01
nat
/
lels
nat
/
ler
nat-basic
/
lf-02
nat
/
anti