Fin.succSuccAbove_strictMono
theoremverifiedformalizationimported Lean
Fin.succSuccAbove_strictMono
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_strictMono {n : ℕ} (i j : Fin (n + 1 + 1)) : StrictMono (succSuccAbove i j)
- Formalizes
- Physlib, `Fin.succSuccAbove_strictMono`
- 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_strictMono← Fin.succSuccAbove_strictMono (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:131): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- 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.succSuccAbove_eq_iff_eqFin.succSuccAbove_eq_iff_eq
- Fin.succSuccAbove_leq_iff_leqFin.succSuccAbove_leq_iff_leq
- Fin.succSuccAbove_lt_iff_ltFin.succSuccAbove_lt_iff_lt
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
Lean source view module on GitHub
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_strictMono {n : ℕ} (i j : Fin (n + 1 + 1)) : StrictMono (succSuccAbove i j) := (succSuccAbove_monotone i j).strictMono_of_injective (succSuccAbove_injective i j)