Fin.funPredPredAbove
defimported Lean
Given a bijection Fin (n1 + 1 + 1) → Fin (n + 1 + 1)) and a pair i j : Fin (n1 + 1 + 1), then funPredPredAbove i j _ σ _ : Fin n1 → Fin n corresponds to the induced bijection formed by dropping i and j in the source and their image in the target.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Fin in variable {n : ℕ} {c : Fin (n + 1 + 1) → C} in def Fin.funPredPredAbove {n n1 : ℕ} (i j : Fin (n1 + 1 + 1)) (hij : i ≠ j) (σ : Fin (n1 + 1 + 1) → Fin (n + 1 + 1)) (hσ : Function.Bijective σ) (m : Fin n1) : Fin n
- Defined in
- Physlib, `Fin.funPredPredAbove`
- 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.funPredPredAbove← Fin.funPredPredAbove (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:392): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Built on 15
- Fin.predPredAbove_injectiveFin.predPredAbove_injective
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- Fin.succSuccAbove_predPredAboveFin.succSuccAbove_predPredAbove
- Fin.predPredAboveThe preimage of
mundersuccSuccAbove i j hijgiven thatmis not equal toiorj. - 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
- Used by 3
- 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.funPredPredAbove_injectiveFin.funPredPredAbove_injective
- Fin.funPredPredAbove_idFin.funPredPredAbove_id
- TensorSpecies.Tensor.IsReindexing.succAbove_succSuccAbove_commRemoving one entry and then a pair of entries from
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 /-- Given a bijection `Fin (n1 + 1 + 1) → Fin (n + 1 + 1))` and a pair `i j : Fin (n1 + 1 + 1)`, then `funPredPredAbove i j _ σ _ : Fin n1 → Fin n` corresponds to the induced bijection formed by dropping `i` and `j` in the source and their image in the target. -/ def Fin.funPredPredAbove {n n1 : ℕ} (i j : Fin (n1 + 1 + 1)) (hij : i ≠ j) (σ : Fin (n1 + 1 + 1) → Fin (n + 1 + 1)) (hσ : Function.Bijective σ) (m : Fin n1) : Fin n := predPredAbove (σ i) (σ j) (by simp [hσ.injective.eq_iff, hij]) (σ (succSuccAbove i j m)) (by simp [hσ.injective.eq_iff, Ne.symm])