[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 lenle
unique_al(ax), ∀ a. a ∈ ax → a ∈ ay ⊦ # ax ≤ # ay
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 14
Used lemmas:
ex
,
empty
,
unique-e
,
inone
,
inapp
,
k-unique-r
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-01
nat
/
lels
list
/assoclista/
c-08
list
/assoclista/
c-07
nat-basic2
/
s
list
/assoclista/
e-01
list
/assoclista/
c
pair
/
sel-02
list-data
/assoclista/
size-01
nat
/
lez-01
nat-basic1
/
zero-01
list-data
/assoclista/
l
nat-basic1
/
f
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
nat-basic2
/
succ
list
/assoclista/
len-05
list
/assoclista/
a
list
/assoclista/
len