Theorems · Theorem · combinatorics
Finset.insert_subset
∀ {α : Type u_1} [inst : DecidableEq α] {s t : Finset α} {a : α}, a ∈ t → s ⊆ t → insert a s ⊆ t- Defined in
- Mathlib.Data.Finset.Insert
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.insert_subset_iffproof · cited by 14
Cited by4
Results whose statement or proof uses this declaration.
- Equiv.Perm.IsThreeCycle.support_eq_iff_mem_supportproof · cited by 3
- Finset.Shatters.of_compressionproof · cited by 1
- Finset.mem_upShadow_iterate_iff_exists_cardproof · cited by 1
- Finset.maximal_iff_forall_insertproof · cited by 0