[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
,
Proof step 8 from proof map-indices-size (
previous step
)
nx0 < # ar, m < # ar, ∀ ar, f. nx0 < # ar → # ar.mapIndices(nx0, f) = # ar ⊦ # ar[m, f(ar[m])].mapIndices(nx0, f) = # ar
User applied rule all left
And closed the goal!
Rule argument
pos: left 3 terms: ar[m, f(ar[m])], f abort: F discard: T computed: T
Additional information
Used simplifier rules: ⊦ # ar[n, a] = # ar; (s) Used terms: ar[m, f(ar[m])], f