l3lab/ntp-mathlib huggingface dataset:
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case add
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x y : α), e (x + y) = e x + e y

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x y : α), e (x * y) = e x * e y

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case neg
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α), e (-x) = -e x

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case sub
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x y : α), e (x - y) = e x - e y

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case inv
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α), e x⁻¹ = (e x)⁻¹

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case div
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x y : α), e (x / y) = e x / e y

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α) (n : ℕ), e (n • x) = n • e x

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case zsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α) (n : ℤ), e (n • x) = n • e x

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case qsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α) (n : ℚ), e (n • x) = n • e x

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case npow
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α) (n : ℕ), e (x ^ n) = e x ^ n

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case zpow
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (x : α) (n : ℤ), e (x ^ n) = e x ^ n

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case nat_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (n : ℕ), e ↑n = ↑n

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case int_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (n : ℤ), e ↑n = ↑n

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> 

Proof state:
case rat_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ ∀ (n : ℚ), e ↑n = ↑n

Next tactic:
intros
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case zero
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ e 0 = 0

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case one
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
⊢ e 1 = 1

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case add
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ y✝ : α
⊢ e (x✝ + y✝) = e x✝ + e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case mul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ y✝ : α
⊢ e (x✝ * y✝) = e x✝ * e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case neg
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
⊢ e (-x✝) = -e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case sub
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ y✝ : α
⊢ e (x✝ - y✝) = e x✝ - e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case inv
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
⊢ e x✝⁻¹ = (e x✝)⁻¹

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case div
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ y✝ : α
⊢ e (x✝ / y✝) = e x✝ / e y✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case nsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
n✝ : ℕ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case zsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
n✝ : ℤ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case qsmul
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
n✝ : ℚ
⊢ e (n✝ • x✝) = n✝ • e x✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case npow
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
n✝ : ℕ
⊢ e (x✝ ^ n✝) = e x✝ ^ n✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case zpow
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
x✝ : α
n✝ : ℤ
⊢ e (x✝ ^ n✝) = e x✝ ^ n✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case nat_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
n✝ : ℕ
⊢ e ↑n✝ = ↑n✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case int_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
n✝ : ℤ
⊢ e ↑n✝ = ↑n✝

Next tactic:
exact e.apply_symm_apply _
/-- Transfer `Field` across an `Equiv` -/
@[reducible]
protected def field [Field β] : Field α := by
  let add_group_with_one := e.addGroupWithOne
  let neg := e.Neg
  let inv := e.Inv
  let div := e.div
  let mul := e.mul
  let npow := e.pow ℕ
  let zpow := e.pow ℤ
  let rat_cast := e.RatCast
  let qsmul := e.smul ℚ
  apply e.injective.field _ <;> intros <;> 

Proof state:
case rat_cast
α : Type u
β : Type v
e : α ≃ β
inst✝ : Field β
add_group_with_one : AddGroupWithOne α := Equiv.addGroupWithOne e
neg : Neg α := Equiv.Neg e
inv : Inv α := Equiv.Inv e
div : Div α := Equiv.div e
mul : Mul α := Equiv.mul e
npow : Pow α ℕ := Equiv.pow e ℕ
zpow : Pow α ℤ := Equiv.pow e ℤ
rat_cast : RatCast α := Equiv.RatCast e
qsmul : SMul ℚ α := Equiv.smul e ℚ
n✝ : ℚ
⊢ e ↑n✝ = ↑n✝

Next tactic:
exact e.apply_symm_apply _