AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.surjective

theoremverifiedformalizationimported Lean

TensorSpecies.Tensor.IsReindexing.surjective

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor in
open Module in
variable {C : Type} in
lemma TensorSpecies.Tensor.IsReindexing.surjective {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    {σ : Fin m → Fin n} (h : IsReindexing c c1 σ) : Function.Surjective σ
Formalizes
Physlib, `TensorSpecies.Tensor.IsReindexing.surjective`
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
10 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 1
  • TensorSpecies.Tensor.IsReindexingGiven two lists of indices c : Fin n → C and c1 : Fin m → C a map σ : Fin m → Fin n satisfies the condition IsReindexing c c1 σ if…
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor in
open Module in
variable {C : Type} in
lemma TensorSpecies.Tensor.IsReindexing.surjective {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    {σ : Fin m → Fin n} (h : IsReindexing c c1 σ) : Function.Surjective σ := h.1.2
See it in the graphDiscuss this resultChallenge it