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 36216
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 2801 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝐹 ∘ 𝑓) = (𝐹 ∘ 𝑔))
16 simprlr 792 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝑓‘𝑂) = 𝑃)
17 simprrr 794 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝑔‘𝑂) = 𝑃)
1816, 17eqtr4d 2801 . . . . 5 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → (𝑓‘𝑂) = (𝑔‘𝑂))
191, 2, 4, 6, 8, 10, 11, 12, 15, 18cvmliftmoi 36215 . . . 4 (((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) ∧ (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃))) → 𝑓 = 𝑔)
2019ex 418 . . 3 ((𝜑 ∧ (𝑓 ∈ (𝐾 Cn 𝐶) ∧ 𝑔 ∈ (𝐾 Cn 𝐶))) → ((((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)) → 𝑓 = 𝑔))
2120ralrimivva 3209 . 2 (𝜑 → ∀𝑓 ∈ (𝐾 Cn 𝐶)∀𝑔 ∈ (𝐾 Cn 𝐶)((((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ∧ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)) → 𝑓 = 𝑔))
22 coeq2 5842 . . . . 5 (𝑓 = 𝑔 → (𝐹 ∘ 𝑓) = (𝐹 ∘ 𝑔))
2322eqeq1d 2765 . . . 4 (𝑓 = 𝑔 → ((𝐹 ∘ 𝑓) = 𝐺 ↔ (𝐹 ∘ 𝑔) = 𝐺))
24 fveq1 6907 . . . . 5 (𝑓 = 𝑔 → (𝑓‘𝑂) = (𝑔‘𝑂))
2524eqeq1d 2765 . . . 4 (𝑓 = 𝑔 → ((𝑓‘𝑂) = 𝑃 ↔ (𝑔‘𝑂) = 𝑃))
2623, 25anbi12d 644 . . 3 (𝑓 = 𝑔 → (((𝐹 ∘ 𝑓) = 𝐺 ∧ (𝑓‘𝑂) = 𝑃) ↔ ((𝐹 ∘ 𝑔) = 𝐺 ∧ (𝑔‘𝑂) = 𝑃)))
2726rmo4 3691 . 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 2147  ∀wral 3080  ∃*wrmo 3368  ∪ cuni 4870   ∘ ccom 5659  ‘cfv 6558  (class class class)co 7443   Cn ccn 23572  Conncconn 23759  𝑛-Locally cnlly 23814   CovMap ccvm 36187
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-map 8877  df-en 9002  df-fin 9005  df-fi 9430  df-rest 17622  df-topgen 17643  df-top 23242  df-topon 23259  df-bases 23294  df-cld 23367  df-nei 23446  df-cn 23575  df-conn 23760  df-nlly 23816  df-hmeo 24104  df-cvm 36188
This theorem is used by:  cvmliftlem14  36229  cvmlift2lem13  36247  cvmlift3  36260
  Copyright terms: Public domain W3C validator