Theorem lnolin 31413

Description: Basic linearity property of a linear operator. (Contributed by NM, 4-Dec-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lnoval.1	⊢ 𝑋 = (BaseSet‘𝑈)
lnoval.2	⊢ 𝑌 = (BaseSet‘𝑊)
lnoval.3	⊢ 𝐺 = ( +𝑣 ‘𝑈)
lnoval.4	⊢ 𝐻 = ( +𝑣 ‘𝑊)
lnoval.5	⊢ 𝑅 = ( ·𝑠OLD ‘𝑈)
lnoval.6	⊢ 𝑆 = ( ·𝑠OLD ‘𝑊)
lnoval.7	⊢ 𝐿 = (𝑈 LnOp 𝑊)

Assertion

Ref	Expression
lnolin	⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶)))

Proof of Theorem lnolin

Dummy variables 𝑢 𝑡 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lnoval.1	. . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈)
2		lnoval.2	. . . . 5 ⊢ 𝑌 = (BaseSet‘𝑊)
3		lnoval.3	. . . . 5 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
4		lnoval.4	. . . . 5 ⊢ 𝐻 = ( +𝑣 ‘𝑊)
5		lnoval.5	. . . . 5 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑈)
6		lnoval.6	. . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑊)
7		lnoval.7	. . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
8	1, 2, 3, 4, 5, 6, 7	islno 31412	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐿 ↔ (𝑇:𝑋⟶𝑌 ∧ ∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)))))
9	8	biimp3a 1499	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇:𝑋⟶𝑌 ∧ ∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡))))
10	9	simprd 501	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)))
11		oveq1 7458	. . . . 5 ⊢ (𝑢 = 𝐴 → (𝑢𝑅𝑤) = (𝐴𝑅𝑤))
12	11	fvoveq1d 7473	. . . 4 ⊢ (𝑢 = 𝐴 → (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)))
13		oveq1 7458	. . . . 5 ⊢ (𝑢 = 𝐴 → (𝑢𝑆(𝑇‘𝑤)) = (𝐴𝑆(𝑇‘𝑤)))
14	13	oveq1d 7466	. . . 4 ⊢ (𝑢 = 𝐴 → ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) = ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)))
15	12, 14	eqeq12d 2779	. . 3 ⊢ (𝑢 = 𝐴 → ((𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) ↔ (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡))))
16		oveq2 7459	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝐴𝑅𝑤) = (𝐴𝑅𝐵))
17	16	fvoveq1d 7473	. . . 4 ⊢ (𝑤 = 𝐵 → (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)))
18		fveq2 6916	. . . . . 6 ⊢ (𝑤 = 𝐵 → (𝑇‘𝑤) = (𝑇‘𝐵))
19	18	oveq2d 7467	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝐴𝑆(𝑇‘𝑤)) = (𝐴𝑆(𝑇‘𝐵)))
20	19	oveq1d 7466	. . . 4 ⊢ (𝑤 = 𝐵 → ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡)))
21	17, 20	eqeq12d 2779	. . 3 ⊢ (𝑤 = 𝐵 → ((𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) ↔ (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡))))
22		oveq2 7459	. . . . 5 ⊢ (𝑡 = 𝐶 → ((𝐴𝑅𝐵)𝐺𝑡) = ((𝐴𝑅𝐵)𝐺𝐶))
23	22	fveq2d 6920	. . . 4 ⊢ (𝑡 = 𝐶 → (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)))
24		fveq2 6916	. . . . 5 ⊢ (𝑡 = 𝐶 → (𝑇‘𝑡) = (𝑇‘𝐶))
25	24	oveq2d 7467	. . . 4 ⊢ (𝑡 = 𝐶 → ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶)))
26	23, 25	eqeq12d 2779	. . 3 ⊢ (𝑡 = 𝐶 → ((𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡)) ↔ (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶))))
27	15, 21, 26	rspc3v 3595	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶))))
28	10, 27	mpan9 516	1 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ℂcc 11237  NrmCVeccnv 31243   +_𝑣 cpv 31244  BaseSetcba 31245   ·_𝑠OLD cns 31246   LnOp clno 31399

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-lno 31403

This theorem is used by:  lno0  31415  lnocoi  31416  lnoadd  31417  lnosub  31418  lnomul  31419