Theorem lnolin 31235

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 31234	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐿 ↔ (𝑇:𝑋⟶𝑌 ∧ ∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)))))
9	8	biimp3a 1498	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇:𝑋⟶𝑌 ∧ ∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡))))
10	9	simprd 501	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → ∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)))
11		oveq1 7420	. . . . 5 ⊢ (𝑢 = 𝐴 → (𝑢𝑅𝑤) = (𝐴𝑅𝑤))
12	11	fvoveq1d 7435	. . . 4 ⊢ (𝑢 = 𝐴 → (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)))
13		oveq1 7420	. . . . 5 ⊢ (𝑢 = 𝐴 → (𝑢𝑆(𝑇‘𝑤)) = (𝐴𝑆(𝑇‘𝑤)))
14	13	oveq1d 7428	. . . 4 ⊢ (𝑢 = 𝐴 → ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) = ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)))
15	12, 14	eqeq12d 2776	. . 3 ⊢ (𝑢 = 𝐴 → ((𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) ↔ (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡))))
16		oveq2 7421	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝐴𝑅𝑤) = (𝐴𝑅𝐵))
17	16	fvoveq1d 7435	. . . 4 ⊢ (𝑤 = 𝐵 → (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)))
18		fveq2 6878	. . . . . 6 ⊢ (𝑤 = 𝐵 → (𝑇‘𝑤) = (𝑇‘𝐵))
19	18	oveq2d 7429	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝐴𝑆(𝑇‘𝑤)) = (𝐴𝑆(𝑇‘𝐵)))
20	19	oveq1d 7428	. . . 4 ⊢ (𝑤 = 𝐵 → ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡)))
21	17, 20	eqeq12d 2776	. . 3 ⊢ (𝑤 = 𝐵 → ((𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) ↔ (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡))))
22		oveq2 7421	. . . . 5 ⊢ (𝑡 = 𝐶 → ((𝐴𝑅𝐵)𝐺𝑡) = ((𝐴𝑅𝐵)𝐺𝐶))
23	22	fveq2d 6882	. . . 4 ⊢ (𝑡 = 𝐶 → (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)))
24		fveq2 6878	. . . . 5 ⊢ (𝑡 = 𝐶 → (𝑇‘𝑡) = (𝑇‘𝐶))
25	24	oveq2d 7429	. . . 4 ⊢ (𝑡 = 𝐶 → ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶)))
26	23, 25	eqeq12d 2776	. . 3 ⊢ (𝑡 = 𝐶 → ((𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝑡)) ↔ (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶))))
27	15, 21, 26	rspc3v 3592	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑢 ∈ ℂ ∀𝑤 ∈ 𝑋 ∀𝑡 ∈ 𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇‘𝑤))𝐻(𝑇‘𝑡)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶))))
28	10, 27	mpan9 516	1 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇‘𝐵))𝐻(𝑇‘𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413  ℂcc 11122  NrmCVeccnv 31065   +_𝑣 cpv 31066  BaseSetcba 31067   ·_𝑠OLD cns 31068   LnOp clno 31221

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-map 8828  df-lno 31225

This theorem is used by:  lno0  31237  lnocoi  31238  lnoadd  31239  lnosub  31240  lnomul  31241