l3lab/ntp-mathlib huggingface dataset:
/-- Transfer `NonUnitalCommSemiring` across an `Equiv` -/
@[reducible]
protected def nonUnitalCommSemiring [NonUnitalCommSemiring β] : NonUnitalCommSemiring α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let nsmul := e.smul ℕ
  apply e.injective.nonUnitalCommSemiring _ <;> intros <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalCommSemiring β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
nsmul : SMul ℕ α := Equiv.smul e ℕ
x✝ y✝ : α
⊢ e (x✝ * y✝) = e x✝ * e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalCommSemiring` across an `Equiv` -/
@[reducible]
protected def nonUnitalCommSemiring [NonUnitalCommSemiring β] : NonUnitalCommSemiring α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let nsmul := e.smul ℕ
  apply e.injective.nonUnitalCommSemiring _ <;> intros <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalCommSemiring β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
nsmul : SMul ℕ α := Equiv.smul e ℕ
x✝ : α
n✝ : ℕ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
⊢ CommSemiring α

Next tactic:
let mul := e.mul
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
⊢ CommSemiring α

Next tactic:
let add_monoid_with_one := e.addMonoidWithOne
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
⊢ CommSemiring α

Next tactic:
let npow := e.pow ℕ
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ CommSemiring α

Next tactic:
apply e.injective.commSemiring _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case zero
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ e 0 = 0

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case one
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ e 1 = 1

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case add
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ ∀ (x y : α), e (x + y) = e x + e y

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ ∀ (x y : α), e (x * y) = e x * e y

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ ∀ (x : α) (n : ℕ), e (n • x) = n • e x

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case npow
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ ∀ (x : α) (n : ℕ), e (x ^ n) = e x ^ n

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> 

Proof state:
case nat_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ ∀ (n : ℕ), e ↑n = ↑n

Next tactic:
intros
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case zero
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ e 0 = 0

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case one
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
⊢ e 1 = 1

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case add
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
x✝ y✝ : α
⊢ e (x✝ + y✝) = e x✝ + e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
x✝ y✝ : α
⊢ e (x✝ * y✝) = e x✝ * e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
x✝ : α
n✝ : ℕ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case npow
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
x✝ : α
n✝ : ℕ
⊢ e (x✝ ^ n✝) = e x✝ ^ n✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `CommSemiring` across an `Equiv` -/
@[reducible]
protected def commSemiring [CommSemiring β] : CommSemiring α := by
  let mul := e.mul
  let add_monoid_with_one := e.addMonoidWithOne
  let npow := e.pow ℕ
  apply e.injective.commSemiring _ <;> intros <;> 

Proof state:
case nat_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : CommSemiring β
mul : Mul α := Equiv.mul e
add_monoid_with_one : AddMonoidWithOne α := Equiv.addMonoidWithOne e
npow : Pow α ℕ := Equiv.pow e ℕ
n✝ : ℕ
⊢ e ↑n✝ = ↑n✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
⊢ NonUnitalNonAssocRing α

Next tactic:
let zero := e.zero
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
⊢ NonUnitalNonAssocRing α

Next tactic:
let add := e.add
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
⊢ NonUnitalNonAssocRing α

Next tactic:
let mul := e.mul
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
⊢ NonUnitalNonAssocRing α

Next tactic:
let neg := e.Neg
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
⊢ NonUnitalNonAssocRing α

Next tactic:
let sub := e.sub
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
⊢ NonUnitalNonAssocRing α

Next tactic:
let nsmul := e.smul ℕ
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
⊢ NonUnitalNonAssocRing α

Next tactic:
let zsmul := e.smul ℤ
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ NonUnitalNonAssocRing α

Next tactic:
apply e.injective.nonUnitalNonAssocRing _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case zero
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ e 0 = 0

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case add
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ ∀ (x y : α), e (x + y) = e x + e y

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ ∀ (x y : α), e (x * y) = e x * e y

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case neg
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ ∀ (x : α), e (-x) = -e x

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case sub
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ ∀ (x y : α), e (x - y) = e x - e y

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ ∀ (x : α) (n : ℕ), e (n • x) = n • e x

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> 

Proof state:
case zsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ ∀ (x : α) (n : ℤ), e (n • x) = n • e x

Next tactic:
intros
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case zero
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
⊢ e 0 = 0

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case add
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
x✝ y✝ : α
⊢ e (x✝ + y✝) = e x✝ + e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
x✝ y✝ : α
⊢ e (x✝ * y✝) = e x✝ * e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case neg
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
x✝ : α
⊢ e (-x✝) = -e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case sub
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
x✝ y✝ : α
⊢ e (x✝ - y✝) = e x✝ - e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
x✝ : α
n✝ : ℕ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalNonAssocRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalNonAssocRing [NonUnitalNonAssocRing β] : NonUnitalNonAssocRing α := by
  let zero := e.zero
  let add := e.add
  let mul := e.mul
  let neg := e.Neg
  let sub := e.sub
  let nsmul := e.smul ℕ
  let zsmul := e.smul ℤ
  apply e.injective.nonUnitalNonAssocRing _ <;> intros <;> 

Proof state:
case zsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalNonAssocRing β
zero : Zero α := Equiv.zero e
add : Add α := Equiv.add e
mul : Mul α := Equiv.mul e
neg : Neg α := Equiv.Neg e
sub : Sub α := Equiv.sub e
nsmul : SMul ℕ α := Equiv.smul e ℕ
zsmul : SMul ℤ α := Equiv.smul e ℤ
x✝ : α
n✝ : ℤ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `NonUnitalRing` across an `Equiv` -/
@[reducible]
protected def nonUnitalRing [NonUnitalRing β] : NonUnitalRing α := by
  

Proof state:
α : Type u
β : Type v
e : α ≃ β
inst✝ : NonUnitalRing β
⊢ NonUnitalRing α

Next tactic:
let zero := e.zero