`BookProof.ClosureUniqueness.factorGraph_eq_of_clGraph_eq` {T₁ : D₁ →ₗ[ℂ] F} {T₂ : D₂ →ₗ[ℂ] F} (h : clGraph T₁ = clGraph T₂) : factorGraph T₁ = factorGraph T₂

Initializing...

`BookProof.ClosureUniqueness.factorGraph_eq_of_clGraph_eq` {T₁ : D₁ →ₗ[ℂ] F} {T₂ : D₂ →ₗ[ℂ] F} (h : clGraph T₁ = clGraph T₂) : factorGraph T₁ = factorGraph T₂ · Prove2Me