Mathlib Map

Theorems · Definition · logic and foundations

FirstOrder.Language.BoundedFormula.relabelEquiv

{L : FirstOrder.Language} →
  {α : Type u'} → {β : Type v'} → α ≃ β → {k : ℕ} → L.BoundedFormula α k ≃ L.BoundedFormula β k

Relabels a bounded formula's free variables along a bijection.

Defined in
Mathlib.ModelTheory.Syntax
Cited by
1 results in Mathlib
Foundations
Depth 18 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.Formula.equivSentence · cited by 11Formula.equivSentenceFirstOrder.Language.BoundedFormula.realize_relabelEquiv · cited by 0BoundedFormula.realize_re…Equiv · cited by 8337EquivFirstOrder.Language · cited by 1084FirstOrder.LanguageEquiv.refl · cited by 274Equiv.reflFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.Relations · cited by 147Language.RelationsEquiv.sumCongr · cited by 25Equiv.sumCongrFirstOrder.Language.Term.relabelEquiv · cited by 4Term.relabelEquivFirstOrder.Language.BoundedFormula.mapTermRelEquiv · cited by 2BoundedFormula.mapTermRel…BoundedFormula.relabelEquivCITED BYCITES

Cites8

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.