AFTD Auto-Formalizing Theoretical Domains

Fin.append_castAdd_natAdd_eq_id

theoremverifiedformalizationimported Lean

Splitting Fin (m + n) into its two blocks and reassembling them is the identity.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Module in
lemma Fin.append_castAdd_natAdd_eq_id {m n : ℕ} :
    Fin.append (Fin.castAdd n) (Fin.natAdd m) = (id : Fin (m + n) → Fin (m + n))
Formalizes
Physlib, `Fin.append_castAdd_natAdd_eq_id`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 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
09 Oct 2026
Axioms
Quot.soundpropext

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Module in/-- Splitting `Fin (m + n)` into its two blocks and reassembling them is the identity. -/lemma Fin.append_castAdd_natAdd_eq_id {m n : ℕ} :    Fin.append (Fin.castAdd n) (Fin.natAdd m) = (id : Fin (m + n) → Fin (m + n)) := by  simpa using Fin.append_castAdd_natAdd (f := (id : Fin (m + n) → Fin (m + n)))
See it in the graphDiscuss this resultChallenge it