Theorems · Definition · logic and foundations
FirstOrder.Language.LEquiv.onBoundedFormula
{L : FirstOrder.Language} →
{L' : FirstOrder.Language} → {α : Type u'} → {n : ℕ} → (L ≃ᴸ L') → L.BoundedFormula α n ≃ L'.BoundedFormula α nMaps a bounded formula's symbols along a language equivalence.
- Defined in
- Mathlib.ModelTheory.Syntax
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Equivstatement · cited by 8,337
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.BoundedFormulastatement · cited by 207
- FirstOrder.Language.LEquivstatement and proof · cited by 19
- FirstOrder.Language.LEquiv.toLHomproof · cited by 11
- FirstOrder.Language.LEquiv.invLHomproof · cited by 10
- FirstOrder.Language.LHom.onBoundedFormulaproof · cited by 9
Cited by4
Results whose statement or proof uses this declaration.
- FirstOrder.Language.LEquiv.onFormulaproof · cited by 3
- FirstOrder.Language.LEquiv.onBoundedFormula_applystatement and proof · cited by 0
- FirstOrder.Language.LEquiv.onBoundedFormula_symmstatement · cited by 0
- FirstOrder.Language.LEquiv.onBoundedFormula_symm_applystatement and proof · cited by 0