Theorem cnmpt2vsca 23346

Description: Continuity of scalar multiplication; analogue of cnmpt22f 22826 which cannot be used directly because ·_𝑠 is not a function. (Contributed by Mario Carneiro, 5-Oct-2015.)

Hypotheses

Ref	Expression
tlmtrg.f	⊢ 𝐹 = (Scalar‘𝑊)
cnmpt1vsca.t	⊢ · = ( ·𝑠 ‘𝑊)
cnmpt1vsca.j	⊢ 𝐽 = (TopOpen‘𝑊)
cnmpt1vsca.k	⊢ 𝐾 = (TopOpen‘𝐹)
cnmpt1vsca.w	⊢ (𝜑 → 𝑊 ∈ TopMod)
cnmpt1vsca.l	⊢ (𝜑 → 𝐿 ∈ (TopOn‘𝑋))
cnmpt2vsca.m	⊢ (𝜑 → 𝑀 ∈ (TopOn‘𝑌))
cnmpt2vsca.a	⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐿 ×t 𝑀) Cn 𝐾))
cnmpt2vsca.b	⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐿 ×t 𝑀) Cn 𝐽))

Assertion

Ref	Expression
cnmpt2vsca	⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴 · 𝐵)) ∈ ((𝐿 ×t 𝑀) Cn 𝐽))

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐽,𝑦   𝑥,𝐾,𝑦   𝑥,𝐿   𝜑,𝑥,𝑦   𝑥,𝑊,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   · (𝑥,𝑦)   𝐿(𝑦)   𝑀(𝑥,𝑦)

Proof of Theorem cnmpt2vsca

Step	Hyp	Ref	Expression
1		cnmpt1vsca.l	. . . . . . . . . 10 ⊢ (𝜑 → 𝐿 ∈ (TopOn‘𝑋))
2		cnmpt2vsca.m	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘𝑌))
3		txtopon 22742	. . . . . . . . . 10 ⊢ ((𝐿 ∈ (TopOn‘𝑋) ∧ 𝑀 ∈ (TopOn‘𝑌)) → (𝐿 ×t 𝑀) ∈ (TopOn‘(𝑋 × 𝑌)))
4	1, 2, 3	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝐿 ×t 𝑀) ∈ (TopOn‘(𝑋 × 𝑌)))
5		cnmpt1vsca.w	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ TopMod)
6		tlmtrg.f	. . . . . . . . . . . 12 ⊢ 𝐹 = (Scalar‘𝑊)
7	6	tlmscatps 23342	. . . . . . . . . . 11 ⊢ (𝑊 ∈ TopMod → 𝐹 ∈ TopSp)
8	5, 7	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ TopSp)
9		eqid 2738	. . . . . . . . . . 11 ⊢ (Base‘𝐹) = (Base‘𝐹)
10		cnmpt1vsca.k	. . . . . . . . . . 11 ⊢ 𝐾 = (TopOpen‘𝐹)
11	9, 10	istps 22083	. . . . . . . . . 10 ⊢ (𝐹 ∈ TopSp ↔ 𝐾 ∈ (TopOn‘(Base‘𝐹)))
12	8, 11	sylib 217	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘(Base‘𝐹)))
13		cnmpt2vsca.a	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐿 ×t 𝑀) Cn 𝐾))
14		cnf2 22400	. . . . . . . . 9 ⊢ (((𝐿 ×t 𝑀) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐾 ∈ (TopOn‘(Base‘𝐹)) ∧ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) ∈ ((𝐿 ×t 𝑀) Cn 𝐾)) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴):(𝑋 × 𝑌)⟶(Base‘𝐹))
15	4, 12, 13, 14	syl3anc 1370	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴):(𝑋 × 𝑌)⟶(Base‘𝐹))
16		eqid 2738	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴)
17	16	fmpo 7908	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐴 ∈ (Base‘𝐹) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐴):(𝑋 × 𝑌)⟶(Base‘𝐹))
18	15, 17	sylibr 233	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐴 ∈ (Base‘𝐹))
19	18	r19.21bi 3134	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝑌 𝐴 ∈ (Base‘𝐹))
20	19	r19.21bi 3134	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → 𝐴 ∈ (Base‘𝐹))
21		tlmtps 23339	. . . . . . . . . . 11 ⊢ (𝑊 ∈ TopMod → 𝑊 ∈ TopSp)
22	5, 21	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ TopSp)
23		eqid 2738	. . . . . . . . . . 11 ⊢ (Base‘𝑊) = (Base‘𝑊)
24		cnmpt1vsca.j	. . . . . . . . . . 11 ⊢ 𝐽 = (TopOpen‘𝑊)
25	23, 24	istps 22083	. . . . . . . . . 10 ⊢ (𝑊 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘(Base‘𝑊)))
26	22, 25	sylib 217	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(Base‘𝑊)))
27		cnmpt2vsca.b	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐿 ×t 𝑀) Cn 𝐽))
28		cnf2 22400	. . . . . . . . 9 ⊢ (((𝐿 ×t 𝑀) ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐽 ∈ (TopOn‘(Base‘𝑊)) ∧ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) ∈ ((𝐿 ×t 𝑀) Cn 𝐽)) → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵):(𝑋 × 𝑌)⟶(Base‘𝑊))
29	4, 26, 27, 28	syl3anc 1370	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵):(𝑋 × 𝑌)⟶(Base‘𝑊))
30		eqid 2738	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵)
31	30	fmpo 7908	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐵 ∈ (Base‘𝑊) ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐵):(𝑋 × 𝑌)⟶(Base‘𝑊))
32	29, 31	sylibr 233	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 𝐵 ∈ (Base‘𝑊))
33	32	r19.21bi 3134	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝑌 𝐵 ∈ (Base‘𝑊))
34	33	r19.21bi 3134	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → 𝐵 ∈ (Base‘𝑊))
35		eqid 2738	. . . . . 6 ⊢ ( ·sf ‘𝑊) = ( ·sf ‘𝑊)
36		cnmpt1vsca.t	. . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊)
37	23, 6, 9, 35, 36	scafval 20142	. . . . 5 ⊢ ((𝐴 ∈ (Base‘𝐹) ∧ 𝐵 ∈ (Base‘𝑊)) → (𝐴( ·sf ‘𝑊)𝐵) = (𝐴 · 𝐵))
38	20, 34, 37	syl2anc 584	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑦 ∈ 𝑌) → (𝐴( ·sf ‘𝑊)𝐵) = (𝐴 · 𝐵))
39	38	3impa 1109	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑌) → (𝐴( ·sf ‘𝑊)𝐵) = (𝐴 · 𝐵))
40	39	mpoeq3dva 7352	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴( ·sf ‘𝑊)𝐵)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴 · 𝐵)))
41	35, 24, 6, 10	vscacn 23337	. . . 4 ⊢ (𝑊 ∈ TopMod → ( ·sf ‘𝑊) ∈ ((𝐾 ×t 𝐽) Cn 𝐽))
42	5, 41	syl 17	. . 3 ⊢ (𝜑 → ( ·sf ‘𝑊) ∈ ((𝐾 ×t 𝐽) Cn 𝐽))
43	1, 2, 13, 27, 42	cnmpt22f 22826	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴( ·sf ‘𝑊)𝐵)) ∈ ((𝐿 ×t 𝑀) Cn 𝐽))
44	40, 43	eqeltrrd 2840	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ (𝐴 · 𝐵)) ∈ ((𝐿 ×t 𝑀) Cn 𝐽))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064   × cxp 5587  ⟶wf 6429  ‘cfv 6433  (class class class)co 7275   ∈ cmpo 7277  Basecbs 16912  Scalarcsca 16965   ·_𝑠 cvsca 16966  TopOpenctopn 17132   ·_sf cscaf 20124  TopOnctopon 22059  TopSpctps 22081   Cn ccn 22375   ×_t ctx 22711  TopModctlm 23309

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-map 8617  df-topgen 17154  df-scaf 20126  df-top 22043  df-topon 22060  df-topsp 22082  df-bases 22096  df-cn 22378  df-tx 22713  df-tmd 23223  df-tgp 23224  df-trg 23311  df-tlm 23313

This theorem is referenced by: (None)