[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 refsize-nonzero-notin-ginval
⊦ gstore[n] = groupblock(gndx, lax, m2) ∧ n ∈ gstore ∧ m2 ≠ 0 ∧ refsize-cons(gstore, range ri) ∧ ri-cons(ri, nodes(gstore ↓, ginval)) ∧ inv(gstore \ ginval) → ¬ n ∈ ginval
Type: A user defined theorem
Validity: The proof is valid.
Features: forward,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
down-store-at
,
down-store-adr-in-explicit
,
nodes-gstore-in
,
size-0
,
Used spec theorems:
ablock-store-refsize-cons
/group-store/
refsize-cons-def
aubifs-inv
/
ri-cons
store+set
/node-index/
Data-in
Used simplifier rules:
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
aubifs-base
/
range
ablock
/group-store/
sel-03
address-data
/
elim
address-data
/
sel-03