[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 ar-elems-in-exists-h
⊦ n ≤ # ar ∧ a ∈ ar elems n → (∃ n0. n0 < n ∧ ar[n0] = a)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
ar-elems-in-exists
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
elems-rec
,
elems-base
,
Used spec theorems:
bag-union
/
in
Used simplifier rules:
nat-basic1
/
ls-02
nat-basic1
/
trans-1
nat-basic1
/
lf
bag-basic
/
count-other
nat
/
lels-03
nat-basic1
/
ref-1
nat-basic1
/
f
nat-basic2
/
s
nat
/
lels
nat
/
succ-01
nat
/
le-ls-simp
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
succ
bag-union
/
in-emp