[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
,
Proof step 3 from proof hassharing-validrefs-dups (
previous step
)
validrefs(str, refs, ty, st), refs ≠ [] ⊦ ∃ sks. fits(refs .first, sks, st) ∧ 1 + # sks = # refs ∧ (∀ n. 0 < n ∧ n ≤ # sks → st[refs .first -- firstn(n, sks)] .refval = refs[n])
Lemma
ex-validrefs-fits-stronger