English
A simplification lemma stating that the value of leastExt does not depend on unrelated indices and respects membership of sets.
Русский
Упрощение: значение leastExt не зависит от несвязанных индексов и сохраняет принадлежность множеств.
LaTeX
$$$$Eq\\big(\\text{leastExt } F E\\big)=\\text{some simple description of membership}$$$$
Lean4
theorem isLeast_leastExt (i : ι) : IsLeast {k | b k ∉ E⟮<i⟯} (φ i) :=
by
rw [image_eq_range, leastExt, wellFounded_lt.fix_eq]
exact ⟨wellFounded_lt.min_mem _ _, fun _ ↦ (wellFounded_lt.min_le ·)⟩