We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e71becb commit 9f4b375Copy full SHA for 9f4b375
1 file changed
Mathlib/Data/Finset/Powerset.lean
@@ -78,6 +78,11 @@ theorem image_injOn_powerset_of_injOn {β : Type*} [DecidableEq β] {f : α →
78
have {z a} (_ : z ⊆ s) (_ : a ∈ s) : a ∈ z ↔ f a ∈ z.image f := by grind [H.eq_iff]
79
exact fun _ _ _ _ _ => by grind
80
81
+/-- `s.biUnion id ⊆ t` iff every member of `s` is a subset of `t`, i.e. `s ⊆ t.powerset`. -/
82
+lemma biUnion_id_subset_iff_subset_powerset [DecidableEq α] {s : Finset (Finset α)} :
83
+ s.biUnion id ⊆ t ↔ s ⊆ t.powerset := by
84
+ aesop (add simp subset_iff)
85
+
86
theorem image_surjOn_powerset {β : Type*} [DecidableEq β] {f : α → β} :
87
Set.SurjOn (α := Finset α) (·.image f) s.powerset (s.image f).powerset :=
88
fun t ht => ⟨{ x ∈ s | f x ∈ t}, by grind⟩
0 commit comments