Priority-based1Functional Reactive Programming (P-FRP) is a new functional programming formalism for developing safety-critical embedded systems. P-FRP allows static priority assignment and guarantees real-time response by preempting lower priority tasks. Due to the state-less nature of functional programs, preempted tasks in P-FRP are aborted and have to restart after the higher priority tasks have completed execution. Since the execution semantics of P-FRP are different from the classical preemptive model of execution, existing utilization based sufficient conditions cannot be applied. In this paper, we derive a new utilization based sufficient schedulability condition for P-FRP, and validate it using experimental task sets.