Theorems · Inductive type · logic and foundations
Uncountable
Sort u_1 → Prop
A type α is uncountable if it is not countable.
- Defined in
- Mathlib.Data.Countable.Defs
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by29
Results whose statement or proof uses this declaration.
- not_countable_iffstatement · cited by 4
- Function.Injective.uncountablestatement and proof · cited by 4
- uncountable_iff_not_countablestatement and proof · cited by 4
- not_countablestatement and proof · cited by 3
- Cardinal.aleph0_lt_mk_iffstatement and proof · cited by 2
- not_uncountable_iffstatement · cited by 1
- Uncountable.casesOnstatement and proof · cited by 1
- Uncountable.not_countablestatement and proof · cited by 1
- Uncountable.of_equivstatement and proof · cited by 1
- countable_left_of_prod_of_nonemptyproof · cited by 1
- countable_right_of_prod_of_nonemptyproof · cited by 1
- Set.not_countable_univstatement and proof · cited by 1