[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-rem-add (conclusion)
⊦ a ∈ s0 → ((s0 -- a) ∪ s1) ++ a = s0 ∪ s1
System applied rule normalize
And obtained the following new goals
Proof step 2
:
a ∈ s0 ⊦ ((s0 -- a) ∪ s1) ++ a = s0 ∪ s1
Rule argument
Additional information