AFTD Auto-Formalizing Theoretical Domains

Physlib.MultiIndex.toList_single

theoremverifiedformalizationimported Lean

Physlib.MultiIndex.toList_single

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Physlib Physlib.MultiIndex in
open scoped BigOperators in
variable {d : ℕ} in
@[simp]
lemma Physlib.MultiIndex.toList_single (i : Fin d) : toList (increment 0 i : MultiIndex d) = [i]
Formalizes
Physlib, `Physlib.MultiIndex.toList_single`
Lean proof
By Juan Jose Fernandez Morales, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Juan Jose Fernandez Morales. 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
Quot.soundpropext
Built on 20
Used by 6

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Physlib Physlib.MultiIndex inopen scoped BigOperators invariable {d : ℕ} in@[simp]lemma Physlib.MultiIndex.toList_single (i : Fin d) : toList (increment 0 i : MultiIndex d) = [i] := by  induction d with  | zero =>      exact Fin.elim0 i  | succ d ih =>      refine Fin.cases ?_ ?_ i      · simp [toList_increment_zero]      · intro j        have htail :            tail (increment (0 : MultiIndex d.succ) j.succ) = increment (0 : MultiIndex d) j := by          rw [tail_increment_succ, tail_zero]        have hzero : increment (0 : MultiIndex d.succ) j.succ 0 = 0 := by          simp [increment]        simp [toList, hzero, htail, ih j]
See it in the graphDiscuss this resultChallenge it