lean_workbook_plus_74924

Proved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

If $a,b$ be integers and $n,k$ be positive integers, such that $a\equiv b\pmod{n}$ , then $a^k\equiv b^k\pmod{n}$

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_74924 {a b n : ℤ} (h : a ≡ b [ZMOD n]) (k : ℕ) : a ^ k ≡ b ^ k [ZMOD n]   :=  by sorry

Source