From Undecidability.Shared.Libs.PSL Require Import FinTypes.
(* * Definition of prod as finType *)

Lemma ProdCount (T1 T2: eqType) (A: list T1) (B: list T2) (a:T1) (b:T2)  :
count (prodLists A B) (a,b) =  count A a * count B b .