Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.BoundedFormula.isQF_bot

∀ {L : FirstOrder.Language} {α : Type u'} {n : ℕ}, ⊥.IsQF
Defined in
Mathlib.ModelTheory.Complexity
Cited by
6 results in Mathlib
Foundations
Depth 4 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.IsQF.not · cited by 4IsQF.notFirstOrder.Language.BoundedFormula.IsQF.liftAt · cited by 3IsQF.liftAtFirstOrder.Language.BoundedFormula.toPrenex_isPrenex · cited by 2BoundedFormula.toPrenex_i…FirstOrder.Language.BoundedFormula.IsQF.relabel · cited by 1IsQF.relabelFirstOrder.Language.BoundedFormula.IsQF.castLE · cited by 1IsQF.castLEFirstOrder.Language.BoundedFormula.IsQF.top · cited by 0IsQF.topBot.bot · cited by 4720Bot.botFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.BoundedFormula.IsQF · cited by 36BoundedFormula.IsQFBoundedFormula.isQF_botCITED BYCITES

Cites4

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

Cited by6

Results whose statement or proof uses this declaration.