[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 multi-isarrayref-notin
⊦ ¬ r ∈ refs ∧ # refs = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → (is_arrayref(r, j, addmultiarrays(refs, i, acc, ty, ints, st)) ↔ is_arrayref(r, j, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
multi-isarrayref
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 15
Used lemmas:
multi-in-other
,
Used spec theorems:
storearrays
/
is_arrayref
Used simplifier rules:
int-abs
/
forward-lels
list
/intlista/
c-07
list
/intlista/
app-02-ant
list
/intlista/
e
list
/intlista/
c-08
storefuns
/
instore-01
int-abs
/
lels-03
int-abs
/
lels-04
int-abs
/
forward-le-05
int-abs
/
lels
int-abs
/
lels-01
int-abs
/
zero-gels-04
valuesfuns
/
posints-rec
list
/intlista/
a
list
/intlista/
e-01
list
/intlista/
c
int-abs
/
forward-le-01
list-data
/intlista/
elim-list-c