Hugging Face's logo

Datasets:
l3lab
/
ntp-mathlib

Modalities:
Text
Formats:
json
Size:
100K - 1M
ArXiv:
Tags:
theorem-proving
math
lean
Libraries:
Datasets
pandas
Dataset card Data Studio Files Community
1
ntp-mathlib / Extracted /Mathlib /TacticPrediction /Mathlib_Algebra_Algebra_Pi.jsonl
wellecks's picture
wellecks
Upload folder using huggingface_hub
01d1bb5 verified
raw
history blame
35.1 kB
 {"state":"I : Type u\nR : Type u_1\nf✝ : I β†’ Type v\nx y : (i : I) β†’ f✝ i\ni : I\nr : CommSemiring R\ns : (i : I) β†’ Semiring (f✝ i)\ninst✝ : (i : I) β†’ Algebra R (f✝ i)\nsrc✝ : R β†’+* (i : I) β†’ f✝ i := Pi.ringHom fun i => algebraMap R (f✝ i)\na : R\nf : (i : I) β†’ f✝ i\n⊒ { toMonoidHom := ↑src✝, map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ : βˆ€ (x y : R), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) }\n a *\n f =\n f *\n { toMonoidHom := ↑src✝, map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ : βˆ€ (x y : R), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) }\n a","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ","nextTactic":"ext","declUpToTactic":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.40_0.iEzBlhDeTy24dhL","decl":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) "}
{"state":"case h\nI : Type u\nR : Type u_1\nf✝ : I β†’ Type v\nx y : (i : I) β†’ f✝ i\ni : I\nr : CommSemiring R\ns : (i : I) β†’ Semiring (f✝ i)\ninst✝ : (i : I) β†’ Algebra R (f✝ i)\nsrc✝ : R β†’+* (i : I) β†’ f✝ i := Pi.ringHom fun i => algebraMap R (f✝ i)\na : R\nf : (i : I) β†’ f✝ i\nx✝ : I\n⊒ ({ toMonoidHom := ↑src✝, map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ : βˆ€ (x y : R), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) }\n a *\n f)\n x✝ =\n (f *\n { toMonoidHom := ↑src✝, map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ : βˆ€ (x y : R), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) }\n a)\n x✝","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; ","nextTactic":"simp [Algebra.commutes]","declUpToTactic":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.40_0.iEzBlhDeTy24dhL","decl":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) "}
{"state":"I : Type u\nR : Type u_1\nf✝ : I β†’ Type v\nx y : (i : I) β†’ f✝ i\ni : I\nr : CommSemiring R\ns : (i : I) β†’ Semiring (f✝ i)\ninst✝ : (i : I) β†’ Algebra R (f✝ i)\nsrc✝ : R β†’+* (i : I) β†’ f✝ i := Pi.ringHom fun i => algebraMap R (f✝ i)\na : R\nf : (i : I) β†’ f✝ i\n⊒ a β€’ f =\n { toMonoidHom := ↑src✝, map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ : βˆ€ (x y : R), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) }\n a *\n f","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ","nextTactic":"ext","declUpToTactic":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.40_0.iEzBlhDeTy24dhL","decl":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) "}
{"state":"case h\nI : Type u\nR : Type u_1\nf✝ : I β†’ Type v\nx y : (i : I) β†’ f✝ i\ni : I\nr : CommSemiring R\ns : (i : I) β†’ Semiring (f✝ i)\ninst✝ : (i : I) β†’ Algebra R (f✝ i)\nsrc✝ : R β†’+* (i : I) β†’ f✝ i := Pi.ringHom fun i => algebraMap R (f✝ i)\na : R\nf : (i : I) β†’ f✝ i\nx✝ : I\n⊒ (a β€’ f) x✝ =\n ({ toMonoidHom := ↑src✝, map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ : βˆ€ (x y : R), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) }\n a *\n f)\n x✝","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ext; ","nextTactic":"simp [Algebra.smul_def]","declUpToTactic":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ext; ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.40_0.iEzBlhDeTy24dhL","decl":"instance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) "}
{"state":"R : Type u\nA : Type v\nB : Type w\nI✝ : Type u_1\ninst✝⁴ : CommSemiring R\ninst✝³ : Semiring A\ninst✝² : Semiring B\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\nf : A →ₐ[R] B\nI : Type u_2\nsrc✝ : (I β†’ A) β†’+* I β†’ B := RingHom.compLeft (↑f) I\nc : R\n⊒ OneHom.toFun\n (↑↑{\n toMonoidHom :=\n { toOneHom := { toFun := fun h => ⇑f ∘ h, map_one' := (_ : OneHom.toFun (↑↑src✝) 1 = 1) },\n map_mul' :=\n (_ :\n βˆ€ (x y : I β†’ A),\n OneHom.toFun (↑↑src✝) (x * y) = OneHom.toFun (↑↑src✝) x * OneHom.toFun (↑↑src✝) y) },\n map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ :\n βˆ€ (x y : I β†’ A), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) })\n ((algebraMap R (I β†’ A)) c) =\n (algebraMap R (I β†’ B)) c","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ext; simp [Algebra.smul_def] }\n#align pi.algebra Pi.algebra\n\ntheorem algebraMap_def {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) : algebraMap R (βˆ€ i, f i) a = fun i => algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_def Pi.algebraMap_def\n\n@[simp]\ntheorem algebraMap_apply {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) (i : I) : algebraMap R (βˆ€ i, f i) a i = algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_apply Pi.algebraMap_apply\n\n-- One could also build a `βˆ€ i, R i`-algebra structure on `βˆ€ i, A i`,\n-- when each `A i` is an `R i`-algebra, although I'm not sure that it's useful.\nvariable {I} (R)\n\n/-- `Function.eval` as an `AlgHom`. The name matches `Pi.evalRingHom`, `Pi.evalMonoidHom`,\netc. -/\n@[simps]\ndef evalAlgHom {_ : CommSemiring R} [βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] (i : I) :\n (βˆ€ i, f i) →ₐ[R] f i :=\n { Pi.evalRingHom f i with\n toFun := fun f => f i\n commutes' := fun _ => rfl }\n#align pi.eval_alg_hom Pi.evalAlgHom\n\nvariable (A B : Type*) [CommSemiring R] [Semiring B] [Algebra R B]\n\n/-- `Function.const` as an `AlgHom`. The name matches `Pi.constRingHom`, `Pi.constMonoidHom`,\netc. -/\n@[simps]\ndef constAlgHom : B →ₐ[R] A β†’ B :=\n { Pi.constRingHom A B with\n toFun := Function.const _\n commutes' := fun _ => rfl }\n#align pi.const_alg_hom Pi.constAlgHom\n\n/-- When `R` is commutative and permits an `algebraMap`, `Pi.constRingHom` is equal to that\nmap. -/\n@[simp]\ntheorem constRingHom_eq_algebraMap : constRingHom A R = algebraMap R (A β†’ R) :=\n rfl\n#align pi.const_ring_hom_eq_algebra_map Pi.constRingHom_eq_algebraMap\n\n@[simp]\ntheorem constAlgHom_eq_algebra_ofId : constAlgHom R A R = Algebra.ofId R (A β†’ R) :=\n rfl\n#align pi.const_alg_hom_eq_algebra_of_id Pi.constAlgHom_eq_algebra_ofId\n\nend Pi\n\n/-- A special case of `Pi.algebra` for non-dependent types. Lean struggles to elaborate\ndefinitions elsewhere in the library without this, -/\ninstance Function.algebra {R : Type*} (I : Type*) (A : Type*) [CommSemiring R] [Semiring A]\n [Algebra R A] : Algebra R (I β†’ A) :=\n Pi.algebra _ _\n#align function.algebra Function.algebra\n\nnamespace AlgHom\n\nvariable {R : Type u} {A : Type v} {B : Type w} {I : Type*}\n\nvariable [CommSemiring R] [Semiring A] [Semiring B]\n\nvariable [Algebra R A] [Algebra R B]\n\n/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B :=\n { f.toRingHom.compLeft I with\n toFun := fun h => f ∘ h\n commutes' := fun c => by\n ","nextTactic":"ext","declUpToTactic":"/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B :=\n { f.toRingHom.compLeft I with\n toFun := fun h => f ∘ h\n commutes' := fun c => by\n ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.112_0.iEzBlhDeTy24dhL","decl":"/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B "}
{"state":"case h\nR : Type u\nA : Type v\nB : Type w\nI✝ : Type u_1\ninst✝⁴ : CommSemiring R\ninst✝³ : Semiring A\ninst✝² : Semiring B\ninst✝¹ : Algebra R A\ninst✝ : Algebra R B\nf : A →ₐ[R] B\nI : Type u_2\nsrc✝ : (I β†’ A) β†’+* I β†’ B := RingHom.compLeft (↑f) I\nc : R\nx✝ : I\n⊒ OneHom.toFun\n (↑↑{\n toMonoidHom :=\n { toOneHom := { toFun := fun h => ⇑f ∘ h, map_one' := (_ : OneHom.toFun (↑↑src✝) 1 = 1) },\n map_mul' :=\n (_ :\n βˆ€ (x y : I β†’ A),\n OneHom.toFun (↑↑src✝) (x * y) = OneHom.toFun (↑↑src✝) x * OneHom.toFun (↑↑src✝) y) },\n map_zero' := (_ : OneHom.toFun (↑↑src✝) 0 = 0),\n map_add' :=\n (_ :\n βˆ€ (x y : I β†’ A), OneHom.toFun (↑↑src✝) (x + y) = OneHom.toFun (↑↑src✝) x + OneHom.toFun (↑↑src✝) y) })\n ((algebraMap R (I β†’ A)) c) x✝ =\n (algebraMap R (I β†’ B)) c x✝","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ext; simp [Algebra.smul_def] }\n#align pi.algebra Pi.algebra\n\ntheorem algebraMap_def {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) : algebraMap R (βˆ€ i, f i) a = fun i => algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_def Pi.algebraMap_def\n\n@[simp]\ntheorem algebraMap_apply {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) (i : I) : algebraMap R (βˆ€ i, f i) a i = algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_apply Pi.algebraMap_apply\n\n-- One could also build a `βˆ€ i, R i`-algebra structure on `βˆ€ i, A i`,\n-- when each `A i` is an `R i`-algebra, although I'm not sure that it's useful.\nvariable {I} (R)\n\n/-- `Function.eval` as an `AlgHom`. The name matches `Pi.evalRingHom`, `Pi.evalMonoidHom`,\netc. -/\n@[simps]\ndef evalAlgHom {_ : CommSemiring R} [βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] (i : I) :\n (βˆ€ i, f i) →ₐ[R] f i :=\n { Pi.evalRingHom f i with\n toFun := fun f => f i\n commutes' := fun _ => rfl }\n#align pi.eval_alg_hom Pi.evalAlgHom\n\nvariable (A B : Type*) [CommSemiring R] [Semiring B] [Algebra R B]\n\n/-- `Function.const` as an `AlgHom`. The name matches `Pi.constRingHom`, `Pi.constMonoidHom`,\netc. -/\n@[simps]\ndef constAlgHom : B →ₐ[R] A β†’ B :=\n { Pi.constRingHom A B with\n toFun := Function.const _\n commutes' := fun _ => rfl }\n#align pi.const_alg_hom Pi.constAlgHom\n\n/-- When `R` is commutative and permits an `algebraMap`, `Pi.constRingHom` is equal to that\nmap. -/\n@[simp]\ntheorem constRingHom_eq_algebraMap : constRingHom A R = algebraMap R (A β†’ R) :=\n rfl\n#align pi.const_ring_hom_eq_algebra_map Pi.constRingHom_eq_algebraMap\n\n@[simp]\ntheorem constAlgHom_eq_algebra_ofId : constAlgHom R A R = Algebra.ofId R (A β†’ R) :=\n rfl\n#align pi.const_alg_hom_eq_algebra_of_id Pi.constAlgHom_eq_algebra_ofId\n\nend Pi\n\n/-- A special case of `Pi.algebra` for non-dependent types. Lean struggles to elaborate\ndefinitions elsewhere in the library without this, -/\ninstance Function.algebra {R : Type*} (I : Type*) (A : Type*) [CommSemiring R] [Semiring A]\n [Algebra R A] : Algebra R (I β†’ A) :=\n Pi.algebra _ _\n#align function.algebra Function.algebra\n\nnamespace AlgHom\n\nvariable {R : Type u} {A : Type v} {B : Type w} {I : Type*}\n\nvariable [CommSemiring R] [Semiring A] [Semiring B]\n\nvariable [Algebra R A] [Algebra R B]\n\n/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B :=\n { f.toRingHom.compLeft I with\n toFun := fun h => f ∘ h\n commutes' := fun c => by\n ext\n ","nextTactic":"exact f.commutes' c","declUpToTactic":"/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B :=\n { f.toRingHom.compLeft I with\n toFun := fun h => f ∘ h\n commutes' := fun c => by\n ext\n ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.112_0.iEzBlhDeTy24dhL","decl":"/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B "}
{"state":"R : Type u_1\nΞΉ : Type u_2\nA₁ : ΞΉ β†’ Type u_3\nAβ‚‚ : ΞΉ β†’ Type u_4\ninst✝⁴ : CommSemiring R\ninst✝³ : (i : ΞΉ) β†’ Semiring (A₁ i)\ninst✝² : (i : ΞΉ) β†’ Semiring (Aβ‚‚ i)\ninst✝¹ : (i : ΞΉ) β†’ Algebra R (A₁ i)\ninst✝ : (i : ΞΉ) β†’ Algebra R (Aβ‚‚ i)\ne : (i : ΞΉ) β†’ A₁ i ≃ₐ[R] Aβ‚‚ i\nsrc✝ : ((i : ΞΉ) β†’ A₁ i) ≃+* ((i : ΞΉ) β†’ Aβ‚‚ i) := RingEquiv.piCongrRight fun i => toRingEquiv (e i)\nr : R\n⊒ Equiv.toFun\n { toFun := fun x j => (e j) (x j), invFun := fun x j => (symm (e j)) (x j),\n left_inv := (_ : Function.LeftInverse src✝.invFun src✝.toFun),\n right_inv := (_ : Function.RightInverse src✝.invFun src✝.toFun) }\n ((algebraMap R ((i : ΞΉ) β†’ A₁ i)) r) =\n (algebraMap R ((i : ΞΉ) β†’ Aβ‚‚ i)) r","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ext; simp [Algebra.smul_def] }\n#align pi.algebra Pi.algebra\n\ntheorem algebraMap_def {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) : algebraMap R (βˆ€ i, f i) a = fun i => algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_def Pi.algebraMap_def\n\n@[simp]\ntheorem algebraMap_apply {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) (i : I) : algebraMap R (βˆ€ i, f i) a i = algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_apply Pi.algebraMap_apply\n\n-- One could also build a `βˆ€ i, R i`-algebra structure on `βˆ€ i, A i`,\n-- when each `A i` is an `R i`-algebra, although I'm not sure that it's useful.\nvariable {I} (R)\n\n/-- `Function.eval` as an `AlgHom`. The name matches `Pi.evalRingHom`, `Pi.evalMonoidHom`,\netc. -/\n@[simps]\ndef evalAlgHom {_ : CommSemiring R} [βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] (i : I) :\n (βˆ€ i, f i) →ₐ[R] f i :=\n { Pi.evalRingHom f i with\n toFun := fun f => f i\n commutes' := fun _ => rfl }\n#align pi.eval_alg_hom Pi.evalAlgHom\n\nvariable (A B : Type*) [CommSemiring R] [Semiring B] [Algebra R B]\n\n/-- `Function.const` as an `AlgHom`. The name matches `Pi.constRingHom`, `Pi.constMonoidHom`,\netc. -/\n@[simps]\ndef constAlgHom : B →ₐ[R] A β†’ B :=\n { Pi.constRingHom A B with\n toFun := Function.const _\n commutes' := fun _ => rfl }\n#align pi.const_alg_hom Pi.constAlgHom\n\n/-- When `R` is commutative and permits an `algebraMap`, `Pi.constRingHom` is equal to that\nmap. -/\n@[simp]\ntheorem constRingHom_eq_algebraMap : constRingHom A R = algebraMap R (A β†’ R) :=\n rfl\n#align pi.const_ring_hom_eq_algebra_map Pi.constRingHom_eq_algebraMap\n\n@[simp]\ntheorem constAlgHom_eq_algebra_ofId : constAlgHom R A R = Algebra.ofId R (A β†’ R) :=\n rfl\n#align pi.const_alg_hom_eq_algebra_of_id Pi.constAlgHom_eq_algebra_ofId\n\nend Pi\n\n/-- A special case of `Pi.algebra` for non-dependent types. Lean struggles to elaborate\ndefinitions elsewhere in the library without this, -/\ninstance Function.algebra {R : Type*} (I : Type*) (A : Type*) [CommSemiring R] [Semiring A]\n [Algebra R A] : Algebra R (I β†’ A) :=\n Pi.algebra _ _\n#align function.algebra Function.algebra\n\nnamespace AlgHom\n\nvariable {R : Type u} {A : Type v} {B : Type w} {I : Type*}\n\nvariable [CommSemiring R] [Semiring A] [Semiring B]\n\nvariable [Algebra R A] [Algebra R B]\n\n/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B :=\n { f.toRingHom.compLeft I with\n toFun := fun h => f ∘ h\n commutes' := fun c => by\n ext\n exact f.commutes' c }\n#align alg_hom.comp_left AlgHom.compLeft\n\nend AlgHom\n\nnamespace AlgEquiv\n\n/-- A family of algebra equivalences `βˆ€ i, (A₁ i ≃ₐ Aβ‚‚ i)` generates a\nmultiplicative equivalence between `βˆ€ i, A₁ i` and `βˆ€ i, Aβ‚‚ i`.\n\nThis is the `AlgEquiv` version of `Equiv.piCongrRight`, and the dependent version of\n`AlgEquiv.arrowCongr`.\n-/\n@[simps apply]\ndef piCongrRight {R ΞΉ : Type*} {A₁ Aβ‚‚ : ΞΉ β†’ Type*} [CommSemiring R] [βˆ€ i, Semiring (A₁ i)]\n [βˆ€ i, Semiring (Aβ‚‚ i)] [βˆ€ i, Algebra R (A₁ i)] [βˆ€ i, Algebra R (Aβ‚‚ i)]\n (e : βˆ€ i, A₁ i ≃ₐ[R] Aβ‚‚ i) : (βˆ€ i, A₁ i) ≃ₐ[R] βˆ€ i, Aβ‚‚ i :=\n { @RingEquiv.piCongrRight ΞΉ A₁ Aβ‚‚ _ _ fun i => (e i).toRingEquiv with\n toFun := fun x j => e j (x j)\n invFun := fun x j => (e j).symm (x j)\n commutes' := fun r => by\n ","nextTactic":"ext i","declUpToTactic":"/-- A family of algebra equivalences `βˆ€ i, (A₁ i ≃ₐ Aβ‚‚ i)` generates a\nmultiplicative equivalence between `βˆ€ i, A₁ i` and `βˆ€ i, Aβ‚‚ i`.\n\nThis is the `AlgEquiv` version of `Equiv.piCongrRight`, and the dependent version of\n`AlgEquiv.arrowCongr`.\n-/\n@[simps apply]\ndef piCongrRight {R ΞΉ : Type*} {A₁ Aβ‚‚ : ΞΉ β†’ Type*} [CommSemiring R] [βˆ€ i, Semiring (A₁ i)]\n [βˆ€ i, Semiring (Aβ‚‚ i)] [βˆ€ i, Algebra R (A₁ i)] [βˆ€ i, Algebra R (Aβ‚‚ i)]\n (e : βˆ€ i, A₁ i ≃ₐ[R] Aβ‚‚ i) : (βˆ€ i, A₁ i) ≃ₐ[R] βˆ€ i, Aβ‚‚ i :=\n { @RingEquiv.piCongrRight ΞΉ A₁ Aβ‚‚ _ _ fun i => (e i).toRingEquiv with\n toFun := fun x j => e j (x j)\n invFun := fun x j => (e j).symm (x j)\n commutes' := fun r => by\n ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.127_0.iEzBlhDeTy24dhL","decl":"/-- A family of algebra equivalences `βˆ€ i, (A₁ i ≃ₐ Aβ‚‚ i)` generates a\nmultiplicative equivalence between `βˆ€ i, A₁ i` and `βˆ€ i, Aβ‚‚ i`.\n\nThis is the `AlgEquiv` version of `Equiv.piCongrRight`, and the dependent version of\n`AlgEquiv.arrowCongr`.\n-/\n@[simps apply]\ndef piCongrRight {R ΞΉ : Type*} {A₁ Aβ‚‚ : ΞΉ β†’ Type*} [CommSemiring R] [βˆ€ i, Semiring (A₁ i)]\n [βˆ€ i, Semiring (Aβ‚‚ i)] [βˆ€ i, Algebra R (A₁ i)] [βˆ€ i, Algebra R (Aβ‚‚ i)]\n (e : βˆ€ i, A₁ i ≃ₐ[R] Aβ‚‚ i) : (βˆ€ i, A₁ i) ≃ₐ[R] βˆ€ i, Aβ‚‚ i "}
{"state":"case h\nR : Type u_1\nΞΉ : Type u_2\nA₁ : ΞΉ β†’ Type u_3\nAβ‚‚ : ΞΉ β†’ Type u_4\ninst✝⁴ : CommSemiring R\ninst✝³ : (i : ΞΉ) β†’ Semiring (A₁ i)\ninst✝² : (i : ΞΉ) β†’ Semiring (Aβ‚‚ i)\ninst✝¹ : (i : ΞΉ) β†’ Algebra R (A₁ i)\ninst✝ : (i : ΞΉ) β†’ Algebra R (Aβ‚‚ i)\ne : (i : ΞΉ) β†’ A₁ i ≃ₐ[R] Aβ‚‚ i\nsrc✝ : ((i : ΞΉ) β†’ A₁ i) ≃+* ((i : ΞΉ) β†’ Aβ‚‚ i) := RingEquiv.piCongrRight fun i => toRingEquiv (e i)\nr : R\ni : ΞΉ\n⊒ Equiv.toFun\n { toFun := fun x j => (e j) (x j), invFun := fun x j => (symm (e j)) (x j),\n left_inv := (_ : Function.LeftInverse src✝.invFun src✝.toFun),\n right_inv := (_ : Function.RightInverse src✝.invFun src✝.toFun) }\n ((algebraMap R ((i : ΞΉ) β†’ A₁ i)) r) i =\n (algebraMap R ((i : ΞΉ) β†’ Aβ‚‚ i)) r i","srcUpToTactic":"/-\nCopyright (c) 2018 Kenny Lau. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthors: Kenny Lau, Yury Kudryashov\n-/\nimport Mathlib.Algebra.Algebra.Equiv\n\n#align_import algebra.algebra.pi from \"leanprover-community/mathlib\"@\"b16045e4bf61c6fd619a1a68854ab3d605dcd017\"\n\n/-!\n# The R-algebra structure on families of R-algebras\n\nThe R-algebra structure on `βˆ€ i : I, A i` when each `A i` is an R-algebra.\n\n## Main definitions\n\n* `Pi.algebra`\n* `Pi.evalAlgHom`\n* `Pi.constAlgHom`\n-/\n\n\nuniverse u v w\n\nnamespace Pi\n\n-- The indexing type\nvariable {I : Type u}\n\n-- The scalar type\nvariable {R : Type*}\n\n-- The family of types already equipped with instances\nvariable {f : I β†’ Type v}\n\nvariable (x y : βˆ€ i, f i) (i : I)\n\nvariable (I f)\n\ninstance algebra {r : CommSemiring R} [s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] :\n Algebra R (βˆ€ i : I, f i) :=\n { (Pi.ringHom fun i => algebraMap R (f i) : R β†’+* βˆ€ i : I, f i) with\n commutes' := fun a f => by ext; simp [Algebra.commutes]\n smul_def' := fun a f => by ext; simp [Algebra.smul_def] }\n#align pi.algebra Pi.algebra\n\ntheorem algebraMap_def {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) : algebraMap R (βˆ€ i, f i) a = fun i => algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_def Pi.algebraMap_def\n\n@[simp]\ntheorem algebraMap_apply {_ : CommSemiring R} [_s : βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)]\n (a : R) (i : I) : algebraMap R (βˆ€ i, f i) a i = algebraMap R (f i) a :=\n rfl\n#align pi.algebra_map_apply Pi.algebraMap_apply\n\n-- One could also build a `βˆ€ i, R i`-algebra structure on `βˆ€ i, A i`,\n-- when each `A i` is an `R i`-algebra, although I'm not sure that it's useful.\nvariable {I} (R)\n\n/-- `Function.eval` as an `AlgHom`. The name matches `Pi.evalRingHom`, `Pi.evalMonoidHom`,\netc. -/\n@[simps]\ndef evalAlgHom {_ : CommSemiring R} [βˆ€ i, Semiring (f i)] [βˆ€ i, Algebra R (f i)] (i : I) :\n (βˆ€ i, f i) →ₐ[R] f i :=\n { Pi.evalRingHom f i with\n toFun := fun f => f i\n commutes' := fun _ => rfl }\n#align pi.eval_alg_hom Pi.evalAlgHom\n\nvariable (A B : Type*) [CommSemiring R] [Semiring B] [Algebra R B]\n\n/-- `Function.const` as an `AlgHom`. The name matches `Pi.constRingHom`, `Pi.constMonoidHom`,\netc. -/\n@[simps]\ndef constAlgHom : B →ₐ[R] A β†’ B :=\n { Pi.constRingHom A B with\n toFun := Function.const _\n commutes' := fun _ => rfl }\n#align pi.const_alg_hom Pi.constAlgHom\n\n/-- When `R` is commutative and permits an `algebraMap`, `Pi.constRingHom` is equal to that\nmap. -/\n@[simp]\ntheorem constRingHom_eq_algebraMap : constRingHom A R = algebraMap R (A β†’ R) :=\n rfl\n#align pi.const_ring_hom_eq_algebra_map Pi.constRingHom_eq_algebraMap\n\n@[simp]\ntheorem constAlgHom_eq_algebra_ofId : constAlgHom R A R = Algebra.ofId R (A β†’ R) :=\n rfl\n#align pi.const_alg_hom_eq_algebra_of_id Pi.constAlgHom_eq_algebra_ofId\n\nend Pi\n\n/-- A special case of `Pi.algebra` for non-dependent types. Lean struggles to elaborate\ndefinitions elsewhere in the library without this, -/\ninstance Function.algebra {R : Type*} (I : Type*) (A : Type*) [CommSemiring R] [Semiring A]\n [Algebra R A] : Algebra R (I β†’ A) :=\n Pi.algebra _ _\n#align function.algebra Function.algebra\n\nnamespace AlgHom\n\nvariable {R : Type u} {A : Type v} {B : Type w} {I : Type*}\n\nvariable [CommSemiring R] [Semiring A] [Semiring B]\n\nvariable [Algebra R A] [Algebra R B]\n\n/-- `R`-algebra homomorphism between the function spaces `I β†’ A` and `I β†’ B`, induced by an\n`R`-algebra homomorphism `f` between `A` and `B`. -/\n@[simps]\nprotected def compLeft (f : A →ₐ[R] B) (I : Type*) : (I β†’ A) →ₐ[R] I β†’ B :=\n { f.toRingHom.compLeft I with\n toFun := fun h => f ∘ h\n commutes' := fun c => by\n ext\n exact f.commutes' c }\n#align alg_hom.comp_left AlgHom.compLeft\n\nend AlgHom\n\nnamespace AlgEquiv\n\n/-- A family of algebra equivalences `βˆ€ i, (A₁ i ≃ₐ Aβ‚‚ i)` generates a\nmultiplicative equivalence between `βˆ€ i, A₁ i` and `βˆ€ i, Aβ‚‚ i`.\n\nThis is the `AlgEquiv` version of `Equiv.piCongrRight`, and the dependent version of\n`AlgEquiv.arrowCongr`.\n-/\n@[simps apply]\ndef piCongrRight {R ΞΉ : Type*} {A₁ Aβ‚‚ : ΞΉ β†’ Type*} [CommSemiring R] [βˆ€ i, Semiring (A₁ i)]\n [βˆ€ i, Semiring (Aβ‚‚ i)] [βˆ€ i, Algebra R (A₁ i)] [βˆ€ i, Algebra R (Aβ‚‚ i)]\n (e : βˆ€ i, A₁ i ≃ₐ[R] Aβ‚‚ i) : (βˆ€ i, A₁ i) ≃ₐ[R] βˆ€ i, Aβ‚‚ i :=\n { @RingEquiv.piCongrRight ΞΉ A₁ Aβ‚‚ _ _ fun i => (e i).toRingEquiv with\n toFun := fun x j => e j (x j)\n invFun := fun x j => (e j).symm (x j)\n commutes' := fun r => by\n ext i\n ","nextTactic":"simp","declUpToTactic":"/-- A family of algebra equivalences `βˆ€ i, (A₁ i ≃ₐ Aβ‚‚ i)` generates a\nmultiplicative equivalence between `βˆ€ i, A₁ i` and `βˆ€ i, Aβ‚‚ i`.\n\nThis is the `AlgEquiv` version of `Equiv.piCongrRight`, and the dependent version of\n`AlgEquiv.arrowCongr`.\n-/\n@[simps apply]\ndef piCongrRight {R ΞΉ : Type*} {A₁ Aβ‚‚ : ΞΉ β†’ Type*} [CommSemiring R] [βˆ€ i, Semiring (A₁ i)]\n [βˆ€ i, Semiring (Aβ‚‚ i)] [βˆ€ i, Algebra R (A₁ i)] [βˆ€ i, Algebra R (Aβ‚‚ i)]\n (e : βˆ€ i, A₁ i ≃ₐ[R] Aβ‚‚ i) : (βˆ€ i, A₁ i) ≃ₐ[R] βˆ€ i, Aβ‚‚ i :=\n { @RingEquiv.piCongrRight ΞΉ A₁ Aβ‚‚ _ _ fun i => (e i).toRingEquiv with\n toFun := fun x j => e j (x j)\n invFun := fun x j => (e j).symm (x j)\n commutes' := fun r => by\n ext i\n ","declId":"Examples.Mathlib.SplitRw.Mathlib_Algebra_Algebra_Pi.127_0.iEzBlhDeTy24dhL","decl":"/-- A family of algebra equivalences `βˆ€ i, (A₁ i ≃ₐ Aβ‚‚ i)` generates a\nmultiplicative equivalence between `βˆ€ i, A₁ i` and `βˆ€ i, Aβ‚‚ i`.\n\nThis is the `AlgEquiv` version of `Equiv.piCongrRight`, and the dependent version of\n`AlgEquiv.arrowCongr`.\n-/\n@[simps apply]\ndef piCongrRight {R ΞΉ : Type*} {A₁ Aβ‚‚ : ΞΉ β†’ Type*} [CommSemiring R] [βˆ€ i, Semiring (A₁ i)]\n [βˆ€ i, Semiring (Aβ‚‚ i)] [βˆ€ i, Algebra R (A₁ i)] [βˆ€ i, Algebra R (Aβ‚‚ i)]\n (e : βˆ€ i, A₁ i ≃ₐ[R] Aβ‚‚ i) : (βˆ€ i, A₁ i) ≃ₐ[R] βˆ€ i, Aβ‚‚ i "}