AFTD Auto-Formalizing Theoretical Domains

PureU1.split_equal

theoremverifiedformalizationimported Lean

Given a natural number n, this lemma proves that n + n is equal to 2 * n.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Nat in
open Finset in
open BigOperators in
variable {n : ℕ} in
lemma PureU1.split_equal (n : ℕ) : n + n = 2 * n
Formalizes
Physlib, `PureU1.split_equal`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 Joseph Tooby-Smith. 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.
Verified
10 Oct 2026
Axioms
none — Lean reports it depends on no axioms

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Nat in
open Finset in
open BigOperators in
variable {n : ℕ} in
/-- Given a natural number `n`, this lemma proves that `n + n` is equal to `2 * n`. -/
lemma PureU1.split_equal (n : ℕ) : n + n = 2 * n := (Nat.two_mul n).symm
See it in the graphDiscuss this resultChallenge it