Theorems · Theorem · logic and foundations

FirstOrder.Language.Term.realize_liftAt

∀ {L : FirstOrder.Language} {M : Type w} [inst : L.Structure M] {α : Type u'} {n n' m : ℕ} {t : L.Term (α ⊕ Fin n)}
  {v : α ⊕ Fin (n + n') → M},
  FirstOrder.Language.Term.realize v (FirstOrder.Language.Term.liftAt n' m t) =
    FirstOrder.Language.Term.realize (v ∘ Sum.map id fun i => if ↑i < m then Fin.castAdd n' i else i.addNat n') t

Defined in

Mathlib.ModelTheory.Semantics

Cited by

1 results in Mathlib

Foundations

Depth 20 from the axioms · uses propext, Quot.sound

Assumes

FirstOrder.Language.Structure