[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 prepost-fix-ecs
valid-indices(wlar, nx), wlar0 = wlar, nx0 = nx, ¬ dups(nx) ⊦ ⟪ubi_fix_ecs#(n; nx, wlar)⟫ (wlar = wlar0.mapIndices(nx0, λ wle. wle.ec:= n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-recover
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 17
Used lemmas:
fix-ecs
,
Used spec theorems:
array-indices
/wlarray-base/
valid-indices
array-indices
/wlarray-base/
map-indices-append
array-indices
/wlarray-base/
map-indices-at
array-indices
/wlarray-base/
map-indices-size
Used simplifier rules:
list
/nat-list-set/
app
array-indices
/wlarray-base/
mapindices-base
list
/nat-list-set/
app-05
nat-list-less
/
ls-base
nat-basic
/
c
nat-basic
/
a
oelem
/nat-set/
irreflexivity
nat-basic
/
s-04
nat
/
ls-01
list-data
/nat-list-set/
l
nat-basic
/
one-01
nat
/
le-def
nat
/
pred-03
list-data
/nat-list-set/
length-rest
array-indices
/wlarray-base/
valid-indices-write
list-data
/nat-list-set/
elim-list-c
list
/nat-list-set/
app-03
list-dup
/nat-list-set/
dups-cons
nat
/
lels
list-dup
/nat-list-set/
a
nat
/
fle-01
nat-basic
/
f
list-dup
/nat-list-set/
c-02
list-dup
/nat-list-set/
f-01
array-indices
/wlarray-base/
valid-indices-one
array-indices
/wlarray-base/
valid-indices-append
list
/nat-list-set/
a
list
/nat-list-set/
e-01
list
/nat-list-set/
c
nat
/
ls-le-simp