Theorems · Definition · logic and foundations
FirstOrder.Language.BoundedFormula.relabelAux
{α : Type u'} → {β : Type v'} → {n : ℕ} → (α → β ⊕ Fin n) → (k : ℕ) → α ⊕ Fin k → β ⊕ Fin (n + k)A function to help relabel the variables in bounded formulas.
- Defined in
- Mathlib.ModelTheory.Syntax
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- finSumFinEquivproof · cited by 33
- Equiv.sumAssocproof · cited by 17
Cited by5
Results whose statement or proof uses this declaration.
- FirstOrder.Language.BoundedFormula.relabelproof · cited by 17
- FirstOrder.Language.BoundedFormula.relabel_allproof · cited by 2
- FirstOrder.Language.BoundedFormula.IsAtomic.relabelproof · cited by 1
- FirstOrder.Language.BoundedFormula.sumElim_comp_relabelAuxstatement · cited by 1
- FirstOrder.Language.BoundedFormula.relabelAux_sumInlstatement · cited by 1