Translating coq statment to ‘math’

I’m trying to understand what this statement is trying to prove.

forall (C:Prop) (T:Set) (B: T -> Prop), (exists x : T, C -> B x) -> C -> exists x : T, B x.

I’m new to coq, so I can’t quite get what I need to prove there. The syntax is not very intuitive (for me).
How can I read this in a more ‘math’ way?