[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 Uniform-array
∀ m. indhyp-array(mklist([].head, m)), ∀ ar, m, a. indhyp-array(ar) → indhyp-array(ar[m := a]) ⊦ indhyp-array(ar)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 27
Used lemmas:
Put-other
,
Size-put
,
Size-mkarray
,
Extension
,
Used spec theorems:
list-getput
/
extension
Used simplifier rules:
nat
/
ls
nat
/
le-ls-simp
nat
/
le-def
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
lez
list-data
/
l
nat-basic
/
f
list-del
/
get-mklist-01
nat-basic
/
succ
nat
/
succ-01
nat
/
lels-03
nat
/
lels
nat
/
ls-le-simp
nat
/
elim-sub
nat-basic
/
l-02
nat-basic
/
s-04
nat-basic
/
lf-01
list-getput
/
put-at-eq
nat
/
eqle-one
nat
/
fle
nat
/
ler
nat-basic
/
l-08
nat
/
les
nat-basic
/
eqs