Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  islfl Structured version   Visualization version   GIF version

Theorem islfl 36356
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.
StepHypRef 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‘𝑊)
91, 2, 3, 4, 5, 6, 7, 8lflset 36355 . . 3 (𝑊𝑋𝐹 = {𝑓 ∈ (𝐾m 𝑉) ∣ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦))})
109eleq2d 2875 . 2 (𝑊𝑋 → (𝐺𝐹𝐺 ∈ {𝑓 ∈ (𝐾m 𝑉) ∣ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦))}))
11 fveq1 6644 . . . . . . 7 (𝑓 = 𝐺 → (𝑓‘((𝑟 · 𝑥) + 𝑦)) = (𝐺‘((𝑟 · 𝑥) + 𝑦)))
12 fveq1 6644 . . . . . . . . 9 (𝑓 = 𝐺 → (𝑓𝑥) = (𝐺𝑥))
1312oveq2d 7151 . . . . . . . 8 (𝑓 = 𝐺 → (𝑟 × (𝑓𝑥)) = (𝑟 × (𝐺𝑥)))
14 fveq1 6644 . . . . . . . 8 (𝑓 = 𝐺 → (𝑓𝑦) = (𝐺𝑦))
1513, 14oveq12d 7153 . . . . . . 7 (𝑓 = 𝐺 → ((𝑟 × (𝑓𝑥)) (𝑓𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦)))
1611, 15eqeq12d 2814 . . . . . 6 (𝑓 = 𝐺 → ((𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦)) ↔ (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))))
17162ralbidv 3164 . . . . 5 (𝑓 = 𝐺 → (∀𝑥𝑉𝑦𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦)) ↔ ∀𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))))
1817ralbidv 3162 . . . 4 (𝑓 = 𝐺 → (∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦)) ↔ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))))
1918elrab 3628 . . 3 (𝐺 ∈ {𝑓 ∈ (𝐾m 𝑉) ∣ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦))} ↔ (𝐺 ∈ (𝐾m 𝑉) ∧ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))))
205fvexi 6659 . . . . 5 𝐾 ∈ V
211fvexi 6659 . . . . 5 𝑉 ∈ V
2220, 21elmap 8418 . . . 4 (𝐺 ∈ (𝐾m 𝑉) ↔ 𝐺:𝑉𝐾)
2322anbi1i 626 . . 3 ((𝐺 ∈ (𝐾m 𝑉) ∧ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))) ↔ (𝐺:𝑉𝐾 ∧ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))))
2419, 23bitri 278 . 2 (𝐺 ∈ {𝑓 ∈ (𝐾m 𝑉) ∣ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝑓‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝑓𝑥)) (𝑓𝑦))} ↔ (𝐺:𝑉𝐾 ∧ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦))))
2510, 24syl6bb 290 1 (𝑊𝑋 → (𝐺𝐹 ↔ (𝐺:𝑉𝐾 ∧ ∀𝑟𝐾𝑥𝑉𝑦𝑉 (𝐺‘((𝑟 · 𝑥) + 𝑦)) = ((𝑟 × (𝐺𝑥)) (𝐺𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wral 3106  {crab 3110  wf 6320  cfv 6324  (class class class)co 7135  m cmap 8389  Basecbs 16475  +gcplusg 16557  .rcmulr 16558  Scalarcsca 16560   ·𝑠 cvsca 16561  LFnlclfn 36353
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-lfl 36354
This theorem is referenced by:  lfli  36357  islfld  36358  lflf  36359  lfl0f  36365  lfladdcl  36367  lflnegcl  36371  lshpkrcl  36412
  Copyright terms: Public domain W3C validator