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

Theorem lflnegl 39739
Description: A functional plus its negative is the zero functional. (This is specialized for the purpose of proving ldualgrp 39809, and we do not define a general operation here.) (Contributed by NM, 22-Oct-2014.)
Hypotheses
Ref Expression
lflnegcl.v 𝑉 = (Base‘𝑊)
lflnegcl.r 𝑅 = (Scalar‘𝑊)
lflnegcl.i 𝐼 = (invg𝑅)
lflnegcl.n 𝑁 = (𝑥𝑉 ↦ (𝐼‘(𝐺𝑥)))
lflnegcl.f 𝐹 = (LFnl‘𝑊)
lflnegcl.w (𝜑𝑊 ∈ LMod)
lflnegcl.g (𝜑𝐺𝐹)
lflnegl.p + = (+g𝑅)
lflnegl.o 0 = (0g𝑅)
Assertion
Ref Expression
lflnegl (𝜑 → (𝑁f + 𝐺) = (𝑉 × { 0 }))
Distinct variable groups:   𝑥,𝐺   𝑥,𝐼   𝑥,𝑅   𝑥,𝑉   𝑥,𝑊   𝜑,𝑥
Allowed substitution hints:   + (𝑥)   𝐹(𝑥)   𝑁(𝑥)   0 (𝑥)

Proof of Theorem lflnegl
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 lflnegcl.v . . . 4 𝑉 = (Base‘𝑊)
21fvexi 6896 . . 3 𝑉 ∈ V
32a1i 11 . 2 (𝜑𝑉 ∈ V)
4 lflnegcl.w . . 3 (𝜑𝑊 ∈ LMod)
5 lflnegcl.g . . 3 (𝜑𝐺𝐹)
6 lflnegcl.r . . . 4 𝑅 = (Scalar‘𝑊)
7 eqid 2769 . . . 4 (Base‘𝑅) = (Base‘𝑅)
8 lflnegcl.f . . . 4 𝐹 = (LFnl‘𝑊)
96, 7, 1, 8lflf 39726 . . 3 ((𝑊 ∈ LMod ∧ 𝐺𝐹) → 𝐺:𝑉⟶(Base‘𝑅))
104, 5, 9syl2anc 595 . 2 (𝜑𝐺:𝑉⟶(Base‘𝑅))
11 lflnegl.o . . . 4 0 = (0g𝑅)
1211fvexi 6896 . . 3 0 ∈ V
1312a1i 11 . 2 (𝜑0 ∈ V)
14 lflnegcl.i . . . 4 𝐼 = (invg𝑅)
156lmodring 20966 . . . . 5 (𝑊 ∈ LMod → 𝑅 ∈ Ring)
16 ringgrp 20319 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ Grp)
174, 15, 163syl 19 . . . 4 (𝜑𝑅 ∈ Grp)
187, 14, 17grpinvf1o 19074 . . 3 (𝜑𝐼:(Base‘𝑅)–1-1-onto→(Base‘𝑅))
19 f1of 6821 . . 3 (𝐼:(Base‘𝑅)–1-1-onto→(Base‘𝑅) → 𝐼:(Base‘𝑅)⟶(Base‘𝑅))
2018, 19syl 18 . 2 (𝜑𝐼:(Base‘𝑅)⟶(Base‘𝑅))
21 lflnegcl.n . . 3 𝑁 = (𝑥𝑉 ↦ (𝐼‘(𝐺𝑥)))
2221a1i 11 . 2 (𝜑𝑁 = (𝑥𝑉 ↦ (𝐼‘(𝐺𝑥))))
23 lflnegl.p . . . 4 + = (+g𝑅)
247, 23, 11, 14grplinv 19055 . . 3 ((𝑅 ∈ Grp ∧ 𝑦 ∈ (Base‘𝑅)) → ((𝐼𝑦) + 𝑦) = 0 )
2517, 24sylan 591 . 2 ((𝜑𝑦 ∈ (Base‘𝑅)) → ((𝐼𝑦) + 𝑦) = 0 )
263, 10, 13, 20, 22, 25caofinvl 7707 1 (𝜑 → (𝑁f + 𝐺) = (𝑉 × { 0 }))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  Vcvv 3463  {csn 4594  cmpt 5196   × cxp 5660  wf 6533  1-1-ontowf1o 6536  cfv 6537  (class class class)co 7411  f cof 7673  Basecbs 17268  +gcplusg 17309  Scalarcsca 17312  0gc0g 17491  Grpcgrp 18999  invgcminusg 19000  Ringcrg 20314  LModclmod 20958  LFnlclfn 39720
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-of 7675  df-map 8825  df-0g 17493  df-mgm 18697  df-sgrp 18776  df-mnd 18792  df-grp 19002  df-minusg 19003  df-ring 20316  df-lmod 20960  df-lfl 39721
This theorem is referenced by:  ldualgrplem  39808
  Copyright terms: Public domain W3C validator