Theorems · Definition · nonassociative algebras

LieAlgebra.IsKilling.recOn

{R : Type u_1} →
  {L : Type u_3} →
    [inst : CommRing R] →
      [inst_1 : LieRing L] →
        [inst_2 : LieAlgebra R L] →
          {motive : LieAlgebra.IsKilling R L → Sort u} →
            (t : LieAlgebra.IsKilling R L) →
              ((killingCompl_top_eq_bot : LieIdeal.killingCompl R L ⊤ = ⊥) → motive ⋯) → motive t

Defined in

Mathlib.Algebra.Lie.Killing

Cited by

0 results in Mathlib

Foundations

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

Assumes

CommRingLieRingLieAlgebra