Theorems · Definition · logic and foundations

FirstOrder.Language.LEquiv.recOn

{L : FirstOrder.Language} →
  {L' : FirstOrder.Language} →
    {motive : (L ≃ᴸ L') → Sort u} →
      (t : L ≃ᴸ L') →
        ((toLHom : L →ᴸ L') →
            (invLHom : L' →ᴸ L) →
              (left_inv : invLHom.comp toLHom = FirstOrder.Language.LHom.id L) →
                (right_inv : toLHom.comp invLHom = FirstOrder.Language.LHom.id L') →
                  motive { toLHom := toLHom, invLHom := invLHom, left_inv := left_inv, right_inv := right_inv }) →
          motive t

Defined in

Mathlib.ModelTheory.LanguageMap

Cited by

0 results in Mathlib

Foundations

Depth 20 from the axioms · uses no axioms