Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.BoundedFormula.IsQF.isPrenex

∀ {L : FirstOrder.Language} {α : Type u'} {n : ℕ} {φ : L.BoundedFormula α n}, φ.IsQF → φ.IsPrenex
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.IsPrenex.liftAt · cited by 2IsPrenex.liftAtFirstOrder.Language.BoundedFormula.toPrenex_isPrenex · cited by 2BoundedFormula.toPrenex_i…FirstOrder.Language.BoundedFormula.IsPrenex.castLE · cited by 1IsPrenex.castLEFirstOrder.Language.BoundedFormula.isPrenex_toPrenexImpRight · cited by 1BoundedFormula.isPrenex_t…FirstOrder.Language.BoundedFormula.IsAtomic.isPrenex · cited by 1IsAtomic.isPrenexFirstOrder.Language.BoundedFormula.IsPrenex.relabel · cited by 0IsPrenex.relabelFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.BoundedFormula.IsQF · cited by 36BoundedFormula.IsQFFirstOrder.Language.BoundedFormula.IsPrenex · cited by 13BoundedFormula.IsPrenexIsQF.isPrenexCITED 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.