nv0 - Metamath Proof Explorer

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

Theorem nv0 30930

Description: Zero times a vector is the zero vector. (Contributed by NM, 27-Nov-2007.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nv0.1	⊢ 𝑋 = (BaseSet‘𝑈)
nv0.4	⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
nv0.6	⊢ 𝑍 = (0_vec‘𝑈)

**Assertion**
Ref	Expression
nv0	⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0𝑆𝐴) = 𝑍)

**Proof of Theorem nv0**
Step	Hyp	Ref	Expression
1		eqid 2769	. . . 4 ⊢ (1^st ‘𝑈) = (1^st ‘𝑈)
2	1	nvvc 30908	. . 3 ⊢ (𝑈 ∈ NrmCVec → (1^st ‘𝑈) ∈ CVec_OLD)
3		eqid 2769	. . . . 5 ⊢ ( +_𝑣 ‘𝑈) = ( +_𝑣 ‘𝑈)
4	3	vafval 30896	. . . 4 ⊢ ( +_𝑣 ‘𝑈) = (1^st ‘(1^st ‘𝑈))
5		nv0.4	. . . . 5 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑈)
6	5	smfval 30898	. . . 4 ⊢ 𝑆 = (2^nd ‘(1^st ‘𝑈))
7		nv0.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
8	7, 3	bafval 30897	. . . 4 ⊢ 𝑋 = ran ( +_𝑣 ‘𝑈)
9		eqid 2769	. . . 4 ⊢ (GId‘( +_𝑣 ‘𝑈)) = (GId‘( +_𝑣 ‘𝑈))
10	4, 6, 8, 9	vc0 30867	. . 3 ⊢ (((1^st ‘𝑈) ∈ CVec_OLD ∧ 𝐴 ∈ 𝑋) → (0𝑆𝐴) = (GId‘( +_𝑣 ‘𝑈)))
11	2, 10	sylan 591	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0𝑆𝐴) = (GId‘( +_𝑣 ‘𝑈)))
12		nv0.6	. . . 4 ⊢ 𝑍 = (0_vec‘𝑈)
13	3, 12	0vfval 30899	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝑍 = (GId‘( +_𝑣 ‘𝑈)))
14	13	adantr 485	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → 𝑍 = (GId‘( +_𝑣 ‘𝑈)))
15	11, 14	eqtr4d 2807	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (0𝑆𝐴) = 𝑍)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 1^st c1st 7984 0cc0 11100 GIdcgi 30783 CVec_OLDcvc 30851 NrmCVeccnv 30877 +_𝑣 cpv 30878 BaseSetcba 30879 ·_𝑠OLD cns 30880 0_veccn0v 30881

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-po 5570 df-so 5571 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-1st 7986 df-2nd 7987 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-ltxr 11248 df-grpo 30786 df-gid 30787 df-ginv 30788 df-ablo 30838 df-vc 30852 df-nv 30885 df-va 30888 df-ba 30889 df-sm 30890 df-0v 30891 df-nmcv 30893

This theorem is referenced by: nvmul0or 30943 nvz0 30961 nvge0 30966 ipasslem1 31124 hlmul0 31202

W3C validator