[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 dups-lesize
¬ dups(x), ¬ dups(y), ∀ a. a ∈ x → a ∈ y ⊦ # x ≤ # y
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
dups-eqsize
,
rm-size-03
,
rm-size-04
,
Used by units in proved state:
list-set
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
f-01
,
rec
,
Used spec theorems:
list
/
in-def
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat
/
le-def
list
/
a
list
/
in-rec
list
/
c
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
list
/
len-05
list
/
e-01
list
/
in-append
nat
/
succ-01
list
/
len