Dimension.Exponent.gcdAux_eq_nat_gcd
theoremverifiedformalizationimported Lean
Dimension.Exponent.gcdAux_eq_nat_gcd
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in lemma Dimension.Exponent.gcdAux_eq_nat_gcd (fuel m n : Nat) (m_lt_fuel : m < fuel) : gcdAux fuel m n = Nat.gcd m n
- Formalizes
- Physlib, `Dimension.Exponent.gcdAux_eq_nat_gcd`
- Lean proof
- By Raunak Chhatwal, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Raunak Chhatwal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.Dimension.Exponent.gcdAux_eq_nat_gcd← Dimension.Exponent.gcdAux_eq_nat_gcd (Physlib/Units/Exponent.lean:69): verbatim
- Verified
- 09 Oct 2026
- Axioms
Quot.soundpropext- Built on 1
- Dimension.Exponent.gcdAuxFuel-bounded Euclidean algorithm used to make exponent normalization reducible.
- Used by 1
- Dimension.Exponent.gcd_eq_nat_gcdThe reducible exponent GCD agrees with
Nat.gcd.
- Dimension.Exponent.gcd_eq_nat_gcdThe reducible exponent GCD agrees with
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inlemma Dimension.Exponent.gcdAux_eq_nat_gcd (fuel m n : Nat) (m_lt_fuel : m < fuel) : gcdAux fuel m n = Nat.gcd m n := by induction fuel generalizing m n with | zero => omega | succ fuel ih => rw [gcdAux, Nat.gcd_def] split · rfl · apply ih; have := Nat.mod_lt n (Nat.zero_lt_of_ne_zero ‹m ≠ 0›); omega