Theorem 0lno 31392

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 2760	. . 3 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
2		eqid 2760	. . 3 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊)
3		0lno.0	. . 3 ⊢ 𝑍 = (𝑈 0op 𝑊)
4	1, 2, 3	0oo 31391	. 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 2760	. . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈)
10	1, 9	nvscl 31228	. . . . . . . 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 2760	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈)
14	1, 13	nvgcl 31222	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝑥( ·𝑠OLD ‘𝑈)𝑦) ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈)) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
15	5, 11, 12, 14	syl3anc 1398	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧) ∈ (BaseSet‘𝑈))
16		eqid 2760	. . . . . . 7 ⊢ (0vec‘𝑊) = (0vec‘𝑊)
17	1, 16, 3	0oval 31390	. . . . . 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 31390	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑦 ∈ (BaseSet‘𝑈)) → (𝑍‘𝑦) = (0vec‘𝑊))
20	5, 6, 8, 19	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘𝑦) = (0vec‘𝑊))
21	20	oveq2d 7436	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦)) = (𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊)))
22	1, 16, 3	0oval 31390	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑧 ∈ (BaseSet‘𝑈)) → (𝑍‘𝑧) = (0vec‘𝑊))
23	5, 6, 12, 22	syl3anc 1398	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘𝑧) = (0vec‘𝑊))
24	21, 23	oveq12d 7438	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊))( +𝑣 ‘𝑊)(0vec‘𝑊)))
25		eqid 2760	. . . . . . . . 9 ⊢ ( ·𝑠OLD ‘𝑊) = ( ·𝑠OLD ‘𝑊)
26	25, 16	nvsz 31240	. . . . . . . 8 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑥 ∈ ℂ) → (𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊)) = (0vec‘𝑊))
27	6, 7, 26	syl2anc 596	. . . . . . 7 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊)) = (0vec‘𝑊))
28	27	oveq1d 7435	. . . . . 6 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑊)(0vec‘𝑊))( +𝑣 ‘𝑊)(0vec‘𝑊)) = ((0vec‘𝑊)( +𝑣 ‘𝑊)(0vec‘𝑊)))
29	2, 16	nvzcl 31236	. . . . . . 7 ⊢ (𝑊 ∈ NrmCVec → (0vec‘𝑊) ∈ (BaseSet‘𝑊))
30		eqid 2760	. . . . . . . 8 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊)
31	2, 30, 16	nv0rid 31237	. . . . . . 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 2799	. . . . 5 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)) = (0vec‘𝑊))
34	18, 33	eqtr4d 2798	. . . 4 ⊢ ((((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) ∧ (𝑦 ∈ (BaseSet‘𝑈) ∧ 𝑧 ∈ (BaseSet‘𝑈))) → (𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))
35	34	ralrimivva 3205	. . 3 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) ∧ 𝑥 ∈ ℂ) → ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)(𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))
36	35	ralrimiva 3154	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑈)∀𝑧 ∈ (BaseSet‘𝑈)(𝑍‘((𝑥( ·𝑠OLD ‘𝑈)𝑦)( +𝑣 ‘𝑈)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑊)(𝑍‘𝑦))( +𝑣 ‘𝑊)(𝑍‘𝑧)))
37		0lno.7	. . 3 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
38	1, 2, 13, 30, 9, 25, 37	islno 31355	. 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 1569   ∈ wcel 2144  ∀wral 3076  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  ℂcc 11198  NrmCVeccnv 31186   +_𝑣 cpv 31187  BaseSetcba 31188   ·_𝑠OLD cns 31189  0_veccn0v 31190   LnOp clno 31342   0_op c0o 31345

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-po 5558  df-so 5559  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-er 8717  df-map 8849  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-ltxr 11348  df-grpo 31095  df-gid 31096  df-ginv 31097  df-ablo 31147  df-vc 31161  df-nv 31194  df-va 31197  df-ba 31198  df-sm 31199  df-0v 31200  df-nmcv 31202  df-lno 31346  df-0o 31349

This theorem is used by:  0blo  31394  nmlno0i  31396  blocn  31409