[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-exgr
# s < # s0 ⊦ ∃ a. a ∈ s0 ∧ ¬ a ∈ s
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
size-three
,
size-two-04
,
sub-size
,
sub-sizeneqex
,
subsize-eq
,
Used by units in proved state:
set-union
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 34
Used lemmas:
add
,
in-02
,
indef
,
ne-01
,
eq
,
ne-02
,
rax
,
Size-insert
,
eq-03
,
ne
,
size-zero-01
,
size-zero
,
In-empty
,
Size-empty
,
gen
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
zero
nat-basic1
/
one
nat-basic2
/
one
nat-basic1
/
f
nat
/
l-num-02
nat-basic2
/
oz
nat-basic1
/
ref-1
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
nls-fst