[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 inter-union-empty-one-empty
n < m, m ≤ # asar ⊦ as ∩ union(asar, 0, m) = ∅ → as ∩ asar[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: 2
Proof steps: 7
Used lemmas:
in-index-in-union
,
Used spec theorems:
set-basic
/address-list-set/
Extension
Used simplifier rules:
set-basic
/address-list-set/
size-zero
nat
/
fle
nat-basic
/
f
set-basic
/address-list-set/
size-zero-01
set-basic
/address-list-set/
ne-01
set-basic
/address-list-set/
In-empty
set-union
/address-list-set/
Intersect
set-union
/address-list-set/
int-a
set-union
/address-list-set/
int-c