[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-inter-empty-empty
⊦ s0 ⊆ s1 ∧ s1 ∩ s2 = ∅ → s0 ∩ s2 = ∅
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: 3
Proof steps: 9
Used lemmas:
int-c
,
int-a
,
int-rax
,
Used spec theorems:
set-union
/
subdef
set-basic
/
Extension
Used simplifier rules:
set-basic
/
size-zero
set-basic
/
In-empty
set-basic
/
size-zero-01
set-basic
/
ne-01