[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 ri-inj
⊦ ri-inj(ri) ↔ (∀ key0, key1. key0 ∈ ri ∧ key1 ∈ ri ∧ ri[key0] = ri[key1] → key0 = key1)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
ri-cons-inj
,
ri-inj-del
,
ri-inj-empty
,
ri-inj-rem
,
ri-inj-variant1-01
,
ri-inj-write
,
ubifs-cons-ri-inj
,
Used by units in proved state:
gjournal-base
,
index-base
,
Proof exists?: No