Theorems · Theorem · group theory
Finset.pow_subset_pow_right
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : Monoid α] {s : Finset α} {m n : ℕ}, 1 ∈ s → m ≤ n → s ^ m ⊆ s ^ n- Cited by
- 3 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqMonoid
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
- Monoidstatement and proof · cited by 3,887
- Finset.npowstatement · cited by 30
- Finset.pow_right_monotoneproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Finset.pow_ssubset_pow_succ_of_pow_ne_closureproof · cited by 1
- Finset.subset_powproof · cited by 0
- Finset.pow_subset_powproof · cited by 0