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

Theorem cnpco 22164
Description: The composition of a function 𝐹 continuous at 𝑃 with a function continuous at (𝐹𝑃) is continuous at 𝑃. Proposition 2 of [BourbakiTop1] p. I.9. (Contributed by FL, 16-Nov-2006.) (Proof shortened by Mario Carneiro, 27-Dec-2014.)
Assertion
Ref Expression
cnpco ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → (𝐺𝐹) ∈ ((𝐽 CnP 𝐿)‘𝑃))

Proof of Theorem cnpco
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnptop1 22139 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
21adantr 484 . . 3 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → 𝐽 ∈ Top)
3 cnptop2 22140 . . . 4 (𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃)) → 𝐿 ∈ Top)
43adantl 485 . . 3 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → 𝐿 ∈ Top)
5 eqid 2737 . . . . 5 𝐽 = 𝐽
65cnprcl 22142 . . . 4 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝑃 𝐽)
76adantr 484 . . 3 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → 𝑃 𝐽)
82, 4, 73jca 1130 . 2 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → (𝐽 ∈ Top ∧ 𝐿 ∈ Top ∧ 𝑃 𝐽))
9 eqid 2737 . . . . . 6 𝐾 = 𝐾
10 eqid 2737 . . . . . 6 𝐿 = 𝐿
119, 10cnpf 22144 . . . . 5 (𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃)) → 𝐺: 𝐾 𝐿)
1211adantl 485 . . . 4 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → 𝐺: 𝐾 𝐿)
135, 9cnpf 22144 . . . . 5 (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐹: 𝐽 𝐾)
1413adantr 484 . . . 4 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → 𝐹: 𝐽 𝐾)
15 fco 6569 . . . 4 ((𝐺: 𝐾 𝐿𝐹: 𝐽 𝐾) → (𝐺𝐹): 𝐽 𝐿)
1612, 14, 15syl2anc 587 . . 3 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → (𝐺𝐹): 𝐽 𝐿)
17 simplr 769 . . . . . . 7 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃)))
18 simprl 771 . . . . . . 7 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → 𝑧𝐿)
19 fvco3 6810 . . . . . . . . . 10 ((𝐹: 𝐽 𝐾𝑃 𝐽) → ((𝐺𝐹)‘𝑃) = (𝐺‘(𝐹𝑃)))
2014, 7, 19syl2anc 587 . . . . . . . . 9 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → ((𝐺𝐹)‘𝑃) = (𝐺‘(𝐹𝑃)))
2120adantr 484 . . . . . . . 8 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → ((𝐺𝐹)‘𝑃) = (𝐺‘(𝐹𝑃)))
22 simprr 773 . . . . . . . 8 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → ((𝐺𝐹)‘𝑃) ∈ 𝑧)
2321, 22eqeltrrd 2839 . . . . . . 7 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → (𝐺‘(𝐹𝑃)) ∈ 𝑧)
24 cnpimaex 22153 . . . . . . 7 ((𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃)) ∧ 𝑧𝐿 ∧ (𝐺‘(𝐹𝑃)) ∈ 𝑧) → ∃𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))
2517, 18, 23, 24syl3anc 1373 . . . . . 6 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → ∃𝑦𝐾 ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))
26 simplll 775 . . . . . . . 8 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃))
27 simprl 771 . . . . . . . 8 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → 𝑦𝐾)
28 simprrl 781 . . . . . . . 8 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → (𝐹𝑃) ∈ 𝑦)
29 cnpimaex 22153 . . . . . . . 8 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦𝐾 ∧ (𝐹𝑃) ∈ 𝑦) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦))
3026, 27, 28, 29syl3anc 1373 . . . . . . 7 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → ∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦))
31 imaco 6115 . . . . . . . . . . 11 ((𝐺𝐹) “ 𝑥) = (𝐺 “ (𝐹𝑥))
32 imass2 5970 . . . . . . . . . . 11 ((𝐹𝑥) ⊆ 𝑦 → (𝐺 “ (𝐹𝑥)) ⊆ (𝐺𝑦))
3331, 32eqsstrid 3949 . . . . . . . . . 10 ((𝐹𝑥) ⊆ 𝑦 → ((𝐺𝐹) “ 𝑥) ⊆ (𝐺𝑦))
34 simprrr 782 . . . . . . . . . 10 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → (𝐺𝑦) ⊆ 𝑧)
35 sstr2 3908 . . . . . . . . . 10 (((𝐺𝐹) “ 𝑥) ⊆ (𝐺𝑦) → ((𝐺𝑦) ⊆ 𝑧 → ((𝐺𝐹) “ 𝑥) ⊆ 𝑧))
3633, 34, 35syl2imc 41 . . . . . . . . 9 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → ((𝐹𝑥) ⊆ 𝑦 → ((𝐺𝐹) “ 𝑥) ⊆ 𝑧))
3736anim2d 615 . . . . . . . 8 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → ((𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧)))
3837reximdv 3192 . . . . . . 7 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → (∃𝑥𝐽 (𝑃𝑥 ∧ (𝐹𝑥) ⊆ 𝑦) → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧)))
3930, 38mpd 15 . . . . . 6 ((((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) ∧ (𝑦𝐾 ∧ ((𝐹𝑃) ∈ 𝑦 ∧ (𝐺𝑦) ⊆ 𝑧))) → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧))
4025, 39rexlimddv 3210 . . . . 5 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ (𝑧𝐿 ∧ ((𝐺𝐹)‘𝑃) ∈ 𝑧)) → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧))
4140expr 460 . . . 4 (((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) ∧ 𝑧𝐿) → (((𝐺𝐹)‘𝑃) ∈ 𝑧 → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧)))
4241ralrimiva 3105 . . 3 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → ∀𝑧𝐿 (((𝐺𝐹)‘𝑃) ∈ 𝑧 → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧)))
4316, 42jca 515 . 2 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → ((𝐺𝐹): 𝐽 𝐿 ∧ ∀𝑧𝐿 (((𝐺𝐹)‘𝑃) ∈ 𝑧 → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧))))
445, 10iscnp2 22136 . 2 ((𝐺𝐹) ∈ ((𝐽 CnP 𝐿)‘𝑃) ↔ ((𝐽 ∈ Top ∧ 𝐿 ∈ Top ∧ 𝑃 𝐽) ∧ ((𝐺𝐹): 𝐽 𝐿 ∧ ∀𝑧𝐿 (((𝐺𝐹)‘𝑃) ∈ 𝑧 → ∃𝑥𝐽 (𝑃𝑥 ∧ ((𝐺𝐹) “ 𝑥) ⊆ 𝑧)))))
458, 43, 44sylanbrc 586 1 ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝐺 ∈ ((𝐾 CnP 𝐿)‘(𝐹𝑃))) → (𝐺𝐹) ∈ ((𝐽 CnP 𝐿)‘𝑃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  wral 3061  wrex 3062  wss 3866   cuni 4819  cima 5554  ccom 5555  wf 6376  cfv 6380  (class class class)co 7213  Topctop 21790   CnP ccnp 22122
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-iun 4906  df-br 5054  df-opab 5116  df-mpt 5136  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-fv 6388  df-ov 7216  df-oprab 7217  df-mpo 7218  df-1st 7761  df-2nd 7762  df-map 8510  df-top 21791  df-topon 21808  df-cnp 22125
This theorem is referenced by:  limccnp  24788  limccnp2  24789  efrlim  25852
  Copyright terms: Public domain W3C validator