Theorem lflnegl 40133

Description: A functional plus its negative is the zero functional. (This is specialized for the purpose of proving ldualgrp 40203, 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.

Step	Hyp	Ref	Expression
1		lflnegcl.v	. . . 4 ⊢ 𝑉 = (Base‘𝑊)
2	1	fvexi 6899	. . 3 ⊢ 𝑉 ∈ V
3	2	a1i 11	. 2 ⊢ (𝜑 → 𝑉 ∈ V)
4		lflnegcl.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ LMod)
5		lflnegcl.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
6		lflnegcl.r	. . . 4 ⊢ 𝑅 = (Scalar‘𝑊)
7		eqid 2761	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
8		lflnegcl.f	. . . 4 ⊢ 𝐹 = (LFnl‘𝑊)
9	6, 7, 1, 8	lflf 40120	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺:𝑉⟶(Base‘𝑅))
10	4, 5, 9	syl2anc 596	. 2 ⊢ (𝜑 → 𝐺:𝑉⟶(Base‘𝑅))
11		lflnegl.o	. . . 4 ⊢ 0 = (0g‘𝑅)
12	11	fvexi 6899	. . 3 ⊢ 0 ∈ V
13	12	a1i 11	. 2 ⊢ (𝜑 → 0 ∈ V)
14		lflnegcl.i	. . . 4 ⊢ 𝐼 = (invg‘𝑅)
15	6	lmodring 21143	. . . . 5 ⊢ (𝑊 ∈ LMod → 𝑅 ∈ Ring)
16		ringgrp 20464	. . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
17	4, 15, 16	3syl 19	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp)
18	7, 14, 17	grpinvf1o 19219	. . 3 ⊢ (𝜑 → 𝐼:(Base‘𝑅)–1-1-onto→(Base‘𝑅))
19		f1of 6824	. . 3 ⊢ (𝐼:(Base‘𝑅)–1-1-onto→(Base‘𝑅) → 𝐼:(Base‘𝑅)⟶(Base‘𝑅))
20	18, 19	syl 18	. 2 ⊢ (𝜑 → 𝐼:(Base‘𝑅)⟶(Base‘𝑅))
21		lflnegcl.n	. . 3 ⊢ 𝑁 = (𝑥 ∈ 𝑉 ↦ (𝐼‘(𝐺‘𝑥)))
22	21	a1i 11	. 2 ⊢ (𝜑 → 𝑁 = (𝑥 ∈ 𝑉 ↦ (𝐼‘(𝐺‘𝑥))))
23		lflnegl.p	. . . 4 ⊢ + = (+g‘𝑅)
24	7, 23, 11, 14	grplinv 19200	. . 3 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ (Base‘𝑅)) → ((𝐼‘𝑦) + 𝑦) = 0 )
25	17, 24	sylan 592	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ (Base‘𝑅)) → ((𝐼‘𝑦) + 𝑦) = 0 )
26	3, 10, 13, 20, 22, 25	caofinvl 7725	1 ⊢ (𝜑 → (𝑁 ∘f + 𝐺) = (𝑉 × { 0 }))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584   ↦ cmpt 5186   × cxp 5649  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420   ∘_f cof 7691  Basecbs 17387  +_gcplusg 17428  Scalarcsca 17431  0_gc0g 17610  Grpcgrp 19144  inv_gcminusg 19145  Ringcrg 20459  LModclmod 21135  LFnlclfn 40114

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-map 8849  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-minusg 19148  df-ring 20461  df-lmod 21137  df-lfl 40115

This theorem is used by:  ldualgrplem  40202