[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 size-union
⊦ s ∩ s0 = ∅ → #(s ∪ s0) = # s + # s0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 18
Used lemmas:
Union
,
unrax
,
unadd-01
,
unc
,
una
,
une
,
int-c
,
int-a
,
int-rax
,
Used spec theorems:
set-basic
/
Size-insert
Used simplifier rules:
set-basic
/
In-empty
set-basic
/
Extension
set-basic
/
Size-empty
nat-basic2
/
z
set-basic
/
eq
set-basic
/
size-zero-01
set-basic
/
ne-01
set-basic
/
rax
nat-basic2
/
c
nat-basic2
/
eq-01
nat-basic2
/
a
set-basic
/
Size-insert