Physlib.List.mem_take_finrange
theoremverifiedformalizationimported Lean
Physlib.List.mem_take_finrange
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open _root_.Physlib.Fin in variable {n : Nat} in set_option maxHeartbeats 350000 in lemma Physlib.List.mem_take_finrange : (n m : ℕ) → (a : Fin n) → a ∈ List.take m (List.finRange n) ↔ a.val < m
- Formalizes
- Physlib, `Physlib.List.mem_take_finrange`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2024 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.Physlib.List.mem_take_finrange← Physlib.List.mem_take_finrange (Physlib/Mathematics/ForMathlib/List.lean:725): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- Physlib.Fin.involutionNoFixedSetOneFixed point involutions of
Fin n.succ.succfixingf 0 = 1are equivalent to fixed point involutions ofFin n. - Physlib.Distribution.powOneMulThe continuous linear map
𝓢(ℝ, 𝕜) →L[𝕜] 𝓢(ℝ, 𝕜)taking a Schwartz mapηtox * η. - spi_two_point_scheme_specFor S >= 2 the two-point scheme is a valid scheme and a player using it is accepted with probability exactly spi_two_point_max_prob.
- quota_population_monotone_incompatible_four_states_common_houseNo apportionment solution for four states satisfies quota and avoids population paradoxes between profiles at the same house size; twelve…
- Physlib.Fin.involutionNoFixedSetOneFixed point involutions of
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 _root_.Physlib.Fin invariable {n : Nat} inset_option maxHeartbeats 350000 inlemma Physlib.List.mem_take_finrange : (n m : ℕ) → (a : Fin n) → a ∈ List.take m (List.finRange n) ↔ a.val < m | 0, m, a => Fin.elim0 a | n+1, 0, a => by simp | n +1, m + 1, ⟨0, h⟩ => by simp [List.finRange_succ] | n +1, m + 1, ⟨i + 1, h⟩ => by simp only [List.finRange_succ, List.take_succ_cons, List.mem_cons, Fin.ext_iff, Fin.val_zero, Nat.add_eq_zero_iff, one_ne_zero, and_false, false_or, add_lt_add_iff_right] rw [← List.map_take, @List.mem_map] apply Iff.intro · intro h obtain ⟨a, ha⟩ := h rw [mem_take_finrange n m a, Fin.ext_iff] at ha simp_all only [Fin.val_succ, add_left_inj] omega · intro h1 use ⟨i, Nat.succ_lt_succ_iff.mp h⟩ simp only [Fin.succ_mk, and_true] rwa [mem_take_finrange n m ⟨i, Nat.succ_lt_succ_iff.mp h⟩]