[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 nodes-gstore-in
⊦ adr ∈ nodes(gstore, ginval) ↔ ¬ ¬(adr ∈ gstore ∧ ¬ adr.lnum ∈ ginval)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
abs-log-new
,
adr-in-index-node-key
,
adr-in-ri-in-gstore
,
adr-in-ri-leb-notin-ginval
,
adr-in-ri-notin-nodes
,
ginval-extract-nodes
,
in-nodes-down-at-same
,
in-nodes-in-gstore
,
lebs-dom-remove-refsize0
,
new-adrs-gstore
,
nodes-allocate
,
nodes-append-subseteq
,
nodes-append-subseteq-nodown
,
nodes-crash-down
,
nodes-dealloc
,
nodes-empty
,
nodes-except-refsize
,
nodes-ginval-inter
,
nodes-ginval-rem
,
nodes-ginval-rem-01
,
nodes-no-change-eq
,
nodes-referenced-adrs-leb
,
nodes-remove-ginval-notin
,
nodes-remove-refsize0
,
nodes-transaction
,
nodes-write-at-other
,
nodes-write-nochange
,
nodes-write-same-flushed
,
notin-notin-nodes-down
,
range-rem-in
,
refsize-nonzero-notin-ginval
,
ri-cons-range-restrict-notin-gstore
,
size-0
,
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: No