internlm/Lean-Github huggingface dataset:
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
⊢ ∀ ⦃Y_1 : CompHaus⦄ ⦃f : Y_1 ⟶ Y⦄,
    Zf.arrows f →
      Coverage.saturate
        (ExtensiveRegularCoverage' CompHaus
          (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
          (_ :
            ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
              (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
        Y_1 (Sieve.pullback f (Sieve.generate T))
Tactic:
intro R g hZfg
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
hZfg : Zf.arrows g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
hZfg : Zf.arrows g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Tactic:
dsimp at hZfg
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
hZfg : ∃ Y_1 h g_1, ofArrows (fun x => ∐ fun i => Xmap i) (fun x => Sigma.desc f) g_1 ∧ h ≫ g_1 = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
hZfg : ∃ Y_1 h g_1, ofArrows (fun x => ∐ fun i => Xmap i) (fun x => Sigma.desc f) g_1 ∧ h ≫ g_1 = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Tactic:
rw [Presieve.ofArrows_pUnit] at hZfg
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
hZfg : ∃ Y_1 h g_1, Presieve.singleton (Sigma.desc f) g_1 ∧ h ≫ g_1 = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
hZfg : ∃ Y_1 h g_1, Presieve.singleton (Sigma.desc f) g_1 ∧ h ≫ g_1 = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Tactic:
obtain ⟨W, ψ, σ, ⟨hW, hW'⟩⟩ := hZfg
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
ψ : R ⟶ W
σ : W ⟶ Y
hW : Presieve.singleton (Sigma.desc f) σ
hW' : ψ ≫ σ = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
ψ : R ⟶ W
σ : W ⟶ Y
hW : Presieve.singleton (Sigma.desc f) σ
hW' : ψ ≫ σ = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Tactic:
dsimp [Presieve.singleton] at hW
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
ψ : R ⟶ W
σ : W ⟶ Y
hW : singleton' (Sigma.desc f) σ
hW' : ψ ≫ σ = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
ψ : R ⟶ W
σ : W ⟶ Y
hW : singleton' (Sigma.desc f) σ
hW' : ψ ≫ σ = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Tactic:
induction hW
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro.mk
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro.mk
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback g (Sieve.generate T))
Tactic:
rw [← hW', Sieve.pullback_comp Z]
Proof state after:
case h.h.h.mpr.of.intro.intro.intro.intro.intro.a.intro.intro.intro.intro.mk
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Coverage.saturate
    (ExtensiveRegularCoverage' CompHaus
      (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
      (_ :
        ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
          (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
    R (Sieve.pullback ψ (Sieve.pullback (Sigma.desc f) Z))
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case this
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Sieve.pullback ψ (Sieve.pullback F Z) ∈
    GrothendieckTopology.sieves
      (Coverage.toGrothendieck CompHaus
        (ExtensiveRegularCoverage' CompHaus
          (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
          (_ :
            ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
              (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst))))
      R
Tactic:
apply GrothendieckTopology.pullback_stable'
Proof state after:
case this.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Sieve.pullback F Z ∈
    GrothendieckTopology.sieves
      (Coverage.toGrothendieck CompHaus
        (ExtensiveRegularCoverage' CompHaus
          (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
          (_ :
            ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
              (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst))))
      (∐ fun i => Xmap i)
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case this.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Sieve.pullback F Z ∈
    GrothendieckTopology.sieves
      (Coverage.toGrothendieck CompHaus
        (ExtensiveRegularCoverage' CompHaus
          (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
          (_ :
            ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
              (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst))))
      (∐ fun i => Xmap i)
Tactic:
dsimp [Coverage.toGrothendieck]
Proof state after:
case this.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Sieve.pullback (Sigma.desc f) (Sieve.generate T) ∈
    Coverage.saturate
      (ExtensiveRegularCoverage' CompHaus
        (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
        (_ :
          ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
            (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
      (∐ fun i => Xmap i)
Theorem: CompHaus.extensiveRegular_generates_coherent
Proof state before:
case this.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Sieve.pullback (Sigma.desc f) (Sieve.generate T) ∈
    Coverage.saturate
      (ExtensiveRegularCoverage' CompHaus
        (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
        (_ :
          ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
            (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
      (∐ fun i => Xmap i)
Tactic:
suffices : Coverage.saturate (ExtensiveRegularCoverage' _ _ _) Xs (Z.pullback F)
Proof state after:
case this.a
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
this : Coverage.saturate (ExtensiveRegularCoverage' CompHaus ?m.593487 ?m.593488) Xs (Sieve.pullback F Z)
⊢ Sieve.pullback (Sigma.desc f) (Sieve.generate T) ∈
    Coverage.saturate
      (ExtensiveRegularCoverage' CompHaus
        (_ : ∀ {X Y Z : CompHaus} (f : Y ⟶ X) (π : Z ⟶ X) [inst : Epi π], Epi Limits.pullback.fst)
        (_ :
          ∀ {α : Type} [inst : Fintype α] {X : CompHaus} {Z : α → CompHaus} (π : (a : α) → Z a ⟶ X) {Y : CompHaus}
            (f : Y ⟶ X) (x : IsIso (Sigma.desc π)), IsIso (Sigma.desc fun x_1 => Limits.pullback.fst)))
      (∐ fun i => Xmap i)

case this
X : CompHaus
S : Sieve X
Y : CompHaus
T : Presieve Y
I : Type
hI : Fintype I
Xmap : I → CompHaus
f : (a : I) → Xmap a ⟶ Y
h : T = ofArrows Xmap f
hT : Epi (Sigma.desc f)
he : EffectiveEpiFamily Xmap f ↔ Epi (Sigma.desc f)
φ : (i : I) → Xmap i ⟶ ∐ Xmap := fun i => Sigma.ι Xmap i
F : (∐ fun b => Xmap b) ⟶ Y := Sigma.desc f
Z : Sieve Y := Sieve.generate T
Xs : CompHaus := ∐ fun i => Xmap i
Zf : Sieve Y := Sieve.generate (ofArrows (fun x => Xs) fun x => F)
R : CompHaus
g : R ⟶ Y
W : CompHaus
σ : W ⟶ Y
ψ : R ⟶ ∐ fun i => Xmap i
hW' : ψ ≫ Sigma.desc f = g
⊢ Coverage.saturate (ExtensiveRegularCoverage' CompHaus ?m.593487 ?m.593488) Xs (Sieve.pullback F Z)