AFTD Auto-Formalizing Theoretical Domains

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.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4

Lean source view module on GitHub

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⟩]
See it in the graphDiscuss this resultChallenge it