(3steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: array-count wf

T:Type, P:(T), a:array(T). array-count(v.P(v);a) (|a|+1)

By: Unfold `array-count` 0

Generated subgoals:

11. T: Type
2. P: T
3. a: array(T)
0sum(if P(a[i]) 1 else 0 fi | i < |a|)
1 step
 
21. T: Type
2. P: T
3. a: array(T)
sum(if P(a[i]) 1 else 0 fi | i < |a|) < |a|+1
1 step

About:
boolifthenelsenatural_numberaddless_thanfunctionuniversememberall

(3steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc