Documentation

KernelHom.Tactic.Hom.HomKernel

hom_kernel tactic #

This file implements the hom_kernel tactic, the inverse of kernel_hom. It transforms equalities written in the monoidal category back into equivalent equalities of kernels.

Main declarations #

Get the original type and its universe from a SFinKer.of expression.

Deconstruct a left or right unitor morphism to get the underlying kernel

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    Deconstruct a left or right unitor inverse morphism to get the underlying kernel

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      Deconstruct a left or right whisker to get the underlying kernel and the whiskered object

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        Deconstruct the associator morphism to get the underlying kernel

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          Deconstruct the associator inverse morphism to get the underlying kernel

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For

            Deconstruct the braiding morphism to get the underlying swapped objects

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For

              Recursive transformation from morphism expression in SFinKer to kernel expression.

              Construct the proof of equivalence between the original equality and the transformed one.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For

                The hom_kernel tactic is the inverse of kernel_hom: it transforms an equality written in the monoidal category back to an equivalent equality of s-finite kernels.

                The tactic supports location specifiers like rw or simp:

                • hom_kernel — applies to the goal
                • hom_kernel at h — applies to hypothesis h
                • hom_kernel at h₁ h₂ — applies to multiple hypotheses
                • hom_kernel at h ⊢ — applies to hypothesis h and the goal
                • hom_kernel at * — applies to all hypotheses and the goal

                It is useful to switch back to kernel equations once categorical rewrites are done.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For

                  The hom_kernel tactic is the inverse of kernel_hom: it transforms an equality written in the monoidal category back to an equivalent equality of s-finite kernels.

                  The tactic supports location specifiers like rw or simp:

                  • hom_kernel — applies to the goal
                  • hom_kernel at h — applies to hypothesis h
                  • hom_kernel at h₁ h₂ — applies to multiple hypotheses
                  • hom_kernel at h ⊢ — applies to hypothesis h and the goal
                  • hom_kernel at * — applies to all hypotheses and the goal

                  It is useful to switch back to kernel equations once categorical rewrites are done.

                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For