Theorem: MProd.mk.arg_fstsnd.cderiv_rule (SciLean/Core/Monads/MProd.lean)

State before:
K : Type u_1
inst✝³ : RCLike K
X : Type u_3
inst✝² : Vec K X
Y : Type u_3
inst✝¹ : Vec K Y
W : Type u_2
inst✝ : Vec K W
f : W → X
g : W → Y
hf : CDifferentiable K f
hg : CDifferentiable K g
⊢ (cderiv K fun w => { fst := f w, snd := g w }) = fun w dw =>
    let dx := cderiv K f w dw;
    let dy := cderiv K g w dw;
    { fst := dx, snd := dy }
Tactic:
sorry_proof
State after:
no goals