graph
1
2
Sections
Graphs
Doc
Def
a[i] == 2of(a)(i)
is mentioned by
Thm*
P:(T
), a:array(T), i:
|a|, v:T. array-count(v.P(v);a[i:=v]) = array-count(v.P(v);a)+if P(v)
if P(a[i])
0 else 1 fi ;P(a[i])
-1 else 0 fi
[array-count-update]
Thm*
a:array(T), j,i:
|a|, v:T. a[i:=v][j] ~ if j=
i
v else a[j] fi
[array-update-select]
Def
array-count(v.P(v);a) == sum(if P(a[i])
1 else 0 fi | i < |a|)
[array-count]
Def
a[i:=v] == < |a|,
j.if j=
i
v else a[j] fi >
[array-update]
Try larger context:
Graphs
graph
1
2
Sections
Graphs
Doc