Theorem: Function.Bijective.Neg.neg.arg_a0.Bijective_rule (SciLean/Core/FunctionPropositions/Bijective.lean)

State before:
X✝ : Type ?u.785
inst✝⁸ : Nonempty X✝
Y✝ : Type ?u.791
inst✝⁷ : Nonempty Y✝
Z✝ : Type ?u.797
inst✝⁶ : Nonempty Z✝
X : Type u_2
inst✝⁵ : Nonempty X
X₁ : Type ?u.809
inst✝⁴ : Nonempty X₁
X₂ : Type ?u.815
inst✝³ : Nonempty X₂
Y : Type u_1
inst✝² : Nonempty Y
Z : Type ?u.827
inst✝¹ : Nonempty Z
inst✝ : AddGroup Y
f : X → Y
hf : Bijective f
⊢ Bijective fun x => -f x
Tactic:
sorry_proof
State after:
no goals