| import Mathlib | |
| open CategoryTheory | |
| namespace CAT_statement_S_0011 | |
| universe u uX | |
| variable {X : Type uX} [Category.{vX} X] | |
| namespace AHS | |
| structure ConcreteCat (X : Type v) [Category X] where | |
| C : Type u | |
| [cat : Category C] | |
| U : C ⥤ X | |
| [U_Faithful : U.Faithful] | |
| attribute [instance] ConcreteCat.cat ConcreteCat.U_Faithful | |
| def IsInitialHom {C : ConcreteCat (X:= X)} {A B : C.C} (f : A ⟶ B) : Prop := | |
| ∀ ⦃Z : C.C⦄ (g : C.U.obj Z ⟶ C.U.obj A), | |
| (∃ h : Z ⟶ B, C.U.map h = g ≫ C.U.map f) → | |
| (∃ k : Z ⟶ A, C.U.map k = g) | |
| def IsEmbedding {C : ConcreteCat (X:= X)} {A B : C.C} (f : A ⟶ B) : Prop := | |
| IsInitialHom f ∧ Mono (C.U.map f) | |
| def IsInjectiveObj {C : ConcreteCat (X:= X)} (I : C.C) : Prop := | |
| ∀ ⦃A B : C.C⦄ (m : A ⟶ B), | |
| IsEmbedding m → | |
| ∀ (f : A ⟶ I), ∃ g : B ⟶ I, m ≫ g = f | |
| def HasEnoughInj {C : ConcreteCat (X:= X)} : Prop := | |
| ∀ x: C.C, ∃ (I : C.C) (f : x ⟶ I), | |
| IsInjectiveObj I ∧ IsEmbedding f | |
| end AHS | |
| def CompHausConcrete : AHS.ConcreteCat (X := Type u) := | |
| { C := CompHaus.{u} | |
| U := forget CompHaus} | |
| theorem CompHaus_Has_EnoughInj :AHS.HasEnoughInj (C:= CompHausConcrete) := by | |
| sorry | |
| end CAT_statement_S_0011 | |