Theorem: Function.Bijective.HSub.hSub.arg_a1.Bijective_rule (SciLean/Core/FunctionPropositions/Bijective.lean)

State before:
X✝ : Type ?u.2982
inst✝⁸ : Nonempty X✝
Y✝ : Type ?u.2988
inst✝⁷ : Nonempty Y✝
Z✝ : Type ?u.2994
inst✝⁶ : Nonempty Z✝
X : Type u_2
inst✝⁵ : Nonempty X
X₁ : Type ?u.3006
inst✝⁴ : Nonempty X₁
X₂ : Type ?u.3012
inst✝³ : Nonempty X₂
Y : Type u_1
inst✝² : Nonempty Y
Z : Type ?u.3024
inst✝¹ : Nonempty Z
inst✝ : AddGroup Y
y : Y
f : X → Y
hf : Bijective f
⊢ Bijective fun x => y - f x
Tactic:
sorry_proof
State after:
no goals