Theorems · Theorem · logic and foundations

Set.DefinableFun.comp

∀ {M : Type u_1} {L : FirstOrder.Language} [inst : L.Structure M] {α : Type u_2} {β : Type u_3} {A : Set M}
  {f : (α → M) → M} [Finite α] {g : (β → M) → α → M},
  Set.DefinableMap L A g → Set.DefinableFun L A f → Set.DefinableFun L A fun v => f (g v)

Defined in

Mathlib.ModelTheory.Definability

Cited by

0 results in Mathlib

Foundations

Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

FirstOrder.Language.StructureFinite