[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 subseteq-rem-del
⊦ a ∈ s0 ∧ s0 ⊆ s1 → s1 \ (s0 -- a) = (s1 \ s0) ++ a
Type: A user defined theorem
Validity: The proof is valid.
Features: simp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 9
Used lemmas:
del-rax
,
Delete
,
Difference
,
Used spec theorems:
set-basic
/
Extension
set-union
/
subdef
Used simplifier rules:
set-basic
/
size-zero-01
set-basic
/
ne-01
set-basic
/
sub-in
set-basic
/
rax