[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-eq-rem-subseteq
n < # asar ⊦ union(asar, 0, # asar) = as -- adr → asar[n] ⊆ as
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
in-index-in-union
,
Used spec theorems:
set-union
/address-list-set/
subdef
set-basic
/address-list-set/
Extension
Used simplifier rules:
nat-basic
/
f
set-basic
/address-list-set/
size-zero-01
set-basic
/address-list-set/
ne-01
set-union
/address-list-set/
Delete