Fin.predPredAbove_val
theoremverifiedformalizationimported Lean
Fin.predPredAbove_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.predPredAbove_val (i j : Fin (n + 1 + 1)) (hij : i ≠ j) (m : Fin (n + 1 + 1)) (hm : m ≠ i ∧ m ≠ j) : (predPredAbove i j hij m hm).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 - 1 ≤ m.1 ∧ m.1 < j.1 then m.1 - 1 else m.1 - 2
- Formalizes
- Physlib, `Fin.predPredAbove_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.predPredAbove_val← Fin.predPredAbove_val (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:306): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- Fin.succSuccAbove_predPredAboveFin.succSuccAbove_predPredAbove
- Fin.predPredAboveThe preimage of
mundersuccSuccAbove i j hijgiven thatmis not equal toiorj. - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- Used by 1
- Fin.succSuccAbove_commFin.succSuccAbove_comm
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.predPredAbove_val (i j : Fin (n + 1 + 1)) (hij : i ≠ j) (m : Fin (n + 1 + 1)) (hm : m ≠ i ∧ m ≠ j) : (predPredAbove i j hij m hm).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 - 1 ≤ m.1 ∧ m.1 < j.1 then m.1 - 1 else m.1 - 2 := by simp only [predPredAbove] grind