Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.BoundedFormula.IsQF.relabel

∀ {L : FirstOrder.Language} {α : Type u'} {β : Type v'} {n m : ℕ} {φ : L.BoundedFormula α m},
  φ.IsQF → ∀ (f : α → β ⊕ Fin n), (FirstOrder.Language.BoundedFormula.relabel f φ).IsQF
Defined in
Mathlib.ModelTheory.Complexity
Cited by
1 results in Mathlib
Foundations
Depth 31 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.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.IsAtomic · cited by 22BoundedFormula.IsAtomicFirstOrder.Language.BoundedFormula.relabel · cited by 17BoundedFormula.relabelFirstOrder.Language.BoundedFormula.IsAtomic.isQF · cited by 9IsAtomic.isQFFirstOrder.Language.BoundedFormula.isQF_bot · cited by 6BoundedFormula.isQF_botFirstOrder.Language.BoundedFormula.IsQF.recOn · cited by 4IsQF.recOnFirstOrder.Language.BoundedFormula.IsAtomic.relabel · cited by 1IsAtomic.relabelIsQF.relabelCITED BYCITES

Cites9

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

Cited by1

Results whose statement or proof uses this declaration.