[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 union-move-left (conclusion)
⊦ ¬ a ∈ st0 ∧ a ∈ st1 ∧ st1[a] = d → st0[a, d] ∪ (st1 -- a) = st0 ∪ st1
System applied rule normalize
And obtained the following new goals
Proof step 2
:
st1[a] = d, a ∈ st1 ⊦ st0[a, d] ∪ (st1 -- a) = st0 ∪ st1, a ∈ st0
Rule argument
Additional information