Theorems · Theorem · logic and foundations

FirstOrder.Language.IsFraisseLimit.isExtensionPair

∀ {L : FirstOrder.Language} {K : Set (CategoryTheory.Bundled L.Structure)} {M : Type w} [inst : L.Structure M]
  {N : Type w} [inst_1 : L.Structure N] [inst_2 : Countable ((l : ℕ) × L.Functions l)] [inst_3 : Countable M]
  [inst_4 : Countable N],
  FirstOrder.Language.IsFraisseLimit K M → FirstOrder.Language.IsFraisseLimit K N → L.IsExtensionPair M N

Defined in

Mathlib.ModelTheory.Fraisse

Cited by

1 results in Mathlib

Foundations

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

Assumes

FirstOrder.Language.StructureFirstOrder.Language.StructureCountableCountableCountable