Theorems · Theorem · combinatorics
Finset.sym_mono
∀ {α : Type u_1} {s t : Finset α} [inst : DecidableEq α], s ⊆ t → ∀ (n : ℕ), s.sym n ⊆ t.sym n- Defined in
- Mathlib.Data.Finset.Sym
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 77 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.
Cites4
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
- Symstatement and proof · cited by 150
- Finset.symstatement and proof · cited by 35
- Finset.mem_sym_iffproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- Finset.sym_unionproof · cited by 0