Fin.succSuccAbove_symm
theoremverifiedformalizationimported Lean
Fin.succSuccAbove_symm
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_symm (i j : Fin (n + 1 + 1)) : succSuccAbove i j = succSuccAbove j i
- Formalizes
- Physlib, `Fin.succSuccAbove_symm`
- 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_symm← Fin.succSuccAbove_symm (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:163): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.succSuccAboveThe embedding of
Fin nintoFin (n + 1 + 1)which leaves a hole atiandj. - Fin.succSuccAbove_eq_iff_eqFin.succSuccAbove_eq_iff_eq
- Fin.succSuccAbove_leq_iff_leqFin.succSuccAbove_leq_iff_leq
- Fin.succSuccAbove_valFin.succSuccAbove_val
- Fin.succSuccAbove_lt_iff_ltFin.succSuccAbove_lt_iff_lt
- Fin.succSuccAbove_rangeFin.succSuccAbove_range
- 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 2
- Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- Fin.apply_succSuccAbove_symmFin.apply_succSuccAbove_symm
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_symm (i j : Fin (n + 1 + 1)) : succSuccAbove i j = succSuccAbove j i := by ext m simp only [succSuccAbove_val] grind (splits := 5)