AFTD Auto-Formalizing Theoretical Domains

Equiv.finAddEquivSigmaCond_false

theoremverifiedformalizationimported Lean

Equiv.finAddEquivSigmaCond_false

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Equiv in
open scoped InnerProductSpace in
open Module in
variable {i : Fin (m + n)} in
lemma Equiv.finAddEquivSigmaCond_false (h : ¬ i < m) : finAddEquivSigmaCond i = ⟨false, i.subNat' h⟩
Formalizes
Physlib, `Equiv.finAddEquivSigmaCond_false`
Lean proof
By Gordon Hsu, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Gordon Hsu. 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 3
  • Equiv.finAddEquivSigmaCondThe composition of finSumFinEquiv and Equiv.sumEquivSigmalCond used by LinearMap.SchurTriangulationAux.of.
  • Equiv.sumEquivSigmalCondAn alternative form of Equiv.sumEquivSigmaBool where Bool.casesOn is replaced by cond.
  • Fin.subNat'subNat' i h subtracts m from i. This is an alternative form of Fin.subNat.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Equiv in
open scoped InnerProductSpace in
open Module in
variable {i : Fin (m + n)} in
lemma Equiv.finAddEquivSigmaCond_false (h : ¬ i < m) : finAddEquivSigmaCond i = ⟨false, i.subNat' h⟩ :=
  let j : Fin n := i.subNat' h
  calc finAddEquivSigmaCond i
    _ = finAddEquivSigmaCond (Fin.natAdd m j) :=
      suffices m + (i - m) = i from congrArg _ (Fin.ext this.symm)
      Nat.add_sub_of_le (Nat.le_of_not_gt h)
    _ = ⟨false, i.subNat' h⟩ := congrArg sumEquivSigmalCond <| finSumFinEquiv_symm_apply_natAdd j
See it in the graphDiscuss this resultChallenge it