MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  paste Structured version   Visualization version   GIF version

Theorem paste 21899
Description: Pasting lemma. If 𝐴 and 𝐵 are closed sets in 𝑋 with 𝐴𝐵 = 𝑋, then any function whose restrictions to 𝐴 and 𝐵 are continuous is continuous on all of 𝑋. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 21-Aug-2015.)
Hypotheses
Ref Expression
paste.1 𝑋 = 𝐽
paste.2 𝑌 = 𝐾
paste.4 (𝜑𝐴 ∈ (Clsd‘𝐽))
paste.5 (𝜑𝐵 ∈ (Clsd‘𝐽))
paste.6 (𝜑 → (𝐴𝐵) = 𝑋)
paste.7 (𝜑𝐹:𝑋𝑌)
paste.8 (𝜑 → (𝐹𝐴) ∈ ((𝐽t 𝐴) Cn 𝐾))
paste.9 (𝜑 → (𝐹𝐵) ∈ ((𝐽t 𝐵) Cn 𝐾))
Assertion
Ref Expression
paste (𝜑𝐹 ∈ (𝐽 Cn 𝐾))

Proof of Theorem paste
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 paste.7 . 2 (𝜑𝐹:𝑋𝑌)
2 paste.6 . . . . . . 7 (𝜑 → (𝐴𝐵) = 𝑋)
32ineq2d 4139 . . . . . 6 (𝜑 → ((𝐹𝑦) ∩ (𝐴𝐵)) = ((𝐹𝑦) ∩ 𝑋))
4 indi 4200 . . . . . . 7 ((𝐹𝑦) ∩ (𝐴𝐵)) = (((𝐹𝑦) ∩ 𝐴) ∪ ((𝐹𝑦) ∩ 𝐵))
51ffund 6491 . . . . . . . 8 (𝜑 → Fun 𝐹)
6 respreima 6813 . . . . . . . . 9 (Fun 𝐹 → ((𝐹𝐴) “ 𝑦) = ((𝐹𝑦) ∩ 𝐴))
7 respreima 6813 . . . . . . . . 9 (Fun 𝐹 → ((𝐹𝐵) “ 𝑦) = ((𝐹𝑦) ∩ 𝐵))
86, 7uneq12d 4091 . . . . . . . 8 (Fun 𝐹 → (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)) = (((𝐹𝑦) ∩ 𝐴) ∪ ((𝐹𝑦) ∩ 𝐵)))
95, 8syl 17 . . . . . . 7 (𝜑 → (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)) = (((𝐹𝑦) ∩ 𝐴) ∪ ((𝐹𝑦) ∩ 𝐵)))
104, 9eqtr4id 2852 . . . . . 6 (𝜑 → ((𝐹𝑦) ∩ (𝐴𝐵)) = (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)))
11 imassrn 5907 . . . . . . . . 9 (𝐹𝑦) ⊆ ran 𝐹
12 dfdm4 5728 . . . . . . . . . 10 dom 𝐹 = ran 𝐹
13 fdm 6495 . . . . . . . . . 10 (𝐹:𝑋𝑌 → dom 𝐹 = 𝑋)
1412, 13syl5eqr 2847 . . . . . . . . 9 (𝐹:𝑋𝑌 → ran 𝐹 = 𝑋)
1511, 14sseqtrid 3967 . . . . . . . 8 (𝐹:𝑋𝑌 → (𝐹𝑦) ⊆ 𝑋)
161, 15syl 17 . . . . . . 7 (𝜑 → (𝐹𝑦) ⊆ 𝑋)
17 df-ss 3898 . . . . . . 7 ((𝐹𝑦) ⊆ 𝑋 ↔ ((𝐹𝑦) ∩ 𝑋) = (𝐹𝑦))
1816, 17sylib 221 . . . . . 6 (𝜑 → ((𝐹𝑦) ∩ 𝑋) = (𝐹𝑦))
193, 10, 183eqtr3rd 2842 . . . . 5 (𝜑 → (𝐹𝑦) = (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)))
2019adantr 484 . . . 4 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → (𝐹𝑦) = (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)))
21 paste.4 . . . . . 6 (𝜑𝐴 ∈ (Clsd‘𝐽))
22 paste.8 . . . . . . 7 (𝜑 → (𝐹𝐴) ∈ ((𝐽t 𝐴) Cn 𝐾))
23 cnclima 21873 . . . . . . 7 (((𝐹𝐴) ∈ ((𝐽t 𝐴) Cn 𝐾) ∧ 𝑦 ∈ (Clsd‘𝐾)) → ((𝐹𝐴) “ 𝑦) ∈ (Clsd‘(𝐽t 𝐴)))
2422, 23sylan 583 . . . . . 6 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → ((𝐹𝐴) “ 𝑦) ∈ (Clsd‘(𝐽t 𝐴)))
25 restcldr 21779 . . . . . 6 ((𝐴 ∈ (Clsd‘𝐽) ∧ ((𝐹𝐴) “ 𝑦) ∈ (Clsd‘(𝐽t 𝐴))) → ((𝐹𝐴) “ 𝑦) ∈ (Clsd‘𝐽))
2621, 24, 25syl2an2r 684 . . . . 5 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → ((𝐹𝐴) “ 𝑦) ∈ (Clsd‘𝐽))
27 paste.5 . . . . . 6 (𝜑𝐵 ∈ (Clsd‘𝐽))
28 paste.9 . . . . . . 7 (𝜑 → (𝐹𝐵) ∈ ((𝐽t 𝐵) Cn 𝐾))
29 cnclima 21873 . . . . . . 7 (((𝐹𝐵) ∈ ((𝐽t 𝐵) Cn 𝐾) ∧ 𝑦 ∈ (Clsd‘𝐾)) → ((𝐹𝐵) “ 𝑦) ∈ (Clsd‘(𝐽t 𝐵)))
3028, 29sylan 583 . . . . . 6 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → ((𝐹𝐵) “ 𝑦) ∈ (Clsd‘(𝐽t 𝐵)))
31 restcldr 21779 . . . . . 6 ((𝐵 ∈ (Clsd‘𝐽) ∧ ((𝐹𝐵) “ 𝑦) ∈ (Clsd‘(𝐽t 𝐵))) → ((𝐹𝐵) “ 𝑦) ∈ (Clsd‘𝐽))
3227, 30, 31syl2an2r 684 . . . . 5 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → ((𝐹𝐵) “ 𝑦) ∈ (Clsd‘𝐽))
33 uncld 21646 . . . . 5 ((((𝐹𝐴) “ 𝑦) ∈ (Clsd‘𝐽) ∧ ((𝐹𝐵) “ 𝑦) ∈ (Clsd‘𝐽)) → (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)) ∈ (Clsd‘𝐽))
3426, 32, 33syl2anc 587 . . . 4 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → (((𝐹𝐴) “ 𝑦) ∪ ((𝐹𝐵) “ 𝑦)) ∈ (Clsd‘𝐽))
3520, 34eqeltrd 2890 . . 3 ((𝜑𝑦 ∈ (Clsd‘𝐾)) → (𝐹𝑦) ∈ (Clsd‘𝐽))
3635ralrimiva 3149 . 2 (𝜑 → ∀𝑦 ∈ (Clsd‘𝐾)(𝐹𝑦) ∈ (Clsd‘𝐽))
37 cldrcl 21631 . . . 4 (𝐴 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
3821, 37syl 17 . . 3 (𝜑𝐽 ∈ Top)
39 cntop2 21846 . . . 4 ((𝐹𝐴) ∈ ((𝐽t 𝐴) Cn 𝐾) → 𝐾 ∈ Top)
4022, 39syl 17 . . 3 (𝜑𝐾 ∈ Top)
41 paste.1 . . . . 5 𝑋 = 𝐽
4241toptopon 21522 . . . 4 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
43 paste.2 . . . . 5 𝑌 = 𝐾
4443toptopon 21522 . . . 4 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
45 iscncl 21874 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑌)) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦 ∈ (Clsd‘𝐾)(𝐹𝑦) ∈ (Clsd‘𝐽))))
4642, 44, 45syl2anb 600 . . 3 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦 ∈ (Clsd‘𝐾)(𝐹𝑦) ∈ (Clsd‘𝐽))))
4738, 40, 46syl2anc 587 . 2 (𝜑 → (𝐹 ∈ (𝐽 Cn 𝐾) ↔ (𝐹:𝑋𝑌 ∧ ∀𝑦 ∈ (Clsd‘𝐾)(𝐹𝑦) ∈ (Clsd‘𝐽))))
481, 36, 47mpbir2and 712 1 (𝜑𝐹 ∈ (𝐽 Cn 𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wral 3106  cun 3879  cin 3880  wss 3881   cuni 4800  ccnv 5518  dom cdm 5519  ran crn 5520  cres 5521  cima 5522  Fun wfun 6318  wf 6320  cfv 6324  (class class class)co 7135  t crest 16686  Topctop 21498  TopOnctopon 21515  Clsdccld 21621   Cn ccn 21829
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-fin 8496  df-fi 8859  df-rest 16688  df-topgen 16709  df-top 21499  df-topon 21516  df-bases 21551  df-cld 21624  df-cn 21832
This theorem is referenced by:  cnmpopc  23533  cvmliftlem10  32654
  Copyright terms: Public domain W3C validator