[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 restrict-union
⊦ (as0 ∪ as1) | n = (as0 | n) ∪ (as1 | n)
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: 7
Proof steps: 13
Used lemmas:
restrict-in
,
restrict-leb
,
Used spec theorems:
set-basic
/address-store/
Extension
set-union
/address-store/
unrax
Used simplifier rules:
address-data
/
elim
set-union
/address-store/
unc
set-union
/address-store/
una
set-union
/address-store/
unin
address-data
/
sel-03