Theorem 0lno 31257

Description: The zero operator is linear. (Contributed by NM, 28-Nov-2007.) (Revised by Mario Carneiro, 19-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
0lno.0	⊢ 𝑍 = (𝑈 0op 𝑊)
0lno.7	⊢ 𝐿 = (𝑈 LnOp 𝑊)

Assertion

Ref	Expression
0lno	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍 ∈ 𝐿)

Proof of Theorem 0lno

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2762	. . 3 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
2		eqid 2762	. . 3 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
3		0lno.0	. . 3 ⊢ 𝑍 = (𝑈 0op 𝑊)
4	1, 2, 3	0oo 31256	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:(BaseSet‘𝑈)⟶(BaseSet‘𝑊))
5		simplll 787	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → 𝑈 ∈ NrmCVec)
6		simpllr 788	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → 𝑊 ∈ NrmCVec)
7		simplr 781	. . . . . . . 8 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → 𝑥 ∈ ℂ)
8		simprl 783	. . . . . . . 8 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → 𝑦 ∈ (BaseSet‘𝑈))
9		eqid 2762	. . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
10	1, 9	nvscl 31093	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈))
11	5, 7, 8, 10	syl3anc 1398	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈))
12		simprr 785	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → 𝑧 ∈ (BaseSet‘𝑈))
13		eqid 2762	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈)
14	1, 13	nvgcl 31087	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
15	5, 11, 12, 14	syl3anc 1398	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
16		eqid 2762	. . . . . . 7 ⊢ (0vec‘𝑊) = (0vec‘𝑊)
17	1, 16, 3	0oval 31255	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈)) → (𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = (0vec‘𝑊))
18	5, 6, 15, 17	syl3anc 1398	. . . . 5 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = (0vec‘𝑊))
19	1, 16, 3	0oval 31255	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑍‘𝑦) = (0vec‘𝑊))
20	5, 6, 8, 19	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘𝑦) = (0vec‘𝑊))
21	20	oveq2d 7432	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦)) = (𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊)))
22	1, 16, 3	0oval 31255	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑍‘𝑧) = (0vec‘𝑊))
23	5, 6, 12, 22	syl3anc 1398	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘𝑧) = (0vec‘𝑊))
24	21, 23	oveq12d 7434	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊))( +𝑣 ‘𝑊)(0vec‘𝑊)))
25		eqid 2762	. . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊)
26	25, 16	nvsz 31105	. . . . . . . 8 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑥 ∈ ℂ) → (𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊)) = (0vec‘𝑊))
27	6, 7, 26	syl2anc 596	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊)) = (0vec‘𝑊))
28	27	oveq1d 7431	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊))( +𝑣 ‘𝑊)(0vec‘𝑊)) = ((0vec‘𝑊)( +𝑣 ‘𝑊)(0vec‘𝑊)))
29	2, 16	nvzcl 31101	. . . . . . 7 ⊢ (𝑊 ∈ NrmCVec → (0vec‘𝑊) ∈ (BaseSet‘𝑊))
30		eqid 2762	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊)
31	2, 30, 16	nv0rid 31102	. . . . . . 7 ⊢ ((𝑊 ∈ NrmCVec ∧ (0vec‘𝑊) ∈ (BaseSet‘𝑊)) → ((0vec‘𝑊)( +𝑣 ‘𝑊)(0vec‘𝑊)) = (0vec‘𝑊))
32	6, 29, 31	syl2anc2 597	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((0vec‘𝑊)( +𝑣 ‘𝑊)(0vec‘𝑊)) = (0vec‘𝑊))
33	24, 28, 32	3eqtrd 2801	. . . . 5 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)) = (0vec‘𝑊))
34	18, 33	eqtr4d 2800	. . . 4 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))
35	34	ralrimivva 3207	. . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) → ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)(𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))
36	35	ralrimiva 3156	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)(𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))
37		0lno.7	. . 3 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
38	1, 2, 13, 30, 9, 25, 37	islno 31220	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑍 ∈ 𝐿 ↔ (𝑍:(BaseSet‘𝑈)⟶(BaseSet‘𝑊) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)(𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))))
39	4, 36, 38	mpbir2and 726	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍 ∈ 𝐿)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416  ℂcc 11125  NrmCVeccnv 31051   +_𝑣 cpv 31052  BaseSetcba 31053   ·_𝑠OLD cns 31054  0_veccn0v 31055   LnOp clno 31207   0_op c0o 31210

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-er 8699  df-map 8831  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-ltxr 11275  df-grpo 30960  df-gid 30961  df-ginv 30962  df-ablo 31012  df-vc 31026  df-nv 31059  df-va 31062  df-ba 31063  df-sm 31064  df-0v 31065  df-nmcv 31067  df-lno 31211  df-0o 31214

This theorem is used by:  0blo  31259  nmlno0i  31261  blocn  31274