`BookProof.ClosureUniqueness.compGraph_eq_of_isClosureOf` {T : D →ₗ[ℂ] F} {A : Dom →ₗ[ℂ] F} (hA : IsClosureOf T A) : compGraph A = factorGraph T

Initializing...

`BookProof.ClosureUniqueness.compGraph_eq_of_isClosureOf` {T : D →ₗ[ℂ] F} {A : Dom →ₗ[ℂ] F} (hA : IsClosureOf T A) : compGraph A = factorGraph T · Prove2Me