Theorem opprnegg 14089

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 2229	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
3	1, 2	opprbasg 14081	. . 3 ⊢ (𝑅 ∈ 𝑉 → (Base‘𝑅) = (Base‘𝑂))
4		eqid 2229	. . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅)
5	1, 4	oppraddg 14082	. . . . . 6 ⊢ (𝑅 ∈ 𝑉 → (+g‘𝑅) = (+g‘𝑂))
6	5	oveqd 6030	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (𝑦(+g‘𝑅)𝑥) = (𝑦(+g‘𝑂)𝑥))
7		eqid 2229	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
8	1, 7	oppr0g 14087	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (0g‘𝑅) = (0g‘𝑂))
9	6, 8	eqeq12d 2244	. . . 4 ⊢ (𝑅 ∈ 𝑉 → ((𝑦(+g‘𝑅)𝑥) = (0g‘𝑅) ↔ (𝑦(+g‘𝑂)𝑥) = (0g‘𝑂)))
10	3, 9	riotaeqbidv 5969	. . 3 ⊢ (𝑅 ∈ 𝑉 → (℩𝑦 ∈ (Base‘𝑅)(𝑦(+g‘𝑅)𝑥) = (0g‘𝑅)) = (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂)))
11	3, 10	mpteq12dv 4169	. 2 ⊢ (𝑅 ∈ 𝑉 → (𝑥 ∈ (Base‘𝑅) ↦ (℩𝑦 ∈ (Base‘𝑅)(𝑦(+g‘𝑅)𝑥) = (0g‘𝑅))) = (𝑥 ∈ (Base‘𝑂) ↦ (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂))))
12		opprneg.2	. . 3 ⊢ 𝑁 = (invg‘𝑅)
13	2, 4, 7, 12	grpinvfvalg 13618	. 2 ⊢ (𝑅 ∈ 𝑉 → 𝑁 = (𝑥 ∈ (Base‘𝑅) ↦ (℩𝑦 ∈ (Base‘𝑅)(𝑦(+g‘𝑅)𝑥) = (0g‘𝑅))))
14	1	opprex 14079	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑂 ∈ V)
15		eqid 2229	. . . 4 ⊢ (Base‘𝑂) = (Base‘𝑂)
16		eqid 2229	. . . 4 ⊢ (+g‘𝑂) = (+g‘𝑂)
17		eqid 2229	. . . 4 ⊢ (0g‘𝑂) = (0g‘𝑂)
18		eqid 2229	. . . 4 ⊢ (invg‘𝑂) = (invg‘𝑂)
19	15, 16, 17, 18	grpinvfvalg 13618	. . 3 ⊢ (𝑂 ∈ V → (invg‘𝑂) = (𝑥 ∈ (Base‘𝑂) ↦ (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂))))
20	14, 19	syl 14	. 2 ⊢ (𝑅 ∈ 𝑉 → (invg‘𝑂) = (𝑥 ∈ (Base‘𝑂) ↦ (℩𝑦 ∈ (Base‘𝑂)(𝑦(+g‘𝑂)𝑥) = (0g‘𝑂))))
21	11, 13, 20	3eqtr4d 2272	1 ⊢ (𝑅 ∈ 𝑉 → 𝑁 = (invg‘𝑂))

Syntax hints:   → wi 4   = wceq 1395   ∈ wcel 2200  Vcvv 2800   ↦ cmpt 4148  ‘cfv 5324  ℩crio 5965  (class class class)co 6013  Basecbs 13075  +_gcplusg 13153  0_gc0g 13332  inv_gcminusg 13577  opp_rcoppr 14073

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-addass 8127  ax-i2m1 8130  ax-0lt1 8131  ax-0id 8133  ax-rnegex 8134  ax-pre-ltirr 8137  ax-pre-lttrn 8139  ax-pre-ltadd 8141

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-tpos 6406  df-pnf 8209  df-mnf 8210  df-ltxr 8212  df-inn 9137  df-2 9195  df-3 9196  df-ndx 13078  df-slot 13079  df-base 13081  df-sets 13082  df-plusg 13166  df-mulr 13167  df-0g 13334  df-minusg 13580  df-oppr 14074

This theorem is referenced by:  unitnegcl  14137