[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-h
⊦ n < n0 ∧ n0 ≤ # ar → (¬ ar[n] ∈ ar elems n0 ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
ar-elems-in
,
ar-elems-update-h
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
elems-rec
,
Used spec theorems:
bag-union
/
in
bag-basic
/
count-insert
Used simplifier rules:
nat-basic2
/
z-01
nat
/
anti
nat-basic1
/
lf-02
bag-basic
/
count-same
nat-basic2
/
oz
nat
/
lels-03
nat
/
lels
nat
/
ls-le-simp
nat
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
nat-basic2
/
succ
nat-basic1
/
zero-01
nat-basic1
/
f
nat
/
fle