Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cvmliftmo Structured version   Visualization version   GIF version

Theorem cvmliftmo 36018
Description: 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.)
Hypotheses
Ref Expression
cvmliftmo.b 𝐵 = ∪ 𝐶
cvmliftmo.y 𝑌 = ∪ 𝐾
cvmliftmo.f (𝜑 → 𝐹 ∈ (𝐶 CovMap 𝐽))
cvmliftmo.k (𝜑 → 𝐾 ∈ Conn)
cvmliftmo.l (𝜑 → 𝐾 ∈ 𝑛-Locally Conn)
cvmliftmo.o (𝜑 → 𝑂 ∈ 𝑌)
cvmliftmo.g (𝜑 → 𝐺 ∈ (𝐾 Cn 𝐽))
cvmliftmo.p (𝜑 → 𝑃 ∈ 𝐵)
cvmliftmo.e (𝜑 → (𝐹‘𝑃) = (𝐺‘𝑂))
Assertion
Ref Expression
cvmliftmo (𝜑 → ∃*𝑓 ∈ (𝐾 Cn 𝐶)((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃))
Distinct variable groups:   𝐶,𝑓   𝑓,𝐺   𝑓,𝐾   𝑓,𝑂   𝜑,𝑓   𝑓,𝐹   𝑃,𝑓
Allowed substitution hints:   𝐵(𝑓)   𝐽(𝑓)   𝑌(𝑓)

Proof of Theorem cvmliftmo
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 cvmliftmo.b . . . . 5 𝐵 = ∪ 𝐶
2 cvmliftmo.y . . . . 5 𝑌 = ∪ 𝐾
3 cvmliftmo.f . . . . . 6 (𝜑 → 𝐹 ∈ (𝐶 CovMap 𝐽))
43ad2antrr 739 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝐹 ∈ (𝐶 CovMap 𝐽))
5 cvmliftmo.k . . . . . 6 (𝜑 → 𝐾 ∈ Conn)
65ad2antrr 739 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝐾 ∈ Conn)
7 cvmliftmo.l . . . . . 6 (𝜑 → 𝐾 ∈ 𝑛-Locally Conn)
87ad2antrr 739 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝐾 ∈ 𝑛-Locally Conn)
9 cvmliftmo.o . . . . . 6 (𝜑 → 𝑂 ∈ 𝑌)
109ad2antrr 739 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝑂 ∈ 𝑌)
11 simplrl 789 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝑓 ∈ (𝐾 Cn 𝐶))
12 simplrr 790 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝑔 ∈ (𝐾 Cn 𝐶))
13 simprll 791 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝐹 ∘ 𝑓) = 𝐺)
14 simprrl 793 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝐹 ∘ 𝑔) = 𝐺)
1513, 14eqtr4d 2799 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝐹 ∘ 𝑓) = (𝐹 ∘ 𝑔))
16 simprlr 792 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝑓‘𝑂) = 𝑃)
17 simprrr 794 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝑔‘𝑂) = 𝑃)
1816, 17eqtr4d 2799 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝑓‘𝑂) = (𝑔‘𝑂))
191, 2, 4, 6, 8, 10, 11, 12, 15, 18cvmliftmoi 36017 . . . 4 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝑓 = 𝑔)
2019ex 418 . . 3 ((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) → ((((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)) → 𝑓 = 𝑔))
2120ralrimivva 3206 . 2 (𝜑 → ∀𝑓 ∈ (𝐾 Cn 𝐶)∀𝑔 ∈ (𝐾 Cn 𝐶)((((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)) → 𝑓 = 𝑔))
22 coeq2 5836 . . . . 5 (𝑓 = 𝑔 → (𝐹 ∘ 𝑓) = (𝐹 ∘ 𝑔))
2322eqeq1d 2763 . . . 4 (𝑓 = 𝑔 → ((𝐹 ∘ 𝑓) = 𝐺 ↔ (𝐹 ∘ 𝑔) = 𝐺))
24 fveq1 6876 . . . . 5 (𝑓 = 𝑔 → (𝑓‘𝑂) = (𝑔‘𝑂))
2524eqeq1d 2763 . . . 4 (𝑓 = 𝑔 → ((𝑓‘𝑂) = 𝑃 ↔ (𝑔‘𝑂) = 𝑃))
2623, 25anbi12d 644 . . 3 (𝑓 = 𝑔 → (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ↔ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)))
2726rmo4 3688 . 2 (∃*𝑓 ∈ (𝐾 Cn 𝐶)((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ↔ ∀𝑓 ∈ (𝐾 Cn 𝐶)∀𝑔 ∈ (𝐾 Cn 𝐶)((((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)) → 𝑓 = 𝑔))
2821, 27sylibr 237 1 (𝜑 → ∃*𝑓 ∈ (𝐾 Cn 𝐶)((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃*wrmo 3365  ∪ cuni 4867   ∘ ccom 5655  ‘cfv 6531  (class class class)co 7412   Cn ccn 23522  Conncconn 23709  𝑛-Locally cnlly 23764   CovMap ccvm 35989
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-map 8833  df-en 8958  df-fin 8961  df-fi 9387  df-rest 17573  df-topgen 17594  df-top 23192  df-topon 23209  df-bases 23244  df-cld 23317  df-nei 23396  df-cn 23525  df-conn 23710  df-nlly 23766  df-hmeo 24054  df-cvm 35990
This theorem is used by:  cvmliftlem14  36031  cvmlift2lem13  36049  cvmlift3  36062
  Copyright terms: Public domain W3C validator