Theorem lfli 40384

Description: Property of a linear functional. (lnfnli 32699 analog.) (Contributed by NM, 16-Apr-2014.)

Hypotheses

Ref	Expression
lflset.v	⊢ 𝑉 = (Base‘𝑊)
lflset.a	⊢ + = (+g‘𝑊)
lflset.d	⊢ 𝐷 = (Scalar‘𝑊)
lflset.s	⊢ · = ( ·𝑠 ‘𝑊)
lflset.k	⊢ 𝐾 = (Base‘𝐷)
lflset.p	⊢ ⨣ = (+g‘𝐷)
lflset.t	⊢ × = (.r‘𝐷)
lflset.f	⊢ 𝐹 = (LFnl‘𝑊)

Assertion

Ref	Expression
lfli	⊢ ((𝑊 ∈ 𝑍 ∧ 𝐺 ∈ 𝐹 ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘((𝑅 · 𝑋) + 𝑌)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑌)))

Proof of Theorem lfli

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

Step	Hyp	Ref	Expression
1		lflset.v	. . . . 5 ⊢ 𝑉 = (Base‘𝑊)
2		lflset.a	. . . . 5 ⊢ + = (+g‘𝑊)
3		lflset.d	. . . . 5 ⊢ 𝐷 = (Scalar‘𝑊)
4		lflset.s	. . . . 5 ⊢ · = ( ·𝑠 ‘𝑊)
5		lflset.k	. . . . 5 ⊢ 𝐾 = (Base‘𝐷)
6		lflset.p	. . . . 5 ⊢ ⨣ = (+g‘𝐷)
7		lflset.t	. . . . 5 ⊢ × = (.r‘𝐷)
8		lflset.f	. . . . 5 ⊢ 𝐹 = (LFnl‘𝑊)
9	1, 2, 3, 4, 5, 6, 7, 8	islfl 40383	. . . 4 ⊢ (𝑊 ∈ 𝑍 → (𝐺 ∈ 𝐹 ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))))
10	9	simplbda 505	. . 3 ⊢ ((𝑊 ∈ 𝑍 ∧ 𝐺 ∈ 𝐹) → ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))
11	10	3adant3 1150	. 2 ⊢ ((𝑊 ∈ 𝑍 ∧ 𝐺 ∈ 𝐹 ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))
12		oveq1 7458	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑟 · 𝑥) = (𝑅 · 𝑥))
13	12	fvoveq1d 7473	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝐺‘((𝑟 · 𝑥) + 𝑦)) = (𝐺‘((𝑅 · 𝑥) + 𝑦)))
14		oveq1 7458	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑟 × (𝐺‘𝑥)) = (𝑅 × (𝐺‘𝑥)))
15	14	oveq1d 7466	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)) = ((𝑅 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))
16	13, 15	eqeq12d 2779	. . . 4 ⊢ (𝑟 = 𝑅 → ((𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)) ↔ (𝐺‘((𝑅 · 𝑥) + 𝑦)) = ((𝑅 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
17		oveq2 7459	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑅 · 𝑥) = (𝑅 · 𝑋))
18	17	fvoveq1d 7473	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝐺‘((𝑅 · 𝑥) + 𝑦)) = (𝐺‘((𝑅 · 𝑋) + 𝑦)))
19		fveq2 6916	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋))
20	19	oveq2d 7467	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑅 × (𝐺‘𝑥)) = (𝑅 × (𝐺‘𝑋)))
21	20	oveq1d 7466	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑅 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑦)))
22	18, 21	eqeq12d 2779	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝐺‘((𝑅 · 𝑥) + 𝑦)) = ((𝑅 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)) ↔ (𝐺‘((𝑅 · 𝑋) + 𝑦)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑦))))
23		oveq2 7459	. . . . . 6 ⊢ (𝑦 = 𝑌 → ((𝑅 · 𝑋) + 𝑦) = ((𝑅 · 𝑋) + 𝑌))
24	23	fveq2d 6920	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝐺‘((𝑅 · 𝑋) + 𝑦)) = (𝐺‘((𝑅 · 𝑋) + 𝑌)))
25		fveq2 6916	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝐺‘𝑦) = (𝐺‘𝑌))
26	25	oveq2d 7467	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑦)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑌)))
27	24, 26	eqeq12d 2779	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐺‘((𝑅 · 𝑋) + 𝑦)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑦)) ↔ (𝐺‘((𝑅 · 𝑋) + 𝑌)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑌))))
28	16, 22, 27	rspc3v 3595	. . 3 ⊢ ((𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)) → (𝐺‘((𝑅 · 𝑋) + 𝑌)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑌))))
29	28	3ad2ant3 1153	. 2 ⊢ ((𝑊 ∈ 𝑍 ∧ 𝐺 ∈ 𝐹 ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)) → (𝐺‘((𝑅 · 𝑋) + 𝑌)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑌))))
30	11, 29	mpd 16	1 ⊢ ((𝑊 ∈ 𝑍 ∧ 𝐺 ∈ 𝐹 ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘((𝑅 · 𝑋) + 𝑌)) = ((𝑅 × (𝐺‘𝑋)) ⨣ (𝐺‘𝑌)))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +_gcplusg 17472  ._rcmulr 17473  Scalarcsca 17475   ·_𝑠 cvsca 17476  LFnlclfn 40380

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-mpt 5193  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-lfl 40381

This theorem is used by:  lfl0  40388  lfladd  40389  lflsub  40390  lflmul  40391  lflnegcl  40398  lflvscl  40400  lkrlss  40418  hdmapln1  43229