Theorems · Theorem · combinatorics
Fintype.card_subtype_le
∀ {α : Type u_1} [inst : Fintype α] (p : α → Prop) [inst_1 : Fintype { a // p a }],
Fintype.card { x // p x } ≤ Fintype.card α- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Fintypestatement and proof · cited by 7,736
- Fintype.cardstatement · cited by 1,386
- Function.Embedding.subtypeproof · cited by 128
- Fintype.card_le_of_embeddingproof · cited by 11
Cited by4
Results whose statement or proof uses this declaration.
- NumberField.InfinitePlace.card_add_two_mul_card_eq_rankproof · cited by 9
- NumberField.mixedEmbedding.finrankproof · cited by 4
- Equiv.Perm.subgroup_eq_top_of_isPreprimitive_of_isSwap_memproof · cited by 1
- Finite.card_subtype_leproof · cited by 1