Fin.succSuccAbove_succAbove_comm_apply
theoremverifiedformalizationimported Lean
Pointwise form of commuting deletion of one slot with deletion of a pair.
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_succAbove_comm_apply {n : ℕ} (i j : Fin (n + 1 + 1 + 1)) (k : Fin (n + 1)) (m : Fin n) : (i.succSuccAbove j k).succAbove (((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove i).succSuccAbove ((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove j) m) = i.succSuccAbove j (k.succAbove m)
- Formalizes
- Physlib, `Fin.succSuccAbove_succAbove_comm_apply`
- 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_succAbove_comm_apply← Fin.succSuccAbove_succAbove_comm_apply (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:434): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 16
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- Fin.succSuccAbove_predPredAboveFin.succSuccAbove_predPredAbove
- Fin.succSuccAboveThe embedding of
Fin nintoFin (n + 1 + 1)which leaves a hole atiandj. - Fin.apply_succSuccAbove_symmFin.apply_succSuccAbove_symm
- Fin.succSuccAbove_eq_iff_eqFin.succSuccAbove_eq_iff_eq
- Fin.succSuccAbove_ne_fstFin.succSuccAbove_ne_fst
- Fin.predPredAbove_succSuccAboveFin.predPredAbove_succSuccAbove
- 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_ne_sndFin.succSuccAbove_ne_snd
- Fin.succSuccAbove_rangeFin.succSuccAbove_range
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - resolution_refutation_pos_neg_exampleSanity check: the formula consisting of the clauses {x_0} and {not x_0} has the resolution refutation x_0, not x_0, empty clause, of…
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- Used by 1
- TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_commTensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_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} in/-- Pointwise form of commuting deletion of one slot with deletion of a pair. -/lemma Fin.succSuccAbove_succAbove_comm_apply {n : ℕ} (i j : Fin (n + 1 + 1 + 1)) (k : Fin (n + 1)) (m : Fin n) : (i.succSuccAbove j k).succAbove (((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove i).succSuccAbove ((Fin.predAbove 0 (i.succSuccAbove j k)).predAbove j) m) = i.succSuccAbove j (k.succAbove m) := by apply Fin.val_injective simp only [Fin.succSuccAbove, Fin.succAbove, Fin.predAbove, Fin.lt_def, Fin.val_castSucc, Fin.val_succ, Fin.castPred, apply_ite Fin.val] grind (splits := 60)