Skip to content
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions Mathlib/Topology/Connected/Basic.lean
Original file line number Diff line number Diff line change
Expand Up @@ -200,6 +200,26 @@ theorem IsConnected.iUnion_of_reflTransGen {ι : Type*} [Nonempty ι] {s : ι
⟨nonempty_iUnion.2 <| Nonempty.elim ‹_› fun i : ι => ⟨i, (H _).nonempty⟩,
IsPreconnected.iUnion_of_reflTransGen (fun i => (H i).isPreconnected) K⟩

lemma IsPreconnected.transGen_of_iUnion {ι : Type*} {s : ι → Set α}
(hs : IsPreconnected (⋃ n, s n)) (hs' : ∀ i, IsOpen (s i)) (i j : ι) (hi : (s i).Nonempty)
(hj : (s j).Nonempty) : TransGen (fun a b ↦ (s a ∩ s b).Nonempty) i j := by
by_contra hij
let S : Set ι := {k | TransGen (fun a b ↦ (s a ∩ s b).Nonempty) i k}
let U : Set α := ⋃ k ∈ S, s k
let V : Set α := ⋃ k ∈ Sᶜ, s k
have hsplit : (⋃ n, s n) = U ∪ V := iSup_split s (· ∈ S)
obtain ⟨a, ha⟩ := hi
obtain ⟨b, hb⟩ := hj
let hi_S : i ∈ S := Relation.TransGen.single ⟨a, ha, ha⟩
have hUne : ((⋃ n, s n) ∩ U).Nonempty := ⟨a, mem_iUnion_of_mem i ha, mem_iUnion₂_of_mem hi_S ha⟩
have hVne : ((⋃ n, s n) ∩ V).Nonempty := ⟨b, mem_iUnion_of_mem j hb, mem_iUnion₂_of_mem hij hb⟩
obtain ⟨x, -, hxU, hxV⟩ := hs U V (isOpen_biUnion fun i a ↦ hs' i)
(isOpen_biUnion fun i a ↦ hs' i) hsplit.le hUne hVne
simp only [mem_iUnion, exists_prop, mem_compl_iff, U, V] at hxU hxV
obtain ⟨k, hk, hxk⟩ := hxU
obtain ⟨l, hl, hxl⟩ := hxV
exact hl (hk.tail ⟨x, hxk, hxl⟩)

section SuccOrder

open Order
Expand Down
Loading