HomeHome Metamath Proof Explorer
Theorem List (p. 314 of 429)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-27903)
  Hilbert Space Explorer  Hilbert Space Explorer
(27904-29428)
  Users' Mathboxes  Users' Mathboxes
(29429-42879)
 

Theorem List for Metamath Proof Explorer - 31301-31400   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremerdszelem3 31301* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))       (𝐴 ∈ (1...𝑁) → (𝐾𝐴) = sup((# “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝐴𝑦)}), ℝ, < ))
 
Theoremerdszelem4 31302* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑂 Or ℝ       ((𝜑𝐴 ∈ (1...𝑁)) → {𝐴} ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝐴𝑦)})
 
Theoremerdszelem5 31303* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑂 Or ℝ       ((𝜑𝐴 ∈ (1...𝑁)) → (𝐾𝐴) ∈ (# “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝐴𝑦)}))
 
Theoremerdszelem6 31304* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑂 Or ℝ       (𝜑𝐾:(1...𝑁)⟶ℕ)
 
Theoremerdszelem7 31305* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑂 Or ℝ    &   (𝜑𝐴 ∈ (1...𝑁))    &   (𝜑𝑅 ∈ ℕ)    &   (𝜑 → ¬ (𝐾𝐴) ∈ (1...(𝑅 − 1)))       (𝜑 → ∃𝑠 ∈ 𝒫 (1...𝑁)(𝑅 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , 𝑂 (𝑠, (𝐹𝑠))))
 
Theoremerdszelem8 31306* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , 𝑂 (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑂 Or ℝ    &   (𝜑𝐴 ∈ (1...𝑁))    &   (𝜑𝐵 ∈ (1...𝑁))    &   (𝜑𝐴 < 𝐵)       (𝜑 → ((𝐾𝐴) = (𝐾𝐵) → ¬ (𝐹𝐴)𝑂(𝐹𝐵)))
 
Theoremerdszelem9 31307* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐼 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , < (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝐽 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , < (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑇 = (𝑛 ∈ (1...𝑁) ↦ ⟨(𝐼𝑛), (𝐽𝑛)⟩)       (𝜑𝑇:(1...𝑁)–1-1→(ℕ × ℕ))
 
Theoremerdszelem10 31308* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐼 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , < (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝐽 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , < (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑇 = (𝑛 ∈ (1...𝑁) ↦ ⟨(𝐼𝑛), (𝐽𝑛)⟩)    &   (𝜑𝑅 ∈ ℕ)    &   (𝜑𝑆 ∈ ℕ)    &   (𝜑 → ((𝑅 − 1) · (𝑆 − 1)) < 𝑁)       (𝜑 → ∃𝑚 ∈ (1...𝑁)(¬ (𝐼𝑚) ∈ (1...(𝑅 − 1)) ∨ ¬ (𝐽𝑚) ∈ (1...(𝑆 − 1))))
 
Theoremerdszelem11 31309* Lemma for erdsze 31310. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   𝐼 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , < (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝐽 = (𝑥 ∈ (1...𝑁) ↦ sup((# “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹𝑦) Isom < , < (𝑦, (𝐹𝑦)) ∧ 𝑥𝑦)}), ℝ, < ))    &   𝑇 = (𝑛 ∈ (1...𝑁) ↦ ⟨(𝐼𝑛), (𝐽𝑛)⟩)    &   (𝜑𝑅 ∈ ℕ)    &   (𝜑𝑆 ∈ ℕ)    &   (𝜑 → ((𝑅 − 1) · (𝑆 − 1)) < 𝑁)       (𝜑 → ∃𝑠 ∈ 𝒫 (1...𝑁)((𝑅 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠))) ∨ (𝑆 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠)))))
 
Theoremerdsze 31310* The Erdős-Szekeres theorem. For any injective sequence 𝐹 on the reals of length at least (𝑅 − 1) · (𝑆 − 1) + 1, there is either a subsequence of length at least 𝑅 on which 𝐹 is increasing (i.e. a < , < order isomorphism) or a subsequence of length at least 𝑆 on which 𝐹 is decreasing (i.e. a < , < order isomorphism, recalling that < is the greater-than relation). This is part of Metamath 100 proof #73. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐹:(1...𝑁)–1-1→ℝ)    &   (𝜑𝑅 ∈ ℕ)    &   (𝜑𝑆 ∈ ℕ)    &   (𝜑 → ((𝑅 − 1) · (𝑆 − 1)) < 𝑁)       (𝜑 → ∃𝑠 ∈ 𝒫 (1...𝑁)((𝑅 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠))) ∨ (𝑆 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠)))))
 
Theoremerdsze2lem1 31311* Lemma for erdsze2 31313. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑅 ∈ ℕ)    &   (𝜑𝑆 ∈ ℕ)    &   (𝜑𝐹:𝐴1-1→ℝ)    &   (𝜑𝐴 ⊆ ℝ)    &   𝑁 = ((𝑅 − 1) · (𝑆 − 1))    &   (𝜑𝑁 < (#‘𝐴))       (𝜑 → ∃𝑓(𝑓:(1...(𝑁 + 1))–1-1𝐴𝑓 Isom < , < ((1...(𝑁 + 1)), ran 𝑓)))
 
Theoremerdsze2lem2 31312* Lemma for erdsze2 31313. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑅 ∈ ℕ)    &   (𝜑𝑆 ∈ ℕ)    &   (𝜑𝐹:𝐴1-1→ℝ)    &   (𝜑𝐴 ⊆ ℝ)    &   𝑁 = ((𝑅 − 1) · (𝑆 − 1))    &   (𝜑𝑁 < (#‘𝐴))    &   (𝜑𝐺:(1...(𝑁 + 1))–1-1𝐴)    &   (𝜑𝐺 Isom < , < ((1...(𝑁 + 1)), ran 𝐺))       (𝜑 → ∃𝑠 ∈ 𝒫 𝐴((𝑅 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠))) ∨ (𝑆 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠)))))
 
Theoremerdsze2 31313* Generalize the statement of the Erdős-Szekeres theorem erdsze 31310 to "sequences" indexed by an arbitrary subset of , which can be infinite. This is part of Metamath 100 proof #73. (Contributed by Mario Carneiro, 22-Jan-2015.)
(𝜑𝑅 ∈ ℕ)    &   (𝜑𝑆 ∈ ℕ)    &   (𝜑𝐹:𝐴1-1→ℝ)    &   (𝜑𝐴 ⊆ ℝ)    &   (𝜑 → ((𝑅 − 1) · (𝑆 − 1)) < (#‘𝐴))       (𝜑 → ∃𝑠 ∈ 𝒫 𝐴((𝑅 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠))) ∨ (𝑆 ≤ (#‘𝑠) ∧ (𝐹𝑠) Isom < , < (𝑠, (𝐹𝑠)))))
 
20.5.5  The Kuratowski closure-complement theorem
 
Theoremkur14lem1 31314 Lemma for kur14 31324. (Contributed by Mario Carneiro, 17-Feb-2015.)
𝐴𝑋    &   (𝑋𝐴) ∈ 𝑇    &   (𝐾𝐴) ∈ 𝑇       (𝑁 = 𝐴 → (𝑁𝑋 ∧ {(𝑋𝑁), (𝐾𝑁)} ⊆ 𝑇))
 
Theoremkur14lem2 31315 Lemma for kur14 31324. Write interior in terms of closure and complement: 𝑖𝐴 = 𝑐𝑘𝑐𝐴 where 𝑐 is complement and 𝑘 is closure. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋       (𝐼𝐴) = (𝑋 ∖ (𝐾‘(𝑋𝐴)))
 
Theoremkur14lem3 31316 Lemma for kur14 31324. A closure is a subset of the base set. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋       (𝐾𝐴) ⊆ 𝑋
 
Theoremkur14lem4 31317 Lemma for kur14 31324. Complementation is an involution on the set of subsets of a topology. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋       (𝑋 ∖ (𝑋𝐴)) = 𝐴
 
Theoremkur14lem5 31318 Lemma for kur14 31324. Closure is an idempotent operation in the set of subsets of a topology. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋       (𝐾‘(𝐾𝐴)) = (𝐾𝐴)
 
Theoremkur14lem6 31319 Lemma for kur14 31324. If 𝑘 is the complementation operator and 𝑘 is the closure operator, this expresses the identity 𝑘𝑐𝑘𝐴 = 𝑘𝑐𝑘𝑐𝑘𝑐𝑘𝐴 for any subset 𝐴 of the topological space. This is the key result that lets us cut down long enough sequences of 𝑐𝑘𝑐𝑘... that arise when applying closure and complement repeatedly to 𝐴, and explains why we end up with a number as large as 14, yet no larger. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋    &   𝐵 = (𝑋 ∖ (𝐾𝐴))       (𝐾‘(𝐼‘(𝐾𝐵))) = (𝐾𝐵)
 
Theoremkur14lem7 31320 Lemma for kur14 31324: main proof. The set 𝑇 here contains all the distinct combinations of 𝑘 and 𝑐 that can arise, and we prove here that applying 𝑘 or 𝑐 to any element of 𝑇 yields another elemnt of 𝑇. In operator shorthand, we have 𝑇 = {𝐴, 𝑐𝐴, 𝑘𝐴 , 𝑐𝑘𝐴, 𝑘𝑐𝐴, 𝑐𝑘𝑐𝐴, 𝑘𝑐𝑘𝐴, 𝑐𝑘𝑐𝑘𝐴, 𝑘𝑐𝑘𝑐𝐴, 𝑐𝑘𝑐𝑘𝑐𝐴, 𝑘𝑐𝑘𝑐𝑘𝐴, 𝑐𝑘𝑐𝑘𝑐𝑘𝐴, 𝑘𝑐𝑘𝑐𝑘𝑐𝐴, 𝑐𝑘𝑐𝑘𝑐𝑘𝑐𝐴}. From the identities 𝑐𝑐𝐴 = 𝐴 and 𝑘𝑘𝐴 = 𝑘𝐴, we can reduce any operator combination containing two adjacent identical operators, which is why the list only contains alternating sequences. The reason the sequences don't keep going after a certain point is due to the identity 𝑘𝑐𝑘𝐴 = 𝑘𝑐𝑘𝑐𝑘𝑐𝑘𝐴, proved in kur14lem6 31319. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋    &   𝐵 = (𝑋 ∖ (𝐾𝐴))    &   𝐶 = (𝐾‘(𝑋𝐴))    &   𝐷 = (𝐼‘(𝐾𝐴))    &   𝑇 = ((({𝐴, (𝑋𝐴), (𝐾𝐴)} ∪ {𝐵, 𝐶, (𝐼𝐴)}) ∪ {(𝐾𝐵), 𝐷, (𝐾‘(𝐼𝐴))}) ∪ ({(𝐼𝐶), (𝐾𝐷), (𝐼‘(𝐾𝐵))} ∪ {(𝐾‘(𝐼𝐶)), (𝐼‘(𝐾‘(𝐼𝐴)))}))       (𝑁𝑇 → (𝑁𝑋 ∧ {(𝑋𝑁), (𝐾𝑁)} ⊆ 𝑇))
 
Theoremkur14lem8 31321 Lemma for kur14 31324. Show that the set 𝑇 contains at most 14 elements. (It could be less if some of the operators take the same value for a given set, but Kuratowski showed that this upper bound of 14 is tight in the sense that there exist topological spaces and subsets of these spaces for which all 14 generated sets are distinct, and indeed the real numbers form such a topological space.) (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋    &   𝐵 = (𝑋 ∖ (𝐾𝐴))    &   𝐶 = (𝐾‘(𝑋𝐴))    &   𝐷 = (𝐼‘(𝐾𝐴))    &   𝑇 = ((({𝐴, (𝑋𝐴), (𝐾𝐴)} ∪ {𝐵, 𝐶, (𝐼𝐴)}) ∪ {(𝐾𝐵), 𝐷, (𝐾‘(𝐼𝐴))}) ∪ ({(𝐼𝐶), (𝐾𝐷), (𝐼‘(𝐾𝐵))} ∪ {(𝐾‘(𝐼𝐶)), (𝐼‘(𝐾‘(𝐼𝐴)))}))       (𝑇 ∈ Fin ∧ (#‘𝑇) ≤ 14)
 
Theoremkur14lem9 31322* Lemma for kur14 31324. Since the set 𝑇 is closed under closure and complement, it contains the minimal set 𝑆 as a subset, so 𝑆 also has at most 14 elements. (Indeed 𝑆 = 𝑇, and it's not hard to prove this, but we don't need it for this proof.) (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝐼 = (int‘𝐽)    &   𝐴𝑋    &   𝐵 = (𝑋 ∖ (𝐾𝐴))    &   𝐶 = (𝐾‘(𝑋𝐴))    &   𝐷 = (𝐼‘(𝐾𝐴))    &   𝑇 = ((({𝐴, (𝑋𝐴), (𝐾𝐴)} ∪ {𝐵, 𝐶, (𝐼𝐴)}) ∪ {(𝐾𝐵), 𝐷, (𝐾‘(𝐼𝐴))}) ∪ ({(𝐼𝐶), (𝐾𝐷), (𝐼‘(𝐾𝐵))} ∪ {(𝐾‘(𝐼𝐶)), (𝐼‘(𝐾‘(𝐼𝐴)))}))    &   𝑆 = {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴𝑥 ∧ ∀𝑦𝑥 {(𝑋𝑦), (𝐾𝑦)} ⊆ 𝑥)}       (𝑆 ∈ Fin ∧ (#‘𝑆) ≤ 14)
 
Theoremkur14lem10 31323* Lemma for kur14 31324. Discharge the set 𝑇. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝐽 ∈ Top    &   𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝑆 = {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴𝑥 ∧ ∀𝑦𝑥 {(𝑋𝑦), (𝐾𝑦)} ⊆ 𝑥)}    &   𝐴𝑋       (𝑆 ∈ Fin ∧ (#‘𝑆) ≤ 14)
 
Theoremkur14 31324* Kuratowski's closure-complement theorem. There are at most 14 sets which can be obtained by the application of the closure and complement operations to a set in a topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑋 = 𝐽    &   𝐾 = (cls‘𝐽)    &   𝑆 = {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴𝑥 ∧ ∀𝑦𝑥 {(𝑋𝑦), (𝐾𝑦)} ⊆ 𝑥)}       ((𝐽 ∈ Top ∧ 𝐴𝑋) → (𝑆 ∈ Fin ∧ (#‘𝑆) ≤ 14))
 
20.5.6  Retracts and sections
 
Syntaxcretr 31325 Extend class notation with the retract relation.
class Retr
 
Definitiondf-retr 31326* Define the set of retractions on two topological spaces. We say that 𝑅 is a retraction from 𝐽 to 𝐾. or 𝑅 ∈ (𝐽 Retr 𝐾) iff there is an 𝑆 such that 𝑅:𝐽𝐾, 𝑆:𝐾𝐽 are continuous functions called the retraction and section respectively, and their composite 𝑅𝑆 is homotopic to the identity map. If a retraction exists, we say 𝐽 is a retract of 𝐾. (This terminology is borrowed from HoTT and appears to be nonstandard, although it has similaries to the concept of retract in the category of topological spaces and to a deformation retract in general topology.) Two topological spaces that are retracts of each other are called homotopy equivalent. (Contributed by Mario Carneiro, 11-Feb-2015.)
Retr = (𝑗 ∈ Top, 𝑘 ∈ Top ↦ {𝑟 ∈ (𝑗 Cn 𝑘) ∣ ∃𝑠 ∈ (𝑘 Cn 𝑗)((𝑟𝑠)(𝑗 Htpy 𝑗)( I ↾ 𝑗)) ≠ ∅})
 
20.5.7  Path-connected and simply connected spaces
 
Syntaxcpconn 31327 Extend class notation with the class of path-connected topologies.
class PConn
 
Syntaxcsconn 31328 Extend class notation with the class of simply connected topologies.
class SConn
 
Definitiondf-pconn 31329* Define the class of path-connected topologies. A topology is path-connected if there is a path (a continuous function from the unit interval) that goes from 𝑥 to 𝑦 for any points 𝑥, 𝑦 in the space. (Contributed by Mario Carneiro, 11-Feb-2015.)
PConn = {𝑗 ∈ Top ∣ ∀𝑥 𝑗𝑦 𝑗𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)}
 
Definitiondf-sconn 31330* Define the class of simply connected topologies. A topology is simply connected if it is path-connected and every loop (continuous path with identical start and endpoint) is contractible to a point (path-homotopic to a constant function). (Contributed by Mario Carneiro, 11-Feb-2015.)
SConn = {𝑗 ∈ PConn ∣ ∀𝑓 ∈ (II Cn 𝑗)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝑗)((0[,]1) × {(𝑓‘0)}))}
 
Theoremispconn 31331* The property of being a path-connected topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑋 = 𝐽       (𝐽 ∈ PConn ↔ (𝐽 ∈ Top ∧ ∀𝑥𝑋𝑦𝑋𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝑥 ∧ (𝑓‘1) = 𝑦)))
 
Theorempconncn 31332* The property of being a path-connected topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑋 = 𝐽       ((𝐽 ∈ PConn ∧ 𝐴𝑋𝐵𝑋) → ∃𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = 𝐴 ∧ (𝑓‘1) = 𝐵))
 
Theorempconntop 31333 A simply connected space is a topology. (Contributed by Mario Carneiro, 11-Feb-2015.)
(𝐽 ∈ PConn → 𝐽 ∈ Top)
 
Theoremissconn 31334* The property of being a simply connected topological space. (Contributed by Mario Carneiro, 11-Feb-2015.)
(𝐽 ∈ SConn ↔ (𝐽 ∈ PConn ∧ ∀𝑓 ∈ (II Cn 𝐽)((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph𝐽)((0[,]1) × {(𝑓‘0)}))))
 
Theoremsconnpconn 31335 A simply connected space is path-connected. (Contributed by Mario Carneiro, 11-Feb-2015.)
(𝐽 ∈ SConn → 𝐽 ∈ PConn)
 
Theoremsconntop 31336 A simply connected space is a topology. (Contributed by Mario Carneiro, 11-Feb-2015.)
(𝐽 ∈ SConn → 𝐽 ∈ Top)
 
Theoremsconnpht 31337 A closed path in a simply connected space is contractible to a point. (Contributed by Mario Carneiro, 11-Feb-2015.)
((𝐽 ∈ SConn ∧ 𝐹 ∈ (II Cn 𝐽) ∧ (𝐹‘0) = (𝐹‘1)) → 𝐹( ≃ph𝐽)((0[,]1) × {(𝐹‘0)}))
 
Theoremcnpconn 31338 An image of a path-connected space is path-connected. (Contributed by Mario Carneiro, 24-Mar-2015.)
𝑌 = 𝐾       ((𝐽 ∈ PConn ∧ 𝐹:𝑋onto𝑌𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ PConn)
 
Theorempconnconn 31339 A path-connected space is connected. (Contributed by Mario Carneiro, 11-Feb-2015.)
(𝐽 ∈ PConn → 𝐽 ∈ Conn)
 
Theoremtxpconn 31340 The topological product of two path-connected spaces is path-connected. (Contributed by Mario Carneiro, 12-Feb-2015.)
((𝑅 ∈ PConn ∧ 𝑆 ∈ PConn) → (𝑅 ×t 𝑆) ∈ PConn)
 
Theoremptpconn 31341 The topological product of a collection of path-connected spaces is path-connected. The proof uses the axiom of choice. (Contributed by Mario Carneiro, 17-Feb-2015.)
((𝐴𝑉𝐹:𝐴⟶PConn) → (∏t𝐹) ∈ PConn)
 
Theoremindispconn 31342 The indiscrete topology (or trivial topology) on any set is path-connected. (Contributed by Mario Carneiro, 7-Jul-2015.) (Revised by Mario Carneiro, 14-Aug-2015.)
{∅, 𝐴} ∈ PConn
 
Theoremconnpconn 31343 A connected and locally path-connected space is path-connected. (Contributed by Mario Carneiro, 7-Jul-2015.)
((𝐽 ∈ Conn ∧ 𝐽 ∈ 𝑛-Locally PConn) → 𝐽 ∈ PConn)
 
Theoremqtoppconn 31344 A quotient of a path-connected space is path-connected. (Contributed by Mario Carneiro, 24-Mar-2015.)
𝑋 = 𝐽       ((𝐽 ∈ PConn ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ PConn)
 
Theorempconnpi1 31345 All fundamental groups in a path-connected space are isomorphic. (Contributed by Mario Carneiro, 12-Feb-2015.)
𝑋 = 𝐽    &   𝑃 = (𝐽 π1 𝐴)    &   𝑄 = (𝐽 π1 𝐵)    &   𝑆 = (Base‘𝑃)    &   𝑇 = (Base‘𝑄)       ((𝐽 ∈ PConn ∧ 𝐴𝑋𝐵𝑋) → 𝑃𝑔 𝑄)
 
Theoremsconnpht2 31346 Any two paths in a simply connected space with the same start and end point are path-homotopic. (Contributed by Mario Carneiro, 12-Feb-2015.)
(𝜑𝐽 ∈ SConn)    &   (𝜑𝐹 ∈ (II Cn 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑 → (𝐹‘0) = (𝐺‘0))    &   (𝜑 → (𝐹‘1) = (𝐺‘1))       (𝜑𝐹( ≃ph𝐽)𝐺)
 
Theoremsconnpi1 31347 A path-connected topological space is simply connected iff its fundamental group is trivial. (Contributed by Mario Carneiro, 12-Feb-2015.)
𝑋 = 𝐽       ((𝐽 ∈ PConn ∧ 𝑌𝑋) → (𝐽 ∈ SConn ↔ (Base‘(𝐽 π1 𝑌)) ≈ 1𝑜))
 
Theoremtxsconnlem 31348 Lemma for txsconn 31349. (Contributed by Mario Carneiro, 9-Mar-2015.)
(𝜑𝑅 ∈ Top)    &   (𝜑𝑆 ∈ Top)    &   (𝜑𝐹 ∈ (II Cn (𝑅 ×t 𝑆)))    &   𝐴 = ((1st ↾ ( 𝑅 × 𝑆)) ∘ 𝐹)    &   𝐵 = ((2nd ↾ ( 𝑅 × 𝑆)) ∘ 𝐹)    &   (𝜑𝐺 ∈ (𝐴(PHtpy‘𝑅)((0[,]1) × {(𝐴‘0)})))    &   (𝜑𝐻 ∈ (𝐵(PHtpy‘𝑆)((0[,]1) × {(𝐵‘0)})))       (𝜑𝐹( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝐹‘0)}))
 
Theoremtxsconn 31349 The topological product of two simply connected spaces is simply connected. (Contributed by Mario Carneiro, 12-Feb-2015.)
((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ SConn)
 
Theoremcvxpconn 31350* A convex subset of the complex numbers is path-connected. (Contributed by Mario Carneiro, 12-Feb-2015.)
(𝜑𝑆 ⊆ ℂ)    &   ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑡 ∈ (0[,]1))) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆)    &   𝐽 = (TopOpen‘ℂfld)    &   𝐾 = (𝐽t 𝑆)       (𝜑𝐾 ∈ PConn)
 
Theoremcvxsconn 31351* A convex subset of the complex numbers is simply connected. (Contributed by Mario Carneiro, 12-Feb-2015.)
(𝜑𝑆 ⊆ ℂ)    &   ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑡 ∈ (0[,]1))) → ((𝑡 · 𝑥) + ((1 − 𝑡) · 𝑦)) ∈ 𝑆)    &   𝐽 = (TopOpen‘ℂfld)    &   𝐾 = (𝐽t 𝑆)       (𝜑𝐾 ∈ SConn)
 
Theoremblsconn 31352 An open ball in the complex numbers is simply connected. (Contributed by Mario Carneiro, 12-Feb-2015.)
𝐽 = (TopOpen‘ℂfld)    &   𝑆 = (𝑃(ball‘(abs ∘ − ))𝑅)    &   𝐾 = (𝐽t 𝑆)       ((𝑃 ∈ ℂ ∧ 𝑅 ∈ ℝ*) → 𝐾 ∈ SConn)
 
Theoremcnllysconn 31353 The topology of the complex numbers is locally simply connected. (Contributed by Mario Carneiro, 2-Mar-2015.)
𝐽 = (TopOpen‘ℂfld)       𝐽 ∈ Locally SConn
 
Theoremresconn 31354 A subset of is simply connected iff it is connected. (Contributed by Mario Carneiro, 9-Mar-2015.)
𝐽 = ((topGen‘ran (,)) ↾t 𝐴)       (𝐴 ⊆ ℝ → (𝐽 ∈ SConn ↔ 𝐽 ∈ Conn))
 
Theoremioosconn 31355 An open interval is simply connected. (Contributed by Mario Carneiro, 9-Mar-2015.)
((topGen‘ran (,)) ↾t (𝐴(,)𝐵)) ∈ SConn
 
Theoremiccsconn 31356 A closed interval is simply connected. (Contributed by Mario Carneiro, 9-Mar-2015.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((topGen‘ran (,)) ↾t (𝐴[,]𝐵)) ∈ SConn)
 
Theoremretopsconn 31357 The real numbers are simply connected. (Contributed by Mario Carneiro, 9-Mar-2015.)
(topGen‘ran (,)) ∈ SConn
 
Theoremiccllysconn 31358 A closed interval is locally simply connected. (Contributed by Mario Carneiro, 10-Mar-2015.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((topGen‘ran (,)) ↾t (𝐴[,]𝐵)) ∈ Locally SConn)
 
Theoremrellysconn 31359 The real numbers are locally simply connected. (Contributed by Mario Carneiro, 10-Mar-2015.)
(topGen‘ran (,)) ∈ Locally SConn
 
Theoremiisconn 31360 The unit interval is simply connected. (Contributed by Mario Carneiro, 9-Mar-2015.)
II ∈ SConn
 
Theoremiillysconn 31361 The unit interval is locally simply connected. (Contributed by Mario Carneiro, 10-Mar-2015.)
II ∈ Locally SConn
 
Theoremiinllyconn 31362 The unit interval is locally connected. (Contributed by Mario Carneiro, 6-Jul-2015.)
II ∈ 𝑛-Locally Conn
 
20.5.8  Covering maps
 
Syntaxccvm 31363 Extend class notation with the class of covering maps.
class CovMap
 
Definitiondf-cvm 31364* Define the class of covering maps on two topological spaces. A function 𝑓:𝑐𝑗 is a covering map if it is continuous and for every point 𝑥 in the target space there is a neighborhood 𝑘 of 𝑥 and a decomposition 𝑠 of the preimage of 𝑘 as a disjoint union such that 𝑓 is a homeomorphism of each set 𝑢𝑠 onto 𝑘. (Contributed by Mario Carneiro, 13-Feb-2015.)
CovMap = (𝑐 ∈ Top, 𝑗 ∈ Top ↦ {𝑓 ∈ (𝑐 Cn 𝑗) ∣ ∀𝑥 𝑗𝑘𝑗 (𝑥𝑘 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∖ {∅})( 𝑠 = (𝑓𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝑓𝑢) ∈ ((𝑐t 𝑢)Homeo(𝑗t 𝑘)))))})
 
Theoremfncvm 31365 Lemma for covering maps. (Contributed by Mario Carneiro, 13-Feb-2015.)
CovMap Fn (Top × Top)
 
Theoremcvmscbv 31366* Change bound variables in the set of even coverings. (Contributed by Mario Carneiro, 17-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       𝑆 = (𝑎𝐽 ↦ {𝑏 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑏 = (𝐹𝑎) ∧ ∀𝑐𝑏 (∀𝑑 ∈ (𝑏 ∖ {𝑐})(𝑐𝑑) = ∅ ∧ (𝐹𝑐) ∈ ((𝐶t 𝑐)Homeo(𝐽t 𝑎))))})
 
Theoremiscvm 31367* The property of being a covering map. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝑋 = 𝐽       (𝐹 ∈ (𝐶 CovMap 𝐽) ↔ ((𝐶 ∈ Top ∧ 𝐽 ∈ Top ∧ 𝐹 ∈ (𝐶 Cn 𝐽)) ∧ ∀𝑥𝑋𝑘𝐽 (𝑥𝑘 ∧ (𝑆𝑘) ≠ ∅)))
 
Theoremcvmtop1 31368 Reverse closure for a covering map. (Contributed by Mario Carneiro, 11-Feb-2015.)
(𝐹 ∈ (𝐶 CovMap 𝐽) → 𝐶 ∈ Top)
 
Theoremcvmtop2 31369 Reverse closure for a covering map. (Contributed by Mario Carneiro, 13-Feb-2015.)
(𝐹 ∈ (𝐶 CovMap 𝐽) → 𝐽 ∈ Top)
 
Theoremcvmcn 31370 A covering map is a continuous function. (Contributed by Mario Carneiro, 13-Feb-2015.)
(𝐹 ∈ (𝐶 CovMap 𝐽) → 𝐹 ∈ (𝐶 Cn 𝐽))
 
Theoremcvmcov 31371* Property of a covering map. In order to make the covering property more manageable, we define here the set 𝑆(𝑘) of all even coverings of an open set 𝑘 in the range. Then the covering property states that every point has a neighborhood which has an even covering. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝑋 = 𝐽       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑃𝑋) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝑆𝑥) ≠ ∅))
 
Theoremcvmsrcl 31372* Reverse closure for an even covering. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝑇 ∈ (𝑆𝑈) → 𝑈𝐽)
 
Theoremcvmsi 31373* One direction of cvmsval 31374. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝑇 ∈ (𝑆𝑈) → (𝑈𝐽 ∧ (𝑇𝐶𝑇 ≠ ∅) ∧ ( 𝑇 = (𝐹𝑈) ∧ ∀𝑢𝑇 (∀𝑣 ∈ (𝑇 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑈))))))
 
Theoremcvmsval 31374* Elementhood in the set 𝑆 of all even coverings of an open set in 𝐽. 𝑆 is an even covering of 𝑈 if it is a nonempty collection of disjoint open sets in 𝐶 whose union is the preimage of 𝑈, such that each set 𝑢𝑆 is homeomorphic under 𝐹 to 𝑈. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝐶𝑉 → (𝑇 ∈ (𝑆𝑈) ↔ (𝑈𝐽 ∧ (𝑇𝐶𝑇 ≠ ∅) ∧ ( 𝑇 = (𝐹𝑈) ∧ ∀𝑢𝑇 (∀𝑣 ∈ (𝑇 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑈)))))))
 
Theoremcvmsss 31375* An even covering is a subset of the topology of the domain (i.e. a collection of open sets). (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝑇 ∈ (𝑆𝑈) → 𝑇𝐶)
 
Theoremcvmsn0 31376* An even covering is nonempty. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝑇 ∈ (𝑆𝑈) → 𝑇 ≠ ∅)
 
Theoremcvmsuni 31377* An even covering of 𝑈 has union equal to the preimage of 𝑈 by 𝐹. (Contributed by Mario Carneiro, 11-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝑇 ∈ (𝑆𝑈) → 𝑇 = (𝐹𝑈))
 
Theoremcvmsdisj 31378* An even covering of 𝑈 is a disjoint union. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       ((𝑇 ∈ (𝑆𝑈) ∧ 𝐴𝑇𝐵𝑇) → (𝐴 = 𝐵 ∨ (𝐴𝐵) = ∅))
 
Theoremcvmshmeo 31379* Every element of an even covering of 𝑈 is homeomorphic to 𝑈 via 𝐹. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       ((𝑇 ∈ (𝑆𝑈) ∧ 𝐴𝑇) → (𝐹𝐴) ∈ ((𝐶t 𝐴)Homeo(𝐽t 𝑈)))
 
Theoremcvmsf1o 31380* 𝐹, localized to an element of an even covering of 𝑈, is a bijection. (Contributed by Mario Carneiro, 14-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑇 ∈ (𝑆𝑈) ∧ 𝐴𝑇) → (𝐹𝐴):𝐴1-1-onto𝑈)
 
Theoremcvmscld 31381* The sets of an even covering are clopen in the subspace topology on 𝑇. (Contributed by Mario Carneiro, 14-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑇 ∈ (𝑆𝑈) ∧ 𝐴𝑇) → 𝐴 ∈ (Clsd‘(𝐶t (𝐹𝑈))))
 
Theoremcvmsss2 31382* An open subset of an evenly covered set is evenly covered. (Contributed by Mario Carneiro, 7-Jul-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑉𝐽𝑉𝑈) → ((𝑆𝑈) ≠ ∅ → (𝑆𝑉) ≠ ∅))
 
Theoremcvmcov2 31383* The covering map property can be restricted to an open subset. (Contributed by Mario Carneiro, 7-Jul-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝑈𝐽𝑃𝑈) → ∃𝑥 ∈ 𝒫 𝑈(𝑃𝑥 ∧ (𝑆𝑥) ≠ ∅))
 
Theoremcvmseu 31384* Every element in 𝑇 is a member of a unique element of 𝑇. (Contributed by Mario Carneiro, 14-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ (𝑇 ∈ (𝑆𝑈) ∧ 𝐴𝐵 ∧ (𝐹𝐴) ∈ 𝑈)) → ∃!𝑥𝑇 𝐴𝑥)
 
Theoremcvmsiota 31385* Identify the unique element of 𝑇 containing 𝐴. (Contributed by Mario Carneiro, 14-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑊 = (𝑥𝑇 𝐴𝑥)       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ (𝑇 ∈ (𝑆𝑈) ∧ 𝐴𝐵 ∧ (𝐹𝐴) ∈ 𝑈)) → (𝑊𝑇𝐴𝑊))
 
Theoremcvmopnlem 31386* Lemma for cvmopn 31388. (Contributed by Mario Carneiro, 7-May-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶       ((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝐴𝐶) → (𝐹𝐴) ∈ 𝐽)
 
Theoremcvmfolem 31387* Lemma for cvmfo 31408. (Contributed by Mario Carneiro, 13-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽       (𝐹 ∈ (𝐶 CovMap 𝐽) → 𝐹:𝐵onto𝑋)
 
Theoremcvmopn 31388 A covering map is an open map. (Contributed by Mario Carneiro, 7-May-2015.)
((𝐹 ∈ (𝐶 CovMap 𝐽) ∧ 𝐴𝐶) → (𝐹𝐴) ∈ 𝐽)
 
Theoremcvmliftmolem1 31389* Lemma for cvmliftmo 31392. (Contributed by Mario Carneiro, 10-Mar-2015.)
𝐵 = 𝐶    &   𝑌 = 𝐾    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐾 ∈ Conn)    &   (𝜑𝐾 ∈ 𝑛-Locally Conn)    &   (𝜑𝑂𝑌)    &   (𝜑𝑀 ∈ (𝐾 Cn 𝐶))    &   (𝜑𝑁 ∈ (𝐾 Cn 𝐶))    &   (𝜑 → (𝐹𝑀) = (𝐹𝑁))    &   (𝜑 → (𝑀𝑂) = (𝑁𝑂))    &   𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   ((𝜑𝜓) → 𝑇 ∈ (𝑆𝑈))    &   ((𝜑𝜓) → 𝑊𝑇)    &   ((𝜑𝜓) → 𝐼 ⊆ (𝑀𝑊))    &   ((𝜑𝜓) → (𝐾t 𝐼) ∈ Conn)    &   ((𝜑𝜓) → 𝑋𝐼)    &   ((𝜑𝜓) → 𝑄𝐼)    &   ((𝜑𝜓) → 𝑅𝐼)    &   ((𝜑𝜓) → (𝐹‘(𝑀𝑋)) ∈ 𝑈)       ((𝜑𝜓) → (𝑄 ∈ dom (𝑀𝑁) → 𝑅 ∈ dom (𝑀𝑁)))
 
Theoremcvmliftmolem2 31390* Lemma for cvmliftmo 31392. (Contributed by Mario Carneiro, 10-Mar-2015.)
𝐵 = 𝐶    &   𝑌 = 𝐾    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐾 ∈ Conn)    &   (𝜑𝐾 ∈ 𝑛-Locally Conn)    &   (𝜑𝑂𝑌)    &   (𝜑𝑀 ∈ (𝐾 Cn 𝐶))    &   (𝜑𝑁 ∈ (𝐾 Cn 𝐶))    &   (𝜑 → (𝐹𝑀) = (𝐹𝑁))    &   (𝜑 → (𝑀𝑂) = (𝑁𝑂))    &   𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})       (𝜑𝑀 = 𝑁)
 
Theoremcvmliftmoi 31391 A lift of a continuous function from a connected and locally connected space over a covering map is unique when it exists. (Contributed by Mario Carneiro, 10-Mar-2015.)
𝐵 = 𝐶    &   𝑌 = 𝐾    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐾 ∈ Conn)    &   (𝜑𝐾 ∈ 𝑛-Locally Conn)    &   (𝜑𝑂𝑌)    &   (𝜑𝑀 ∈ (𝐾 Cn 𝐶))    &   (𝜑𝑁 ∈ (𝐾 Cn 𝐶))    &   (𝜑 → (𝐹𝑀) = (𝐹𝑁))    &   (𝜑 → (𝑀𝑂) = (𝑁𝑂))       (𝜑𝑀 = 𝑁)
 
Theoremcvmliftmo 31392* A lift of a continuous function from a connected and locally connected space over a covering map is unique when it exists. (Contributed by Mario Carneiro, 10-Mar-2015.) (Revised by NM, 17-Jun-2017.)
𝐵 = 𝐶    &   𝑌 = 𝐾    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐾 ∈ Conn)    &   (𝜑𝐾 ∈ 𝑛-Locally Conn)    &   (𝜑𝑂𝑌)    &   (𝜑𝐺 ∈ (𝐾 Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺𝑂))       (𝜑 → ∃*𝑓 ∈ (𝐾 Cn 𝐶)((𝐹𝑓) = 𝐺 ∧ (𝑓𝑂) = 𝑃))
 
Theoremcvmliftlem1 31393* Lemma for cvmlift 31407. In cvmliftlem15 31406, we picked an 𝑁 large enough so that the sections (𝐺 “ [(𝑘 − 1) / 𝑁, 𝑘 / 𝑁]) are all contained in an even covering, and the function 𝑇 enumerates these even coverings. So 1st ‘(𝑇𝑀) is a neighborhood of (𝐺 “ [(𝑀 − 1) / 𝑁, 𝑀 / 𝑁]), and 2nd ‘(𝑇𝑀) is an even covering of 1st ‘(𝑇𝑀), which is to say a disjoint union of open sets in 𝐶 whose image is 1st ‘(𝑇𝑀). (Contributed by Mario Carneiro, 14-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   ((𝜑𝜓) → 𝑀 ∈ (1...𝑁))       ((𝜑𝜓) → (2nd ‘(𝑇𝑀)) ∈ (𝑆‘(1st ‘(𝑇𝑀))))
 
Theoremcvmliftlem2 31394* Lemma for cvmlift 31407. 𝑊 = [(𝑘 − 1) / 𝑁, 𝑘 / 𝑁] is a subset of [0, 1] for each 𝑀 ∈ (1...𝑁). (Contributed by Mario Carneiro, 16-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   ((𝜑𝜓) → 𝑀 ∈ (1...𝑁))    &   𝑊 = (((𝑀 − 1) / 𝑁)[,](𝑀 / 𝑁))       ((𝜑𝜓) → 𝑊 ⊆ (0[,]1))
 
Theoremcvmliftlem3 31395* Lemma for cvmlift 31407. Since 1st ‘(𝑇𝑀) is a neighborhood of (𝐺𝑊), every element 𝐴𝑊 satisfies (𝐺𝐴) ∈ (1st ‘(𝑇𝑀)). (Contributed by Mario Carneiro, 16-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   ((𝜑𝜓) → 𝑀 ∈ (1...𝑁))    &   𝑊 = (((𝑀 − 1) / 𝑁)[,](𝑀 / 𝑁))    &   ((𝜑𝜓) → 𝐴𝑊)       ((𝜑𝜓) → (𝐺𝐴) ∈ (1st ‘(𝑇𝑀)))
 
Theoremcvmliftlem4 31396* Lemma for cvmlift 31407. The function 𝑄 will be our lifted path, defined piecewise on each section [(𝑀 − 1) / 𝑁, 𝑀 / 𝑁] for 𝑀 ∈ (1...𝑁). For 𝑀 = 0, it is a "seed" value which makes the rest of the recursion work, a singleton function mapping 0 to 𝑃. (Contributed by Mario Carneiro, 15-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   𝑄 = seq0((𝑥 ∈ V, 𝑚 ∈ ℕ ↦ (𝑧 ∈ (((𝑚 − 1) / 𝑁)[,](𝑚 / 𝑁)) ↦ ((𝐹 ↾ (𝑏 ∈ (2nd ‘(𝑇𝑚))(𝑥‘((𝑚 − 1) / 𝑁)) ∈ 𝑏))‘(𝐺𝑧)))), (( I ↾ ℕ) ∪ {⟨0, {⟨0, 𝑃⟩}⟩}))       (𝑄‘0) = {⟨0, 𝑃⟩}
 
Theoremcvmliftlem5 31397* Lemma for cvmlift 31407. Definition of 𝑄 at a successor. This is a function defined on 𝑊 as (𝑇𝐼) ∘ 𝐺 where 𝐼 is the unique covering set of 2nd ‘(𝑇𝑀) that contains 𝑄(𝑀 − 1) evaluated at the last defined point, namely (𝑀 − 1) / 𝑁 (note that for 𝑀 = 1 this is using the seed value 𝑄(0)(0) = 𝑃). (Contributed by Mario Carneiro, 15-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   𝑄 = seq0((𝑥 ∈ V, 𝑚 ∈ ℕ ↦ (𝑧 ∈ (((𝑚 − 1) / 𝑁)[,](𝑚 / 𝑁)) ↦ ((𝐹 ↾ (𝑏 ∈ (2nd ‘(𝑇𝑚))(𝑥‘((𝑚 − 1) / 𝑁)) ∈ 𝑏))‘(𝐺𝑧)))), (( I ↾ ℕ) ∪ {⟨0, {⟨0, 𝑃⟩}⟩}))    &   𝑊 = (((𝑀 − 1) / 𝑁)[,](𝑀 / 𝑁))       ((𝜑𝑀 ∈ ℕ) → (𝑄𝑀) = (𝑧𝑊 ↦ ((𝐹 ↾ (𝑏 ∈ (2nd ‘(𝑇𝑀))((𝑄‘(𝑀 − 1))‘((𝑀 − 1) / 𝑁)) ∈ 𝑏))‘(𝐺𝑧))))
 
Theoremcvmliftlem6 31398* Lemma for cvmlift 31407. Induction step for cvmliftlem7 31399. Assuming that 𝑄(𝑀 − 1) is defined at (𝑀 − 1) / 𝑁 and is a preimage of 𝐺((𝑀 − 1) / 𝑁), the next segment 𝑄(𝑀) is also defined and is a function on 𝑊 which is a lift 𝐺 for this segment. This follows explicitly from the definition 𝑄(𝑀) = (𝐹𝐼) ∘ 𝐺 since 𝐺 is in 1st ‘(𝐹𝑀) for the entire interval so that (𝐹𝐼) maps this into 𝐼 and 𝐹𝑄 maps back to 𝐺. (Contributed by Mario Carneiro, 16-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   𝑄 = seq0((𝑥 ∈ V, 𝑚 ∈ ℕ ↦ (𝑧 ∈ (((𝑚 − 1) / 𝑁)[,](𝑚 / 𝑁)) ↦ ((𝐹 ↾ (𝑏 ∈ (2nd ‘(𝑇𝑚))(𝑥‘((𝑚 − 1) / 𝑁)) ∈ 𝑏))‘(𝐺𝑧)))), (( I ↾ ℕ) ∪ {⟨0, {⟨0, 𝑃⟩}⟩}))    &   𝑊 = (((𝑀 − 1) / 𝑁)[,](𝑀 / 𝑁))    &   ((𝜑𝜓) → 𝑀 ∈ (1...𝑁))    &   ((𝜑𝜓) → ((𝑄‘(𝑀 − 1))‘((𝑀 − 1) / 𝑁)) ∈ (𝐹 “ {(𝐺‘((𝑀 − 1) / 𝑁))}))       ((𝜑𝜓) → ((𝑄𝑀):𝑊𝐵 ∧ (𝐹 ∘ (𝑄𝑀)) = (𝐺𝑊)))
 
Theoremcvmliftlem7 31399* Lemma for cvmlift 31407. Prove by induction that every 𝑄 function is well-defined (we can immediately follow this theorem with cvmliftlem6 31398 to show functionality and lifting of 𝑄). (Contributed by Mario Carneiro, 14-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   𝑄 = seq0((𝑥 ∈ V, 𝑚 ∈ ℕ ↦ (𝑧 ∈ (((𝑚 − 1) / 𝑁)[,](𝑚 / 𝑁)) ↦ ((𝐹 ↾ (𝑏 ∈ (2nd ‘(𝑇𝑚))(𝑥‘((𝑚 − 1) / 𝑁)) ∈ 𝑏))‘(𝐺𝑧)))), (( I ↾ ℕ) ∪ {⟨0, {⟨0, 𝑃⟩}⟩}))    &   𝑊 = (((𝑀 − 1) / 𝑁)[,](𝑀 / 𝑁))       ((𝜑𝑀 ∈ (1...𝑁)) → ((𝑄‘(𝑀 − 1))‘((𝑀 − 1) / 𝑁)) ∈ (𝐹 “ {(𝐺‘((𝑀 − 1) / 𝑁))}))
 
Theoremcvmliftlem8 31400* Lemma for cvmlift 31407. The functions 𝑄 are continuous functions because they are defined as (𝐹𝐼) ∘ 𝐺 where 𝐺 is continuous and (𝐹𝐼) is a homeomorphism. (Contributed by Mario Carneiro, 16-Feb-2015.)
𝑆 = (𝑘𝐽 ↦ {𝑠 ∈ (𝒫 𝐶 ∖ {∅}) ∣ ( 𝑠 = (𝐹𝑘) ∧ ∀𝑢𝑠 (∀𝑣 ∈ (𝑠 ∖ {𝑢})(𝑢𝑣) = ∅ ∧ (𝐹𝑢) ∈ ((𝐶t 𝑢)Homeo(𝐽t 𝑘))))})    &   𝐵 = 𝐶    &   𝑋 = 𝐽    &   (𝜑𝐹 ∈ (𝐶 CovMap 𝐽))    &   (𝜑𝐺 ∈ (II Cn 𝐽))    &   (𝜑𝑃𝐵)    &   (𝜑 → (𝐹𝑃) = (𝐺‘0))    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝑇:(1...𝑁)⟶ 𝑗𝐽 ({𝑗} × (𝑆𝑗)))    &   (𝜑 → ∀𝑘 ∈ (1...𝑁)(𝐺 “ (((𝑘 − 1) / 𝑁)[,](𝑘 / 𝑁))) ⊆ (1st ‘(𝑇𝑘)))    &   𝐿 = (topGen‘ran (,))    &   𝑄 = seq0((𝑥 ∈ V, 𝑚 ∈ ℕ ↦ (𝑧 ∈ (((𝑚 − 1) / 𝑁)[,](𝑚 / 𝑁)) ↦ ((𝐹 ↾ (𝑏 ∈ (2nd ‘(𝑇𝑚))(𝑥‘((𝑚 − 1) / 𝑁)) ∈ 𝑏))‘(𝐺𝑧)))), (( I ↾ ℕ) ∪ {⟨0, {⟨0, 𝑃⟩}⟩}))    &   𝑊 = (((𝑀 − 1) / 𝑁)[,](𝑀 / 𝑁))       ((𝜑𝑀 ∈ (1...𝑁)) → (𝑄𝑀) ∈ ((𝐿t 𝑊) Cn 𝐶))
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
  Copyright terms: Public domain < Previous  Next >