[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
,
Theorem union-rem-add
⊦ a ∈ s0 → ((s0 -- a) ∪ s1) ++ a = s0 ∪ s1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
Delete
,
unrax
,
unindel
,
unc
,
una
,
Used spec theorems:
set-basic
/
Extension
Used simplifier rules:
set-basic
/
size-zero-01
set-basic
/
ne-01
set-basic
/
rax