Proof engineering in Coq is a labor-intensive process, and as proof developments grow in size, redundancy and maintainability become significant challenges. One such redundancy is \textit{goal cloning}, i.e., proving $\alpha$-equivalent goals multiple times, leading to wasted effort and bloated proof scripts. In this paper, we introduce clone-finder, a novel technique for detecting goal clones in Coq proofs. By leveraging the formal notion of $\alpha$-equivalence for Gallina terms, clone-finder systematically identifies duplicated proof goals across large Coq codebases. We evaluate clone-finder on 40 real-world Coq projects from the CoqGym dataset. Our results reveal that each project contains an average of 16.9 instances of goal clone. We observed that the clones can be categorized as either \textit{exact goal duplication}, \textit{generalization}, or \textit{$\alpha$-equivalent goals with different proofs}, each signifying varying levels duplicate effort. Our findings highlight significant untapped potential for proof reuse in Coq-based formal verification projects, paving the way for future improvements in automated proof engineering.