[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 -- b) ≠ 0
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: 0
Proof steps: 14
Used lemmas:
del-in
,
Delete
,
del-size
,
del-rax
,
Used spec theorems:
Used simplifier rules:
set-basic
/
ne-01
nat-basic1
/
one
nat
/
l-num-04
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
set-basic
/
size-one-02
nat-basic1
/
lf-01
nat
/
elim-pred-c
set-basic
/
In-empty
set-basic
/
Extension
set-basic
/
size-zero-02
nat-basic1
/
f