Theorems · Theorem · logic and foundations
Set.TermDefinable.definable_tupleGraph
∀ {M : Type w} (A : Set M) (L : FirstOrder.Language) [inst : L.Structure M] {α : Type u₁} {f : (α → M) → M},
A.TermDefinable L f → A.Definable L (Function.tupleGraph f)Every TermDefinable function has a tupleGraph that is definable.
- Defined in
- Mathlib.ModelTheory.Definability
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Elemproof · cited by 7,166
- Set.extproof · cited by 2,266
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.Structurestatement and proof · cited by 775
- FirstOrder.Language.Termproof · cited by 166
- FirstOrder.Language.withConstantsproof · cited by 108
- FirstOrder.Language.Term.realizeproof · cited by 81
- Set.Definablestatement · cited by 39
- FirstOrder.Language.Term.relabelproof · cited by 27
- FirstOrder.Language.Term.realize_relabelproof · cited by 15
- FirstOrder.Language.Term.equalproof · cited by 14
Cited by1
Results whose statement or proof uses this declaration.
- Set.TermDefinable₁.definable₂_graphproof · cited by 0