norm_num plugin for ^.

theorem Mathlib.Meta.NormNum.natPow_zero {a : ℕ} : a.pow 0 = 1

theorem Mathlib.Meta.NormNum.natPow_one {a : ℕ} : a.pow 1 = a

theorem Mathlib.Meta.NormNum.zero_natPow {b : ℕ} : Nat.pow 0 b.succ = 0

theorem Mathlib.Meta.NormNum.one_natPow {b : ℕ} : Nat.pow 1 b = 1

structure Mathlib.Meta.NormNum.IsNatPowT (p : Prop) (a : ℕ) (b : ℕ) (c : ℕ) : Prop

This is an opaque wrapper around Nat.pow to prevent lean from unfolding the definition of Nat.pow on numerals. The arbitrary precondition p is actually a formula of the form Nat.pow a' b' = c' but we usually don't care to unfold this proposition so we just carry a reference to it.

• run' : p → a.pow b = c

  Unfolds the assertion.

theorem Mathlib.Meta.NormNum.IsNatPowT.run' {p : Prop} {a : ℕ} {b : ℕ} {c : ℕ} (self : Mathlib.Meta.NormNum.IsNatPowT p a b c) : p → a.pow b = c

Unfolds the assertion.

theorem Mathlib.Meta.NormNum.IsNatPowT.run {a : ℕ} {b : ℕ} {c : ℕ} (p : Mathlib.Meta.NormNum.IsNatPowT (a.pow 1 = a) a b c) : a.pow b = c

theorem Mathlib.Meta.NormNum.IsNatPowT.trans {a : ℕ} {b : ℕ} {c : ℕ} {p : Prop} {b' : ℕ} {c' : ℕ} (h1 : Mathlib.Meta.NormNum.IsNatPowT p a b c) (h2 : Mathlib.Meta.NormNum.IsNatPowT (a.pow b = c) a b' c') : Mathlib.Meta.NormNum.IsNatPowT p a b' c'

This is the key to making the proof proceed as a balanced tree of applications instead of a linear sequence. It is just modus ponens after unwrapping the definitions.

theorem Mathlib.Meta.NormNum.IsNatPowT.bit0 {a : ℕ} {b : ℕ} {c : ℕ} : Mathlib.Meta.NormNum.IsNatPowT (a.pow b = c) a (2 * b) (c.mul c)

theorem Mathlib.Meta.NormNum.IsNatPowT.bit1 {a : ℕ} {b : ℕ} {c : ℕ} : Mathlib.Meta.NormNum.IsNatPowT (a.pow b = c) a (2 * b + 1) (c.mul (c.mul a))

def Mathlib.Meta.NormNum.evalNatPow (a : Q(ℕ)) (b : Q(ℕ)) : (c : Q(ℕ)) × Q(«$a».pow «$b» = «$c»)

Proves Nat.pow a b = c where a and b are raw nat literals. This could be done by just rfl but the kernel does not have a special case implementation for Nat.pow so this would proceed by unary recursion on b, which is too slow and also leads to deep recursion.

We instead do the proof by binary recursion, but this can still lead to deep recursion, so we use an additional trick to do binary subdivision on log2 b. As a result this produces a proof of depth log (log b) which will essentially never overflow before the numbers involved themselves exceed memory limits.

Equations

• One or more equations did not get rendered due to their size.

partial def Mathlib.Meta.NormNum.evalNatPow.go (depth : ℕ) (a : Q(ℕ)) (b₀ : Q(ℕ)) (c₀ : Q(ℕ)) (b : Q(ℕ)) (p : Q(Prop)) (hp : «$p» =Q («$a».pow «$b₀» = «$c₀»)) : (c : Q(ℕ)) × Q(Mathlib.Meta.NormNum.IsNatPowT «$p» «$a» «$b» «$c»)

Invariants: a ^ b₀ = c₀, depth > 0, b >>> depth = b₀, p := Nat.pow $a $b₀ = $c₀

theorem Mathlib.Meta.NormNum.intPow_ofNat {a : ℕ} {b : ℕ} {c : ℕ} (h1 : a.pow b = c) : (Int.ofNat a).pow b = Int.ofNat c

theorem Mathlib.Meta.NormNum.intPow_negOfNat_bit0 {a : ℕ} {b : ℕ} {c : ℕ} {b' : ℕ} {c' : ℕ} (h1 : a.pow b' = c') (hb : 2 * b' = b) (hc : c' * c' = c) : (Int.negOfNat a).pow b = Int.ofNat c

theorem Mathlib.Meta.NormNum.intPow_negOfNat_bit1 {a : ℕ} {b : ℕ} {c : ℕ} {b' : ℕ} {c' : ℕ} (h1 : a.pow b' = c') (hb : 2 * b' + 1 = b) (hc : c' * (c' * a) = c) : (Int.negOfNat a).pow b = Int.negOfNat c

def Mathlib.Meta.NormNum.evalIntPow (za : ℤ) (a : Q(ℤ)) (b : Q(ℕ)) : ℤ × (c : Q(ℤ)) × Q(«$a».pow «$b» = «$c»)

Evaluates Int.pow a b = c where a and b are raw integer literals.

theorem Mathlib.Meta.NormNum.isNat_pow {α : Type u_1} [Semiring α] {f : α → ℕ → α} {a : α} {b : ℕ} {a' : ℕ} {b' : ℕ} {c : ℕ} : f = HPow.hPow → Mathlib.Meta.NormNum.IsNat a a' → Mathlib.Meta.NormNum.IsNat b b' → a'.pow b' = c → Mathlib.Meta.NormNum.IsNat (f a b) c

theorem Mathlib.Meta.NormNum.isInt_pow {α : Type u_1} [Ring α] {f : α → ℕ → α} {a : α} {b : ℕ} {a' : ℤ} {b' : ℕ} {c : ℤ} : f = HPow.hPow → Mathlib.Meta.NormNum.IsInt a a' → Mathlib.Meta.NormNum.IsNat b b' → a'.pow b' = c → Mathlib.Meta.NormNum.IsInt (f a b) c

theorem Mathlib.Meta.NormNum.isRat_pow {α : Type u_1} [Ring α] {f : α → ℕ → α} {a : α} {an : ℤ} {cn : ℤ} {ad : ℕ} {b : ℕ} {b' : ℕ} {cd : ℕ} : f = HPow.hPow → Mathlib.Meta.NormNum.IsRat a an ad → Mathlib.Meta.NormNum.IsNat b b' → an.pow b' = cn → ad.pow b' = cd → Mathlib.Meta.NormNum.IsRat (f a b) cn cd

def Mathlib.Meta.NormNum.evalPow : Mathlib.Meta.NormNum.NormNumExt

The norm_num extension which identifies expressions of the form a ^ b, such that norm_num successfully recognises both a and b, with b : ℕ.

Equations

• One or more equations did not get rendered due to their size.

def Mathlib.Meta.NormNum.evalPow.core {u : Lean.Level} {α : Q(Type u)} (e : Q(«$α»)) (f : Q(«$α» → ℕ → «$α»)) (a : Q(«$α»)) (b : Q(ℕ)) (nb : Q(ℕ)) (pb : Q(Mathlib.Meta.NormNum.IsNat «$b» «$nb»)) (sα : Q(Semiring «$α»)) (ra : Mathlib.Meta.NormNum.Result a) : Option (Mathlib.Meta.NormNum.Result e)

Main part of evalPow.

Equations

• One or more equations did not get rendered due to their size.
• Mathlib.Meta.NormNum.evalPow.core e f a b nb pb sα (Mathlib.Meta.NormNum.Result'.isBool val proof) = failure

theorem Mathlib.Meta.NormNum.isNat_zpow_pos {α : Type u_1} [DivisionSemiring α] {a : α} {b : ℤ} {nb : ℕ} {ne : ℕ} (pb : Mathlib.Meta.NormNum.IsNat b nb) (pe' : Mathlib.Meta.NormNum.IsNat (a ^ nb) ne) : Mathlib.Meta.NormNum.IsNat (a ^ b) ne

theorem Mathlib.Meta.NormNum.isNat_zpow_neg {α : Type u_1} [DivisionSemiring α] {a : α} {b : ℤ} {nb : ℕ} {ne : ℕ} (pb : Mathlib.Meta.NormNum.IsInt b (Int.negOfNat nb)) (pe' : Mathlib.Meta.NormNum.IsNat (a ^ nb)⁻¹ ne) : Mathlib.Meta.NormNum.IsNat (a ^ b) ne

theorem Mathlib.Meta.NormNum.isInt_zpow_pos {α : Type u_1} [DivisionRing α] {a : α} {b : ℤ} {nb : ℕ} {ne : ℕ} (pb : Mathlib.Meta.NormNum.IsNat b nb) (pe' : Mathlib.Meta.NormNum.IsInt (a ^ nb) (Int.negOfNat ne)) : Mathlib.Meta.NormNum.IsInt (a ^ b) (Int.negOfNat ne)

theorem Mathlib.Meta.NormNum.isInt_zpow_neg {α : Type u_1} [DivisionRing α] {a : α} {b : ℤ} {nb : ℕ} {ne : ℕ} (pb : Mathlib.Meta.NormNum.IsInt b (Int.negOfNat nb)) (pe' : Mathlib.Meta.NormNum.IsInt (a ^ nb)⁻¹ (Int.negOfNat ne)) : Mathlib.Meta.NormNum.IsInt (a ^ b) (Int.negOfNat ne)

theorem Mathlib.Meta.NormNum.isRat_zpow_pos {α : Type u_1} [DivisionRing α] {a : α} {b : ℤ} {nb : ℕ} {num : ℤ} {den : ℕ} (pb : Mathlib.Meta.NormNum.IsNat b nb) (pe' : Mathlib.Meta.NormNum.IsRat (a ^ nb) num den) : Mathlib.Meta.NormNum.IsRat (a ^ b) num den

theorem Mathlib.Meta.NormNum.isRat_zpow_neg {α : Type u_1} [DivisionRing α] {a : α} {b : ℤ} {nb : ℕ} {num : ℤ} {den : ℕ} (pb : Mathlib.Meta.NormNum.IsInt b (Int.negOfNat nb)) (pe' : Mathlib.Meta.NormNum.IsRat (a ^ nb)⁻¹ num den) : Mathlib.Meta.NormNum.IsRat (a ^ b) num den

def Mathlib.Meta.NormNum.evalZPow : Mathlib.Meta.NormNum.NormNumExt

The norm_num extension which identifies expressions of the form a ^ b, such that norm_num successfully recognises both a and b, with b : ℤ.

Equations

• One or more equations did not get rendered due to their size.