[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-size-le
⊦ #(s0 ∪ s1) ≤ # s0 + # s1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
union-size-not-less
,
union-size-not-less-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
uninsert
,
unrax
,
unin
,
unadd
,
unc
,
una
,
une
,
Used spec theorems:
set-basic
/
eq
Used simplifier rules:
nat
/
lels-01
set-basic
/
Size-empty
nat-basic2
/
add-base
nat-basic1
/
ref-1
set-basic
/
ne
nat-basic2
/
l
nat-basic2
/
oz
set-basic
/
Size-insert
nat-basic2
/
nls-fst
nat-basic2
/
a
nat-basic2
/
c
set-basic
/
size-zero-01
set-basic
/
size-zero
set-basic
/
ne-01
nat-basic1
/
f