[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-subset
⊦ disjointp(spmx1, spmx2) → (spmx1 ∪ spmx2 ⊆ spmx ↔ spmx1 ⊆ spmx ∧ spmx2 ⊆ spmx)
Type: A user defined theorem
Validity: The proof is valid.
Features: lws, ws,
Comment:
Used by:
Used by units in proved state:
VF3conc
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 20
Used lemmas:
disjointp-def
,
union-def
,
Used spec theorems:
store
/sparsearray/
Subset
store+set
/sparsearray/
oplus-l-at-left
store+set
/sparsearray/
oplus-l-in
Used simplifier rules:
store+set
/sparsearray/
oplus-l-at-left
store+set
/sparsearray/
oplus-l-in
store+set
/sparsearray/
oplus-l-at-right