[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 8 from proof Data-notin-other (
previous step
)
d0 ∈ st[a, d1] ⊦ d0 = d1, d0 ∈ st
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 1
:
⊦ d ∈ st ↔ (∃ a. a ∈ st ∧ st[a] = d)
Rule argument
spec: inst: name: Data-in seq: ⊦ d ∈ st ↔ (∃ a. a ∈ st ∧ st[a] = d) subst: [st, d] → [st[a, d1], d0] flags: rewrite, current
Additional information
[Concretesimprules(()), Extraterms((st[a, d1]d0))]