[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 intersection-size
⊦ ¬ # s0 + # s < #(s0 ∩ s)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
union-size-03
,
union-size-ls-in
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
Intersect
,
intersection-insert
,
intersection-shift
,
int-c
,
int-a
,
int-e
,
Used spec theorems:
set-basic
/
eq
set-basic
/
Size-insert
Used simplifier rules:
nat-basic
/
f
nat-basic
/
z-02
nat-basic
/
a
nat-basic
/
c
set-basic
/
Size-empty
nat-basic
/
less-zero
set-basic
/
Size-insert
nat-basic
/
nls-fst
set-basic
/
In-empty
set-basic
/
Extension
set-basic
/
ne-01
nat-basic
/
l