Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.BoundedFormula.relabel_not

∀ {L : FirstOrder.Language} {α : Type u'} {β : Type v'} {n : ℕ} (g : α → β ⊕ Fin n) {k : ℕ} (φ : L.BoundedFormula α k),
  FirstOrder.Language.BoundedFormula.relabel g φ.not = (FirstOrder.Language.BoundedFormula.relabel g φ).not
Defined in
Mathlib.ModelTheory.Syntax
Cited by
1 results in Mathlib
Foundations
Depth 30 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.relabel_ex · cited by 1BoundedFormula.relabel_exBot.bot · cited by 4720Bot.botFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.BoundedFormula.not · cited by 27BoundedFormula.notFirstOrder.Language.BoundedFormula.relabel · cited by 17BoundedFormula.relabelBoundedFormula.relabel_notCITED BYCITES

Cites5

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.