Mathlib Map

Theorems · Inductive type · logic and foundations

FirstOrder.Language.BoundedFormula.IsUniversal.below

{L : FirstOrder.Language} →
  {α : Type u'} →
    {motive : {n : ℕ} → (a : L.BoundedFormula α n) → a.IsUniversal → Prop} →
      {n : ℕ} → {a : L.BoundedFormula α n} → a.IsUniversal → Prop
Defined in
Mathlib.ModelTheory.Complexity
Cited by
1 results in Mathlib
Foundations
Depth 3 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

FirstOrder.Language.BoundedFormula.IsUniversal.brecOn · cited by 0IsUniversal.brecOnFirstOrder.Language.BoundedFormula.IsUniversal.below.casesOn · cited by 0below.casesOnFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.BoundedFormula.IsUniversal · cited by 12BoundedFormula.IsUniversalIsUniversal.belowCITED BYCITES

Cites3

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

Cited by2

Results whose statement or proof uses this declaration.