[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 del-three
⊦ 2 < # s → #(s -- a -- a0) ≠ 0
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: 1
Proof steps: 7
Used lemmas:
del-in-01
,
del-in
,
del-addeq-04
,
Delete
,
del-feq
,
one-min
,
del-e-01
,
del-addeq-05
,
del-e-02
,
Used spec theorems:
set-basic
/
indef
Used simplifier rules:
set-basic
/
size-one-01
set-basic
/
ne-01
set-basic
/
In-empty
set-basic
/
one-size
nat-basic
/
f
set-basic
/
Size-empty
set-basic
/
size-zero-02
set-basic
/
in-06
set-basic
/
ne
set-basic
/
eq-02
set-basic
/
in-02
set-basic
/
Size-insert
nat
/
l-num-04
nat-basic
/
one
nat-basic
/
a
nat-basic
/
c
set-basic
/
size-zero-01