Theorem opprnegg 14372

Description: The negative function in an opposite ring. (Contributed by Mario Carneiro, 5-Dec-2014.) (Revised by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
opprbas.1	⊢ 𝑂 = (oppr‘𝑅)
opprneg.2	⊢ 𝑁 = (invg‘𝑅)

Assertion

Ref	Expression
opprnegg	⊢ (𝑅 ∈ 𝑉 → 𝑁 = (invg‘𝑂))

Proof of Theorem opprnegg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opprbas.1	. . . 4 ⊢ 𝑂 = (oppr‘𝑅)
2		eqid 2238	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
3	1, 2	opprbasg 14363	. . 3 ⊢ (𝑅 ∈ 𝑉 → (Base‘𝑅) = (Base‘𝑂))
4		eqid 2238	. . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅)
5	1, 4	oppraddg 14364	. . . . . 6 ⊢ (𝑅 ∈ 𝑉 → (+g‘𝑅) = (+g‘𝑂))
6	5	oveqd 6096	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (𝑦(+g‘𝑅)𝑥) = (𝑦(+g‘𝑂)𝑥))
7		eqid 2238	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
8	1, 7	oppr0g 14370	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (0g‘𝑅) = (0g‘𝑂))
9	6, 8	eqeq12d 2253	. . . 4 ⊢ (𝑅 ∈ 𝑉 → ((𝑦(+g‘𝑅)𝑥) = (0g‘𝑅) ↔ (𝑦(+g‘𝑂)𝑥) = (0g‘𝑂)))
10	3, 9	riotaeqbidv 6035	. . 3 ⊢ (𝑅 ∈ 𝑉 → (℩𝑦 ∈ (Base‘𝑅)(𝑦(+g‘𝑅)𝑥) = (0g‘𝑅)) = (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂)))
11	3, 10	mpteq12dv 4211	. 2 ⊢ (𝑅 ∈ 𝑉 → (𝑥 ∈ (Base‘𝑅) ↦ (℩𝑦 ∈ (Base‘𝑅)(𝑦(+g‘𝑅)𝑥) = (0g‘𝑅))) = (𝑥 ∈ (Base‘𝑂) ↦ (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂))))
12		opprneg.2	. . 3 ⊢ 𝑁 = (invg‘𝑅)
13	2, 4, 7, 12	grpinvfvalg 13830	. 2 ⊢ (𝑅 ∈ 𝑉 → 𝑁 = (𝑥 ∈ (Base‘𝑅) ↦ (℩𝑦 ∈ (Base‘𝑅)(𝑦(+g‘𝑅)𝑥) = (0g‘𝑅))))
14	1	opprex 14361	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑂 ∈ V)
15		eqid 2238	. . . 4 ⊢ (Base‘𝑂) = (Base‘𝑂)
16		eqid 2238	. . . 4 ⊢ (+g‘𝑂) = (+g‘𝑂)
17		eqid 2238	. . . 4 ⊢ (0g‘𝑂) = (0g‘𝑂)
18		eqid 2238	. . . 4 ⊢ (invg‘𝑂) = (invg‘𝑂)
19	15, 16, 17, 18	grpinvfvalg 13830	. . 3 ⊢ (𝑂 ∈ V → (invg‘𝑂) = (𝑥 ∈ (Base‘𝑂) ↦ (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂))))
20	14, 19	syl 14	. 2 ⊢ (𝑅 ∈ 𝑉 → (invg‘𝑂) = (𝑥 ∈ (Base‘𝑂) ↦ (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂))))
21	11, 13, 20	3eqtr4d 2281	1 ⊢ (𝑅 ∈ 𝑉 → 𝑁 = (invg‘𝑂))

Syntax hints:   → wi 4   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ↦ cmpt 4190  ‘cfv 5375  ℩crio 6031  (class class class)co 6079  Basecbs 13335  +_gcplusg 13414  0_gc0g 13593  inv_gcminusg 13789  opp_rcoppr 14355

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-addass 8275  ax-i2m1 8278  ax-0lt1 8279  ax-0id 8281  ax-rnegex 8282  ax-pre-ltirr 8285  ax-pre-lttrn 8287  ax-pre-ltadd 8289

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-tpos 6510  df-pnf 8356  df-mnf 8357  df-ltxr 8359  df-inn 9288  df-2 9346  df-3 9347  df-ndx 13338  df-slot 13339  df-base 13341  df-sets 13342  df-plusg 13427  df-mulr 13428  df-0g 13595  df-minusg 13792  df-oppr 14356

This theorem is referenced by:  unitnegcl  14420  opprdrng  14603