Theorem opprabs 33574

Description: The opposite ring of the opposite ring is the original ring. Note the conditions on this theorem, which makes it unpractical in case we only have e.g. 𝑅 ∈ Ring as a premise. (Contributed by Thierry Arnoux, 9-Mar-2025.)

Hypotheses

Ref	Expression
opprabs.o	⊢ 𝑂 = (oppr‘𝑅)
opprabs.m	⊢ · = (.r‘𝑅)
opprabs.1	⊢ (𝜑 → 𝑅 ∈ 𝑉)
opprabs.2	⊢ (𝜑 → Fun 𝑅)
opprabs.3	⊢ (𝜑 → (.r‘ndx) ∈ dom 𝑅)
opprabs.4	⊢ (𝜑 → · Fn (𝐵 × 𝐵))

Assertion

Ref	Expression
opprabs	⊢ (𝜑 → 𝑅 = (oppr‘𝑂))

Proof of Theorem opprabs

Step	Hyp	Ref	Expression
1		opprabs.4	. . . . . 6 ⊢ (𝜑 → · Fn (𝐵 × 𝐵))
2		eqid 2737	. . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅)
3		opprabs.m	. . . . . . . . 9 ⊢ · = (.r‘𝑅)
4		opprabs.o	. . . . . . . . 9 ⊢ 𝑂 = (oppr‘𝑅)
5		eqid 2737	. . . . . . . . 9 ⊢ (.r‘𝑂) = (.r‘𝑂)
6	2, 3, 4, 5	opprmulfval 20287	. . . . . . . 8 ⊢ (.r‘𝑂) = tpos ·
7	6	tposeqi 8211	. . . . . . 7 ⊢ tpos (.r‘𝑂) = tpos tpos ·
8		fnrel 6602	. . . . . . . 8 ⊢ ( · Fn (𝐵 × 𝐵) → Rel · )
9		relxp 5650	. . . . . . . . 9 ⊢ Rel (𝐵 × 𝐵)
10		fndm 6603	. . . . . . . . . 10 ⊢ ( · Fn (𝐵 × 𝐵) → dom · = (𝐵 × 𝐵))
11	10	releqd 5736	. . . . . . . . 9 ⊢ ( · Fn (𝐵 × 𝐵) → (Rel dom · ↔ Rel (𝐵 × 𝐵)))
12	9, 11	mpbiri 258	. . . . . . . 8 ⊢ ( · Fn (𝐵 × 𝐵) → Rel dom · )
13		tpostpos2 8199	. . . . . . . 8 ⊢ ((Rel · ∧ Rel dom · ) → tpos tpos · = · )
14	8, 12, 13	syl2anc 585	. . . . . . 7 ⊢ ( · Fn (𝐵 × 𝐵) → tpos tpos · = · )
15	7, 14	eqtrid 2784	. . . . . 6 ⊢ ( · Fn (𝐵 × 𝐵) → tpos (.r‘𝑂) = · )
16	1, 15	syl 17	. . . . 5 ⊢ (𝜑 → tpos (.r‘𝑂) = · )
17	16, 3	eqtrdi 2788	. . . 4 ⊢ (𝜑 → tpos (.r‘𝑂) = (.r‘𝑅))
18	17	opeq2d 4838	. . 3 ⊢ (𝜑 → ⟨(.r‘ndx), tpos (.r‘𝑂)⟩ = ⟨(.r‘ndx), (.r‘𝑅)⟩)
19	18	oveq2d 7384	. 2 ⊢ (𝜑 → (𝑅 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩) = (𝑅 sSet ⟨(.r‘ndx), (.r‘𝑅)⟩))
20		opprabs.1	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑉)
21	4, 2	opprbas 20291	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑂)
22		eqid 2737	. . . . . 6 ⊢ (oppr‘𝑂) = (oppr‘𝑂)
23	21, 5, 22	opprval 20286	. . . . 5 ⊢ (oppr‘𝑂) = (𝑂 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩)
24	2, 3, 4	opprval 20286	. . . . . 6 ⊢ 𝑂 = (𝑅 sSet ⟨(.r‘ndx), tpos · ⟩)
25	24	oveq1i 7378	. . . . 5 ⊢ (𝑂 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩) = ((𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩)
26	23, 25	eqtri 2760	. . . 4 ⊢ (oppr‘𝑂) = ((𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩)
27		fvex 6855	. . . . . 6 ⊢ (.r‘𝑂) ∈ V
28	27	tposex 8212	. . . . 5 ⊢ tpos (.r‘𝑂) ∈ V
29		setsabs 17118	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ tpos (.r‘𝑂) ∈ V) → ((𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩) = (𝑅 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩))
30	28, 29	mpan2 692	. . . 4 ⊢ (𝑅 ∈ 𝑉 → ((𝑅 sSet ⟨(.r‘ndx), tpos · ⟩) sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩) = (𝑅 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩))
31	26, 30	eqtrid 2784	. . 3 ⊢ (𝑅 ∈ 𝑉 → (oppr‘𝑂) = (𝑅 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩))
32	20, 31	syl 17	. 2 ⊢ (𝜑 → (oppr‘𝑂) = (𝑅 sSet ⟨(.r‘ndx), tpos (.r‘𝑂)⟩))
33		mulridx 17227	. . 3 ⊢ .r = Slot (.r‘ndx)
34		opprabs.2	. . 3 ⊢ (𝜑 → Fun 𝑅)
35		opprabs.3	. . 3 ⊢ (𝜑 → (.r‘ndx) ∈ dom 𝑅)
36	33, 20, 34, 35	setsidvald 17138	. 2 ⊢ (𝜑 → 𝑅 = (𝑅 sSet ⟨(.r‘ndx), (.r‘𝑅)⟩))
37	19, 32, 36	3eqtr4rd 2783	1 ⊢ (𝜑 → 𝑅 = (oppr‘𝑂))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  Vcvv 3442  ⟨cop 4588   × cxp 5630  dom cdm 5632  Rel wrel 5637  Fun wfun 6494   Fn wfn 6495  ‘cfv 6500  (class class class)co 7368  tpos ctpos 8177   sSet csts 17102  ndxcnx 17132  Basecbs 17148  ._rcmulr 17190  opp_rcoppr 20284

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-tpos 8178  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-3 12221  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-mulr 17203  df-oppr 20285

This theorem is referenced by: (None)