vmcn - Metamath Proof Explorer

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

Theorem vmcn 30786

Description: Vector subtraction is jointly continuous in both arguments. (Contributed by Mario Carneiro, 6-May-2014.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
vmcn.c	⊢ 𝐶 = (IndMet‘𝑈)
vmcn.j	⊢ 𝐽 = (MetOpen‘𝐶)
vmcn.m	⊢ 𝑀 = ( −_𝑣 ‘𝑈)

**Assertion**
Ref	Expression
vmcn	⊢ (𝑈 ∈ NrmCVec → 𝑀 ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))

Proof of Theorem vmcn Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . 3 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
2		eqid 2737	. . 3 ⊢ ( +_𝑣 ‘𝑈) = ( +_𝑣 ‘𝑈)
3		eqid 2737	. . 3 ⊢ ( ·_𝑠OLD ‘𝑈) = ( ·_𝑠OLD ‘𝑈)
4		vmcn.m	. . 3 ⊢ 𝑀 = ( −_𝑣 ‘𝑈)
5	1, 2, 3, 4	nvmfval 30731	. 2 ⊢ (𝑈 ∈ NrmCVec → 𝑀 = (𝑥 ∈ (BaseSet‘𝑈), 𝑦 ∈ (BaseSet‘𝑈) ↦ (𝑥( +_𝑣 ‘𝑈)(-1( ·_𝑠OLD ‘𝑈)𝑦))))
6		vmcn.c	. . . . 5 ⊢ 𝐶 = (IndMet‘𝑈)
7	1, 6	imsxmet 30779	. . . 4 ⊢ (𝑈 ∈ NrmCVec → 𝐶 ∈ (∞Met‘(BaseSet‘𝑈)))
8		vmcn.j	. . . . 5 ⊢ 𝐽 = (MetOpen‘𝐶)
9	8	mopntopon 24395	. . . 4 ⊢ (𝐶 ∈ (∞Met‘(BaseSet‘𝑈)) → 𝐽 ∈ (TopOn‘(BaseSet‘𝑈)))
10	7, 9	syl 17	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐽 ∈ (TopOn‘(BaseSet‘𝑈)))
11	10, 10	cnmpt1st 23624	. . 3 ⊢ (𝑈 ∈ NrmCVec → (𝑥 ∈ (BaseSet‘𝑈), 𝑦 ∈ (BaseSet‘𝑈) ↦ 𝑥) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
12		eqid 2737	. . . . . . 7 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
13	12	cnfldtopon 24738	. . . . . 6 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
14	13	a1i 11	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
15		neg1cn 12142	. . . . . 6 ⊢ -1 ∈ ℂ
16	15	a1i 11	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → -1 ∈ ℂ)
17	10, 10, 14, 16	cnmpt2c 23626	. . . 4 ⊢ (𝑈 ∈ NrmCVec → (𝑥 ∈ (BaseSet‘𝑈), 𝑦 ∈ (BaseSet‘𝑈) ↦ -1) ∈ ((𝐽 ×_t 𝐽) Cn (TopOpen‘ℂ_fld)))
18	10, 10	cnmpt2nd 23625	. . . 4 ⊢ (𝑈 ∈ NrmCVec → (𝑥 ∈ (BaseSet‘𝑈), 𝑦 ∈ (BaseSet‘𝑈) ↦ 𝑦) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
19	6, 8, 3, 12	smcn 30785	. . . 4 ⊢ (𝑈 ∈ NrmCVec → ( ·_𝑠OLD ‘𝑈) ∈ (((TopOpen‘ℂ_fld) ×_t 𝐽) Cn 𝐽))
20	10, 10, 17, 18, 19	cnmpt22f 23631	. . 3 ⊢ (𝑈 ∈ NrmCVec → (𝑥 ∈ (BaseSet‘𝑈), 𝑦 ∈ (BaseSet‘𝑈) ↦ (-1( ·_𝑠OLD ‘𝑈)𝑦)) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
21	6, 8, 2	vacn 30781	. . 3 ⊢ (𝑈 ∈ NrmCVec → ( +_𝑣 ‘𝑈) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
22	10, 10, 11, 20, 21	cnmpt22f 23631	. 2 ⊢ (𝑈 ∈ NrmCVec → (𝑥 ∈ (BaseSet‘𝑈), 𝑦 ∈ (BaseSet‘𝑈) ↦ (𝑥( +_𝑣 ‘𝑈)(-1( ·_𝑠OLD ‘𝑈)𝑦))) ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))
23	5, 22	eqeltrd 2837	1 ⊢ (𝑈 ∈ NrmCVec → 𝑀 ∈ ((𝐽 ×_t 𝐽) Cn 𝐽))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 ℂcc 11036 1c1 11039 -cneg 11377 TopOpenctopn 17353 ∞Metcxmet 21306 MetOpencmopn 21311 ℂ_fldccnfld 21321 TopOnctopon 22866 Cn ccn 23180 ×_t ctx 23516 NrmCVeccnv 30671 +_𝑣 cpv 30672 BaseSetcba 30673 ·_𝑠OLD cns 30674 −_𝑣 cnsb 30676 IndMetcims 30678

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 ax-mulf 11118

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-om 7819 df-1st 7943 df-2nd 7944 df-supp 8113 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9277 df-fi 9326 df-sup 9357 df-inf 9358 df-oi 9427 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-q 12874 df-rp 12918 df-xneg 13038 df-xadd 13039 df-xmul 13040 df-icc 13280 df-fz 13436 df-fzo 13583 df-seq 13937 df-exp 13997 df-hash 14266 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-mulr 17203 df-starv 17204 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-unif 17212 df-hom 17213 df-cco 17214 df-rest 17354 df-topn 17355 df-0g 17373 df-gsum 17374 df-topgen 17375 df-pt 17376 df-prds 17379 df-xrs 17435 df-qtop 17440 df-imas 17441 df-xps 17443 df-mre 17517 df-mrc 17518 df-acs 17520 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-submnd 18721 df-mulg 19010 df-cntz 19258 df-cmn 19723 df-psmet 21313 df-xmet 21314 df-met 21315 df-bl 21316 df-mopn 21317 df-cnfld 21322 df-top 22850 df-topon 22867 df-topsp 22889 df-bases 22902 df-cn 23183 df-cnp 23184 df-tx 23518 df-hmeo 23711 df-xms 24276 df-ms 24277 df-tms 24278 df-grpo 30580 df-gid 30581 df-ginv 30582 df-gdiv 30583 df-ablo 30632 df-vc 30646 df-nv 30679 df-va 30682 df-ba 30683 df-sm 30684 df-0v 30685 df-vs 30686 df-nmcv 30687 df-ims 30688

This theorem is referenced by: hmopidmchi 32238

W3C validator