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 36214
Description: A functional plus its negative is the zero functional. (This is specialized for the purpose of proving ldualgrp 36284, 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 6686 . . 3 𝑉 ∈ V
32a1i 11 . 2 (𝜑𝑉 ∈ V)
4 lflnegcl.w . . 3 (𝜑𝑊 ∈ LMod)
5 lflnegcl.g . . 3 (𝜑𝐺𝐹)
6 lflnegcl.r . . . 4 𝑅 = (Scalar‘𝑊)
7 eqid 2823 . . . 4 (Base‘𝑅) = (Base‘𝑅)
8 lflnegcl.f . . . 4 𝐹 = (LFnl‘𝑊)
96, 7, 1, 8lflf 36201 . . 3 ((𝑊 ∈ LMod ∧ 𝐺𝐹) → 𝐺:𝑉⟶(Base‘𝑅))
104, 5, 9syl2anc 586 . 2 (𝜑𝐺:𝑉⟶(Base‘𝑅))
11 lflnegl.o . . . 4 0 = (0g𝑅)
1211fvexi 6686 . . 3 0 ∈ V
1312a1i 11 . 2 (𝜑0 ∈ V)
14 lflnegcl.i . . . 4 𝐼 = (invg𝑅)
156lmodring 19644 . . . . 5 (𝑊 ∈ LMod → 𝑅 ∈ Ring)
16 ringgrp 19304 . . . . 5 (𝑅 ∈ Ring → 𝑅 ∈ Grp)
174, 15, 163syl 18 . . . 4 (𝜑𝑅 ∈ Grp)
187, 14, 17grpinvf1o 18171 . . 3 (𝜑𝐼:(Base‘𝑅)–1-1-onto→(Base‘𝑅))
19 f1of 6617 . . 3 (𝐼:(Base‘𝑅)–1-1-onto→(Base‘𝑅) → 𝐼:(Base‘𝑅)⟶(Base‘𝑅))
2018, 19syl 17 . 2 (𝜑𝐼:(Base‘𝑅)⟶(Base‘𝑅))
21 lflnegcl.n . . 3 𝑁 = (𝑥𝑉 ↦ (𝐼‘(𝐺𝑥)))
2221a1i 11 . 2 (𝜑𝑁 = (𝑥𝑉 ↦ (𝐼‘(𝐺𝑥))))
23 lflnegl.p . . . 4 + = (+g𝑅)
247, 23, 11, 14grplinv 18154 . . 3 ((𝑅 ∈ Grp ∧ 𝑦 ∈ (Base‘𝑅)) → ((𝐼𝑦) + 𝑦) = 0 )
2517, 24sylan 582 . 2 ((𝜑𝑦 ∈ (Base‘𝑅)) → ((𝐼𝑦) + 𝑦) = 0 )
263, 10, 13, 20, 22, 25caofinvl 7438 1 (𝜑 → (𝑁f + 𝐺) = (𝑉 × { 0 }))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  Vcvv 3496  {csn 4569  cmpt 5148   × cxp 5555  wf 6353  1-1-ontowf1o 6356  cfv 6357  (class class class)co 7158  f cof 7409  Basecbs 16485  +gcplusg 16567  Scalarcsca 16570  0gc0g 16715  Grpcgrp 18105  invgcminusg 18106  Ringcrg 19299  LModclmod 19636  LFnlclfn 36195
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-of 7411  df-map 8410  df-0g 16717  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-grp 18108  df-minusg 18109  df-ring 19301  df-lmod 19638  df-lfl 36196
This theorem is referenced by:  ldualgrplem  36283
  Copyright terms: Public domain W3C validator