Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.BoundedFormula.IsPrenex.liftAt

∀ {L : FirstOrder.Language} {α : Type u'} {l : ℕ} {φ : L.BoundedFormula α l} {k m : ℕ},
  φ.IsPrenex → (FirstOrder.Language.BoundedFormula.liftAt k m φ).IsPrenex
Defined in
Mathlib.ModelTheory.Complexity
Cited by
2 results in Mathlib
Foundations
Depth 28 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

FirstOrder.Language.BoundedFormula.realize_toPrenexImp · cited by 1BoundedFormula.realize_to…FirstOrder.Language.BoundedFormula.isPrenex_toPrenexImp · cited by 1BoundedFormula.isPrenex_t…FirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.BoundedFormula.IsQF · cited by 36BoundedFormula.IsQFFirstOrder.Language.BoundedFormula.liftAt · cited by 14BoundedFormula.liftAtFirstOrder.Language.BoundedFormula.IsPrenex · cited by 13BoundedFormula.IsPrenexFirstOrder.Language.BoundedFormula.IsQF.isPrenex · cited by 6IsQF.isPrenexFirstOrder.Language.BoundedFormula.IsPrenex.recOn · cited by 4IsPrenex.recOnFirstOrder.Language.BoundedFormula.IsQF.liftAt · cited by 3IsQF.liftAtFirstOrder.Language.BoundedFormula.IsPrenex.castLE · cited by 1IsPrenex.castLEIsPrenex.liftAtCITED BYCITES

Cites9

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.