Theorems · Definition · logic and foundations
FirstOrder.Language.denselyOrderedSentence
(L : FirstOrder.Language) → [L.IsOrdered] → L.Sentence
A sentence indicating that an order is dense: $\forall x, \forall y, x < y \to \exists z, x < z \wedge z < y$.
- Defined in
- Mathlib.ModelTheory.Order
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.Sentencestatement · cited by 127
- FirstOrder.Language.IsOrderedstatement and proof · cited by 19
- FirstOrder.Language.BoundedFormula.exproof · cited by 14
- FirstOrder.Language.Term.ltproof · cited by 1
Cited by6
Results whose statement or proof uses this declaration.
- FirstOrder.Language.dloproof · cited by 8
- FirstOrder.Language.realize_denselyOrdered_iffstatement · cited by 2
- FirstOrder.Language.denselyOrdered_of_dloproof · cited by 1
- FirstOrder.Language.noBotOrder_of_dloproof · cited by 1
- FirstOrder.Language.noTopOrder_of_dloproof · cited by 1
- FirstOrder.Language.realize_denselyOrderedstatement · cited by 0