You may want to ask this question in the OPL Forum.
One (ugly) way of doing this that comes to mind would be to introduce boolean helper variables:
dvar boolean help[1..n];
...
forall(i in 1..n) help[i] == (a_i); // help[i]==1 iff a_i is true
sum(i in 1..n) help[i] == n; // all help[i] must be 1
This is not easy to read but is close to what the CPLEX engine would make of your aggregated and anyway.
#CPLEXOptimizers#DecisionOptimization