Fin.succSuccAbove_natAdd_image_range_castAdd
theoremverifiedformalizationimported Lean
Fin.succSuccAbove_natAdd_image_range_castAdd
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_natAdd_image_range_castAdd {n n1 : ℕ} (i j : Fin (n + 1 + 1)) : (succSuccAbove (n := n1 + n) (Fin.natAdd n1 i) (Fin.natAdd n1 j)) '' (Set.range (Fin.castAdd (m := n) (n := n1))) = {i | i.1 < n1}
- Formalizes
- Physlib, `Fin.succSuccAbove_natAdd_image_range_castAdd`
- 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_natAdd_image_range_castAdd← Fin.succSuccAbove_natAdd_image_range_castAdd (Physlib/Relativity/Tensors/Contraction/SuccSuccAbove.lean:266): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 14
- Fin.succSuccAbove_monotoneFin.succSuccAbove_monotone
- Fin.snd_ne_succSuccAbove_preFin.snd_ne_succSuccAbove_pre
- 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.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_natAdd_apply_castAddFin.succSuccAbove_natAdd_apply_castAdd
- Fin.succSuccAbove_ne_sndFin.succSuccAbove_ne_snd
- Fin.succSuccAbove_rangeFin.succSuccAbove_range
- persuasion_lym_sum_leLYM, relative form. If PP is an antichain of subsets of U and f(|T|) · C(|U|, |T|) ≤ B for every T ∈ PP, then ∑_{T ∈ PP} f(|T|) ≤ B.
- fse_scaling_oblivious_dictatorshipThe dictatorship conjecture holds for scaling-oblivious mechanisms. If a mechanism into [0,1] does not depend on the scaling function and…
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_natAdd_image_range_castAdd {n n1 : ℕ} (i j : Fin (n + 1 + 1)) : (succSuccAbove (n := n1 + n) (Fin.natAdd n1 i) (Fin.natAdd n1 j)) '' (Set.range (Fin.castAdd (m := n) (n := n1))) = {i | i.1 < n1} := by ext a simp only [Set.mem_image, Set.mem_range, exists_exists_eq_and, Set.mem_ofPred_eq] conv_lhs => enter [1, b] rw [succSuccAbove_natAdd_apply_castAdd i j] apply Iff.intro · rintro ⟨b, rfl⟩ simp · exact fun h ↦ ⟨⟨a, by omega⟩, by simp⟩