[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 lebs-index
⊦ n ∈ ri.lebs ↔ (∃ adr. adr.lnum = n ∧ adr ∈ ri)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
lebs-del-subseteq
,
lebs-empty
,
lebs-in-ri-in-gstore
,
lebs-in-ri-in-gstore-explicit
,
lebs-lookup-subseteq
,
lebs-range
,
lebs-rem-subseteq
,
lebs-write
,
lebs-write-subseteq
,
lebs-write-subseteq0
,
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
gjournal-abs
,
Proof exists?: No