Mathlib Map

Theorems · Definition · logic and foundations

FirstOrder.Language.Term.le

{L : FirstOrder.Language} →
  {α : Type w} → {n : ℕ} → [L.IsOrdered] → L.Term (α ⊕ Fin n) → L.Term (α ⊕ Fin n) → L.BoundedFormula α n

Joins two terms t₁, t₂ in a formula representing t₁ ≤ t₂.

Defined in
Mathlib.ModelTheory.Order
Cited by
1 results in Mathlib
Foundations
Depth 33 from the axioms · uses propext
Assumes
FirstOrder.Language.IsOrdered
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

FirstOrder.Language.noBotOrderSentence · cited by 5Language.noBotOrderSenten…FirstOrder.Language.noTopOrderSentence · cited by 5Language.noTopOrderSenten…FirstOrder.Language.Term.lt · cited by 1Term.ltFirstOrder.Language.Term.realize_le · cited by 0Term.realize_leFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.Term · cited by 166Language.TermFirstOrder.Language.IsOrdered · cited by 19Language.IsOrderedFirstOrder.Language.IsOrdered.leSymb · cited by 6IsOrdered.leSymbFirstOrder.Language.Relations.boundedFormula₂ · cited by 1Relations.boundedFormula₂Term.leCITED BYCITES

Cites6

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by4

Results whose statement or proof uses this declaration.