[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 1 from proof Data-in-putdelput (conclusion)
⊦ ¬ d0 ∈ st ∧ d0 ≠ d1 ∧ d0 ≠ d2 → ¬ d0 ∈ (st[b, d1] -- a)[c, d2]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
d0 ∈ (st[b, d1] -- a)[c, d2] ⊦ d0 = d2, d0 = d1, d0 ∈ st
Rule argument
Additional information