[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 validrefkeyval-def
⊦ validval(str, r -- sk, val, st) ↔ (is_fskey(sk) → validval(str, val, sk .fs .type, st) ∧ sk .fs .type ≠ void_type ∧ sk ≠ _length) ∧ (is_indexkey(sk) → validval(str, val, st[r -- _type] .type .type, st))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
validref-putrkvs
,
validstatfield-putrkvs
,
validval-field-norefval
,
validval-index-norefval
,
validval-put-any
,
validval-putrkvs
,
validvals-voidtype
,
Used by units in proved state:
Proof exists?: No