Theorem islfl 39433

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 39432	. . 3 ⊢ (𝑊 ∈ 𝑋 → 𝐹 = {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))})
10	9	eleq2d 2823	. 2 ⊢ (𝑊 ∈ 𝑋 → (𝐺 ∈ 𝐹 ↔ 𝐺 ∈ {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))}))
11		fveq1 6841	. . . . . . 7 ⊢ (𝑓 = 𝐺 → (𝑓‘((𝑟 · 𝑥) + 𝑦)) = (𝐺‘((𝑟 · 𝑥) + 𝑦)))
12		fveq1 6841	. . . . . . . . 9 ⊢ (𝑓 = 𝐺 → (𝑓‘𝑥) = (𝐺‘𝑥))
13	12	oveq2d 7384	. . . . . . . 8 ⊢ (𝑓 = 𝐺 → (𝑟 × (𝑓‘𝑥)) = (𝑟 × (𝐺‘𝑥)))
14		fveq1 6841	. . . . . . . 8 ⊢ (𝑓 = 𝐺 → (𝑓‘𝑦) = (𝐺‘𝑦))
15	13, 14	oveq12d 7386	. . . . . . 7 ⊢ (𝑓 = 𝐺 → ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))
16	11, 15	eqeq12d 2753	. . . . . 6 ⊢ (𝑓 = 𝐺 → ((𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) ↔ (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
17	16	2ralbidv 3202	. . . . 5 ⊢ (𝑓 = 𝐺 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
18	17	ralbidv 3161	. . . 4 ⊢ (𝑓 = 𝐺 → (∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦)) ↔ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
19	18	elrab 3648	. . 3 ⊢ (𝐺 ∈ {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))} ↔ (𝐺 ∈ (𝐾 ↑m 𝑉) ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
20	5	fvexi 6856	. . . . 5 ⊢ 𝐾 ∈ V
21	1	fvexi 6856	. . . . 5 ⊢ 𝑉 ∈ V
22	20, 21	elmap 8821	. . . 4 ⊢ (𝐺 ∈ (𝐾 ↑m 𝑉) ↔ 𝐺:𝑉⟶𝐾)
23	22	anbi1i 625	. . 3 ⊢ ((𝐺 ∈ (𝐾 ↑m 𝑉) ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))) ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
24	19, 23	bitri 275	. 2 ⊢ (𝐺 ∈ {𝑓 ∈ (𝐾 ↑m 𝑉) ∣ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓‘𝑥)) ⨣ (𝑓‘𝑦))} ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦))))
25	10, 24	bitrdi 287	1 ⊢ (𝑊 ∈ 𝑋 → (𝐺 ∈ 𝐹 ↔ (𝐺:𝑉⟶𝐾 ∧ ∀𝑟 ∈ 𝐾 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺‘𝑥)) ⨣ (𝐺‘𝑦)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  {crab 3401  ⟶wf 6496  ‘cfv 6500  (class class class)co 7368   ↑_m cmap 8775  Basecbs 17148  +_gcplusg 17189  ._rcmulr 17190  Scalarcsca 17192   ·_𝑠 cvsca 17193  LFnlclfn 39430

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-map 8777  df-lfl 39431

This theorem is referenced by:  lfli  39434  islfld  39435  lflf  39436  lfl0f  39442  lfladdcl  39444  lflnegcl  39448  lshpkrcl  39489