[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 intersect-add-rem
⊦ (s0 ++ a) ∩ (s1 -- a) = (s0 ∩ s1) -- a
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
store+set
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
Intersect
,
Delete
,
int-c
,
int-a
,
del-rax
,
int-rax
,
Used spec theorems:
set-basic
/
Extension
Used simplifier rules:
set-basic
/
rax
set-basic
/
in-02