Theorems · Theorem · logic and foundations
Cardinal.increasing_cantorFunction
∀ {c : ℝ},
0 < c →
c < 1 / 2 →
∀ {n : ℕ} {f g : ℕ → Bool},
(∀ k < n, f k = g k) → f n = false → g n = true → Cardinal.cantorFunction c f < Cardinal.cantorFunction c gcantorFunction c is strictly increasing with if 0 < c < 1/2, if we endow ℕ → Bool with a
lexicographic order. The lexicographic order doesn't exist for these infinitary products, so we
explicitly write out what it means.
- Defined in
- Mathlib.Analysis.Real.Cardinality
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 156 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Nat.cast_oneproof · cited by 2,501
- zero_addproof · cited by 2,366
- LT.lt.leproof · cited by 2,189
- le_of_ltproof · cited by 1,175
- LE.le.trans_ltproof · cited by 795
- div_eq_mul_invproof · cited by 715
- lt_of_lt_of_leproof · cited by 438
- LT.lt.transproof · cited by 370
- sub_posproof · cited by 147
- mul_lt_mul_of_pos_leftproof · cited by 71
- add_lt_add_rightproof · cited by 50
Cited by1
Results whose statement or proof uses this declaration.
- Cardinal.cantorFunction_injectiveproof · cited by 1