[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-sub-rem-inter-empty
⊦ s0 ∩ s2 = ∅ ∧ s1 ∩ s2 = ∅ → (s0 ∪ s1 ⊆ s3 \ s2 ↔ s0 ∪ s1 ⊆ s3)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 26
Used lemmas:
Difference
,
int-c
,
int-a
,
Intersect
,
unc
,
una
,
Union
,
Used spec theorems:
set-basic
/
Subset
set-basic
/
Extension
Used simplifier rules:
set-basic
/
In-empty
set-basic
/
size-zero-01
set-basic
/
ne-01