[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 5 from proof dups-fis-keys (
previous step
)
sk ∈ fis .keys ⊦ sk ∈ fis, dups(fis .keys)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 4
:
⊦ sk ∈ fis ↔ sk ∈ fis .keys
Rule argument
[crewrite-arg: keys-in-01, F, [fis, sk] → [fis, sk]]
Additional information
[[CONCRETESIMPRULES : ()], [EXTRATERMS : (fis, sk)]]