Theorems · Theorem · category theory

Function.MulExact.rangeFactorization

∀ {M : Type u_2} {N : Type u_4} {P : Type u_6} {f : M → N} {g : N → P} [inst : One P],
  Function.MulExact f g → ∀ (hg : 1 ∈ Set.range g), Function.MulExact Subtype.val (Set.rangeFactorization g)

If two maps f : M → N and g : N → P are exact, then the induced maps Set.range f → N → Set.range g are exact. Note that if you already have an instance [One (Set.range g)] (which is unlikely) this lemma may not apply if the one of Set.range g is not definitionally equal to ⟨1, hg⟩.

Defined in

Mathlib.Algebra.Exact.Basic

Cited by

0 results in Mathlib

Foundations

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

Assumes

One