Fin.succSuccAbove_ne_fst
theoremverifiedformalizationimported Lean
Fin.succSuccAbove_ne_fst
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Fin in variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in @[simp] lemma Fin.succSuccAbove_ne_fst (i j : Fin (n + 1 + 1)) (m : Fin n) : ¬ succSuccAbove i j m = i
- Formalizes
- Physlib, `Fin.succSuccAbove_ne_fst`
- 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_ne_fst← Fin.succSuccAbove_ne_fst (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:194): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 12
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.succSuccAbove_injectiveFin.succSuccAbove_injective
- 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_leq_iff_leqFin.succSuccAbove_leq_iff_leq
- Fin.succSuccAbove_valFin.succSuccAbove_val
- Fin.fst_ne_succSuccAbove_preFin.fst_ne_succSuccAbove_pre
- 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 22
- Fin.predPredAbove_injectiveFin.predPredAbove_injective
- Fin.succSuccAbove_apply_lt_ltFin.succSuccAbove_apply_lt_lt
- TensorSpecies.Tensor.IsReindexing.succAbove_succSuccAbove_commRemoving one entry and then a pair of entries from
cin either order gives the same colour list: removing thek-th entry and then the… - Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_commTensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm
- Fin.succSuccAbove_predPredAboveFin.succSuccAbove_predPredAbove
- TensorSpecies.Tensor.IsReindexing.append_succSuccAbove_natAddRemoving two entries from the right component of
Fin.append c1 ccommutes with the append: removing thei-th andj-th entries ofc… - TensorSpecies.Tensor.IsReindexing.succSuccAbove_commRemoving two pairs of entries from
cin either order gives the same colour list: removing thei1-th andj1-th entries and then the… - Fin.succSuccAbove_succAbove_comm_applyPointwise form of commuting deletion of one slot with deletion of a pair.
- Fin.funPredPredAbove_injectiveFin.funPredPredAbove_injective
- Fin.succSuccAbove_comm_applyFin.succSuccAbove_comm_apply
- Fin.succSuccAbove_castAdd_natAdd_apply_natAddReinserting a right-block survivor, the mirror of
Fin.succSuccAbove_castAdd_natAdd_apply_castAdd. - Fin.predPredAbove_succSuccAboveFin.predPredAbove_succSuccAbove
- Fin.succSuccAbove_natAdd_image_range_castAddFin.succSuccAbove_natAdd_image_range_castAdd
- Fin.succSuccAbove_comm_natAddFin.succSuccAbove_comm_natAdd
- Fin.funPredPredAbove_idFin.funPredPredAbove_id
- Fin.funPredPredAboveGiven a bijection
Fin (n1 + 1 + 1) → Fin (n + 1 + 1))and a pairi j : Fin (n1 + 1 + 1), then… - 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
- Fin.predPredAbove_surjectiveFin.predPredAbove_surjective
- Fin.succSuccAbove_ne_sndFin.succSuccAbove_ne_snd
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@[simp]lemma Fin.succSuccAbove_ne_fst (i j : Fin (n + 1 + 1)) (m : Fin n) : ¬ succSuccAbove i j m = i := by simp only [Fin.ext_iff, succSuccAbove_val] grind (splits := 5)