Theorem: Function.Bijective.HAdd.hAdd.arg_a1.Bijective_rule (SciLean/Core/FunctionPropositions/Bijective.lean)

State before:
X✝ : Type ?u.2144
inst✝⁸ : Nonempty X✝
Y✝ : Type ?u.2150
inst✝⁷ : Nonempty Y✝
Z✝ : Type ?u.2156
inst✝⁶ : Nonempty Z✝
X : Type u_2
inst✝⁵ : Nonempty X
X₁ : Type ?u.2168
inst✝⁴ : Nonempty X₁
X₂ : Type ?u.2174
inst✝³ : Nonempty X₂
Y : Type u_1
inst✝² : Nonempty Y
Z : Type ?u.2186
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