Theorems · Theorem · logic and foundations
Ordinal.cof_type
∀ (α : Type u_1) [inst : LinearOrder α] [inst_1 : WellFoundedLT α], (Ordinal.type fun x1 x2 => x1 < x2).cof = Order.cof α
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 84 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderWellFoundedLT
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Cardinalstatement · cited by 2,598
- WellFoundedLTstatement and proof · cited by 491
- Ordinal.typestatement · cited by 207
- IsWellOrderstatement · cited by 171
- Ordinal.cofstatement · cited by 125
- Order.cofstatement and proof · cited by 86
- Ordinal.liftOnWellOrder_typeproof · cited by 1
Cited by9
Results whose statement or proof uses this declaration.
- Ordinal.lift_cofproof · cited by 8
- Ordinal.cof_toTypeproof · cited by 7
- Ordinal.cof_eq_one_iffproof · cited by 3
- Ordinal.sSup_add_one_lt_of_lt_cofproof · cited by 2
- Cardinal.lt_power_cof_ordproof · cited by 2
- Order.cof_Iioproof · cited by 1
- Order.cof_ord_cofproof · cited by 1
- Ordinal.cof_univproof · cited by 1
- Ordinal.cof_type_ltproof · cited by 0