AffineIndependent.card_lt_card_of_affineSpan_lt_affineSpan
∀ {k : Type u_1} {V : Type u_2} [inst : DivisionRing k] [inst_1 : AddCommGroup V] [inst_2 : Module k V]
{s t : Finset V}, AffineIndependent k Subtype.val → affineSpan k ↑s < affineSpan k ↑t → s.card < t.cardIf the affine span of an affine independent finset is strictly contained in the affine span of another finset, then its cardinality is strictly less than the cardinality of that finset.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 121 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites34
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- Finsetstatement and proof · cited by 13,712
- AddCommGroupstatement and proof · cited by 12,871
- SetLike.coestatement and proof · cited by 8,199
- Submoduleproof · cited by 7,192
- Set.Elemproof · cited by 7,166
- Set.rangeproof · cited by 4,705
- Finset.cardstatement · cited by 2,327
- Module.finrankproof · cited by 1,770
- DivisionRingstatement and proof · cited by 1,062
- Finset.Nonemptyproof · cited by 1,001
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.