Theorem islfl 39834

Description: The predicate "is a linear functional". (Contributed by NM, 15-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
islfl	⊢ (𝑊 ∈ 𝑋 → (𝐺 ∈ 𝐹 ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))))

Distinct variable groups:   𝐾,𝑟   𝑥,𝑦,𝑉   𝑥,𝑟,𝑦,𝑊   𝐺,𝑟,𝑥,𝑦

Allowed substitution hints:   𝐷(𝑥,𝑦,𝑟)   + (𝑥,𝑦,𝑟)   ⨣ (𝑥,𝑦,𝑟)   · (𝑥,𝑦,𝑟)   × (𝑥,𝑦,𝑟)   𝐹(𝑥,𝑦,𝑟)   𝐾(𝑥,𝑦)   𝑉(𝑟)   𝑋(𝑥,𝑦,𝑟)

Proof of Theorem islfl

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lflset.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
2		lflset.a	. . . 4 ⊢ + = (+g‘𝑊)
3		lflset.d	. . . 4 ⊢ 𝐷 = (Scalar‘𝑊)
4		lflset.s	. . . 4 ⊢ · = ( ·𝑠 ‘𝑊)
5		lflset.k	. . . 4 ⊢ 𝐾 = (Base‘𝐷)
6		lflset.p	. . . 4 ⊢ ⨣ = (+g‘𝐷)
7		lflset.t	. . . 4 ⊢ × = (.r‘𝐷)
8		lflset.f	. . . 4 ⊢ 𝐹 = (LFnl‘𝑊)
9	1, 2, 3, 4, 5, 6, 7, 8	lflset 39833	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝐹 = {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))})
10	9	eleq2d 2849	. 2 ⊢ (𝑊 ∈ 𝑋 → (𝐺 ∈ 𝐹 ↔ 𝐺 ∈ {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))}))
11		fveq1 6880	. . . . . . 7 ⊢ (𝑓 = 𝐺 → (𝑓‘((𝑟 · 𝑥) + 𝑦)) = (𝐺‘((𝑟 · 𝑥) + 𝑦)))
12		fveq1 6880	. . . . . . . . 9 ⊢ (𝑓 = 𝐺 → (𝑓‘𝑥) = (𝐺‘𝑥))
13	12	oveq2d 7426	. . . . . . . 8 ⊢ (𝑓 = 𝐺 → (𝑟 × (𝑓‘𝑥)) = (𝑟 × (𝐺‘𝑥)))
14		fveq1 6880	. . . . . . . 8 ⊢ (𝑓 = 𝐺 → (𝑓‘𝑦) = (𝐺‘𝑦))
15	13, 14	oveq12d 7428	. . . . . . 7 ⊢ (𝑓 = 𝐺 → ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))
16	11, 15	eqeq12d 2779	. . . . . 6 ⊢ (𝑓 = 𝐺 → ((𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) ↔ (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
17	16	2ralbidv 3229	. . . . 5 ⊢ (𝑓 = 𝐺 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
18	17	ralbidv 3188	. . . 4 ⊢ (𝑓 = 𝐺 → (∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) ↔ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
19	18	elrab 3650	. . 3 ⊢ (𝐺 ∈ {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))} ↔ (𝐺 ∈ (𝐾 ↑m 𝑉) ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
20	5	fvexi 6895	. . . . 5 ⊢ 𝐾 ∈ V
21	1	fvexi 6895	. . . . 5 ⊢ 𝑉 ∈ V
22	20, 21	elmap 8865	. . . 4 ⊢ (𝐺 ∈ (𝐾 ↑m 𝑉) ↔ 𝐺:𝑉⟶𝐾)
23	22	anbi1i 635	. . 3 ⊢ ((𝐺 ∈ (𝐾 ↑m 𝑉) ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))) ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
24	19, 23	bitri 278	. 2 ⊢ (𝐺 ∈ {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))} ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
25	10, 24	bitrdi 290	1 ⊢ (𝑊 ∈ 𝑋 → (𝐺 ∈ 𝐹 ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  {crab 3416  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8820  Basecbs 17264  +_gcplusg 17305  ._rcmulr 17306  Scalarcsca 17308   ·_𝑠 cvsca 17309  LFnlclfn 39831

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-lfl 39832

This theorem is referenced by:  lfli  39835  islfld  39836  lflf  39837  lfl0f  39843  lfladdcl  39845  lflnegcl  39849  lshpkrcl  39890