[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-lookup
⊦ (spmx1 ∪ spmx2)[np] = (np ∈ spmx1 ⊃ spmx1[np];spmx2[np])
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
VF3conc
,
VF3conc
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
union-def
,
Used spec theorems:
store+set
/sparsearray/
oplus-l-at-left
store+set
/sparsearray/
oplus-l-at-right
store
/sparsearray/
notmemlookup
Used simplifier rules:
store+set
/sparsearray/
oplus-l-at-left
store
/sparsearray/
notmemlookup
store+set
/sparsearray/
oplus-l-in
store+set
/sparsearray/
oplus-l-at-right