intuition.
unfold computeHybrid.
unfold forNats.
fold forNats.
inline_first.
unfold compMap.
fold compMap.
comp_simp.
inline_first.
rewrite <- minus_n_O.
comp_skip.
comp_simp.
simpl.
intuition.
Qed.

(* Specifications: *)
Theorem compMap_computeHybrid_n_equiv :
forall s_A a,
Pr  [b <-$ compMap B_EqDec (fun _ : nat => (c1 a)) (forNats n); A2 s_A b ] ==
Pr  [x <-$ computeHybrid n n a; A2 s_A x ].