Zulip Chat Archive
Stream: Is there code for X?
Topic: set.finite of subset range
Damiano Testa (Feb 11 2022 at 15:55):
Dear All,
I do not know my way at all around finite
, finset
, fintype
, so I am hoping that the lemma below is easy to prove! Can anyone suggest a way to make progress on this?
Bonus: I would be particularly grateful for an answer that teaches me how to solve this kind of questions without bothering the Zulip crowd!
Thanks!
import data.finset.basic
import data.set.finite
lemma set.finite_of_finset_range {s : set ℕ} (d : ℕ) (sd : s ⊆ finset.range d) :
s.finite :=
begin
sorry,
end
Eric Wieser (Feb 11 2022 at 15:55):
Does docs#set.finite.mono exist?
Damiano Testa (Feb 11 2022 at 15:56):
Your link sends to a 404...
Damiano Testa (Feb 11 2022 at 15:56):
I tried looking for some form of mono, but I could not find it (which does not mean that it does not exist, of course!).
Eric Wieser (Feb 11 2022 at 15:57):
Damiano Testa (Feb 11 2022 at 15:57):
Ah, this one exists, let me try!
Damiano Testa (Feb 11 2022 at 15:59):
Great, this works! Thanks!
lemma set.finite_of_finset_range {s : set ℕ} (d : ℕ) (sd : s ⊆ finset.range d) :
s.finite :=
(range d).finite_to_set.subset sd
Last updated: Dec 20 2023 at 11:08 UTC