AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.append_zero_right

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.append_zero_right

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor TensorSpecies.Tensor.IsReindexing in
open Module in
variable {C : Type} in
open Fin in
lemma TensorSpecies.Tensor.IsReindexing.append_zero_right {n} {c : Fin n → C}
    {c1 : Fin 0 → C} : IsReindexing c (Fin.append c c1) id
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.append_zero_right`
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
Classical.choiceQuot.soundpropext
Built on 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen TensorSpecies TensorSpecies.Tensor TensorSpecies.Tensor.IsReindexing inopen Module invariable {C : Type} inopen Fin inlemma TensorSpecies.Tensor.IsReindexing.append_zero_right {n} {c : Fin n → C}    {c1 : Fin 0 → C} : IsReindexing c (Fin.append c c1) id := by  simp only [Nat.add_zero, IsReindexing.on_id]  have P : ∀ (i : Fin (n + 0)), c i = Fin.append c c1 i := by    rw [Fin.forall_fin_add]    simp only [Fin.append_left, Fin.append_right, IsEmpty.forall_iff, and_true]    simp only [Fin.castAdd_zero, Fin.cast_eq_self, implies_true]  exact P
See it in the graphDiscuss this resultChallenge it