Fin.succSuccAbove_val
theoremverifiedformalizationimported Lean
Fin.succSuccAbove_val
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Fin in variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in lemma Fin.succSuccAbove_val (i j : Fin (n + 1 + 1)) (m : Fin n) : (succSuccAbove i j m).val = if m.1 < i.1 ∧ m.1 < j.1 then m.1 else if m.1 + 1 < i.1 ∧ j.1 ≤ m.1 then m.1 + 1 else if i.1 ≤ m.1 ∧ m.1 + 1 < j.1 then m.1 + 1 else m.1 + 2
- Formalizes
- Physlib, `Fin.succSuccAbove_val`
- 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.Fin.succSuccAbove_val← Fin.succSuccAbove_val (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:62): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- Fin.succSuccAboveThe embedding of
Fin nintoFin (n + 1 + 1)which leaves a hole atiandj. - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- Fin.succSuccAboveThe embedding of
- Used by 10
- Fin.succSuccAbove_symmFin.succSuccAbove_symm
- Fin.succSuccAbove_injectiveFin.succSuccAbove_injective
- Fin.succSuccAbove_ne_fstFin.succSuccAbove_ne_fst
- Fin.succSuccAbove_castAdd_natAdd_apply_natAddReinserting a right-block survivor, the mirror of
Fin.succSuccAbove_castAdd_natAdd_apply_castAdd. - Fin.succSuccAbove_leq_iff_leqFin.succSuccAbove_leq_iff_leq
- Fin.fst_ne_succSuccAbove_preFin.fst_ne_succSuccAbove_pre
- Fin.succSuccAbove_lt_iff_ltFin.succSuccAbove_lt_iff_lt
- Fin.succSuccAbove_commFin.succSuccAbove_comm
- Fin.succSuccAbove_castAdd_natAdd_apply_castAddReinserting a left-block survivor
aafter removing thei-th slot of the left block and thej-th slot of the right block of… - Fin.succSuccAbove_natAdd_apply_castAddFin.succSuccAbove_natAdd_apply_castAdd
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Fin invariable {n : ℕ} {c : Fin (n + 1 + 1) → C} inlemma Fin.succSuccAbove_val (i j : Fin (n + 1 + 1)) (m : Fin n) : (succSuccAbove i j m).val = if m.1 < i.1 ∧ m.1 < j.1 then m.1 else if m.1 + 1 < i.1 ∧ j.1 ≤ m.1 then m.1 + 1 else if i.1 ≤ m.1 ∧ m.1 + 1 < j.1 then m.1 + 1 else m.1 + 2 := by simp only [succSuccAbove] grind