Theorem: Function.Bijective.HVAdd.hVAdd.arg_a1.Bijective_rule_group (SciLean/Core/FunctionPropositions/Bijective.lean)

State before:
X✝ : Type ?u.6453
inst✝⁹ : Nonempty X✝
Y✝ : Type ?u.6459
inst✝⁸ : Nonempty Y✝
Z✝ : Type ?u.6465
inst✝⁷ : Nonempty Z✝
X : Type u_3
inst✝⁶ : Nonempty X
X₁ : Type ?u.6477
inst✝⁵ : Nonempty X₁
X₂ : Type ?u.6483
inst✝⁴ : Nonempty X₂
Y : Type u_2
inst✝³ : Nonempty Y
Z : Type ?u.6495
inst✝² : Nonempty Z
G : Type u_1
inst✝¹ : AddGroup G
inst✝ : AddAction G Y
g : G
f : X → Y
hf : Bijective f
⊢ Bijective fun x => g +ᵥ f x
Tactic:
sorry_proof
State after:
no goals