Theorem opprunitd 14089

Description: Being a unit is a symmetric property, so it transfers to the opposite ring. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
opprunitd.1	⊢ (𝜑 → 𝑈 = (Unit‘𝑅))
opprunitd.2	⊢ (𝜑 → 𝑆 = (oppr‘𝑅))
opprunitd.r	⊢ (𝜑 → 𝑅 ∈ Ring)

Assertion

Ref	Expression
opprunitd	⊢ (𝜑 → 𝑈 = (Unit‘𝑆))

Proof of Theorem opprunitd

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

Step	Hyp	Ref	Expression
1		opprunitd.1	. . . . . 6 ⊢ (𝜑 → 𝑈 = (Unit‘𝑅))
2		eqidd 2230	. . . . . 6 ⊢ (𝜑 → (1r‘𝑅) = (1r‘𝑅))
3		eqidd 2230	. . . . . 6 ⊢ (𝜑 → (∥r‘𝑅) = (∥r‘𝑅))
4		opprunitd.2	. . . . . 6 ⊢ (𝜑 → 𝑆 = (oppr‘𝑅))
5		eqidd 2230	. . . . . 6 ⊢ (𝜑 → (∥r‘𝑆) = (∥r‘𝑆))
6		opprunitd.r	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Ring)
7		ringsrg 14025	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing)
8	6, 7	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ SRing)
9	1, 2, 3, 4, 5, 8	isunitd 14085	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘𝑆)(1r‘𝑅))))
10		eqid 2229	. . . . . . . . . . . . . . 15 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
11	10	opprring 14057	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring)
12	6, 11	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → (oppr‘𝑅) ∈ Ring)
13	4, 12	eqeltrd 2306	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑆 ∈ Ring)
14		vex 2802	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
15	14	a1i 9	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑦 ∈ V)
16		vex 2802	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
17	16	a1i 9	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑥 ∈ V)
18		eqid 2229	. . . . . . . . . . . . 13 ⊢ (Base‘𝑆) = (Base‘𝑆)
19		eqid 2229	. . . . . . . . . . . . 13 ⊢ (.r‘𝑆) = (.r‘𝑆)
20		eqid 2229	. . . . . . . . . . . . 13 ⊢ (oppr‘𝑆) = (oppr‘𝑆)
21		eqid 2229	. . . . . . . . . . . . 13 ⊢ (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆))
22	18, 19, 20, 21	opprmulg 14049	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Ring ∧ 𝑦 ∈ V ∧ 𝑥 ∈ V) → (𝑦(.r‘(oppr‘𝑆))𝑥) = (𝑥(.r‘𝑆)𝑦))
23	13, 15, 17, 22	syl3anc 1271	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑦(.r‘(oppr‘𝑆))𝑥) = (𝑥(.r‘𝑆)𝑦))
24	4	fveq2d 5633	. . . . . . . . . . . 12 ⊢ (𝜑 → (.r‘𝑆) = (.r‘(oppr‘𝑅)))
25	24	oveqd 6024	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥(.r‘𝑆)𝑦) = (𝑥(.r‘(oppr‘𝑅))𝑦))
26		eqid 2229	. . . . . . . . . . . . 13 ⊢ (Base‘𝑅) = (Base‘𝑅)
27		eqid 2229	. . . . . . . . . . . . 13 ⊢ (.r‘𝑅) = (.r‘𝑅)
28		eqid 2229	. . . . . . . . . . . . 13 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
29	26, 27, 10, 28	opprmulg 14049	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦(.r‘𝑅)𝑥))
30	6, 17, 15, 29	syl3anc 1271	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥(.r‘(oppr‘𝑅))𝑦) = (𝑦(.r‘𝑅)𝑥))
31	23, 25, 30	3eqtrrd 2267	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦(.r‘𝑅)𝑥) = (𝑦(.r‘(oppr‘𝑆))𝑥))
32	31	eqeq1d 2238	. . . . . . . . 9 ⊢ (𝜑 → ((𝑦(.r‘𝑅)𝑥) = (1r‘𝑅) ↔ (𝑦(.r‘(oppr‘𝑆))𝑥) = (1r‘𝑅)))
33	32	rexbidv 2531	. . . . . . . 8 ⊢ (𝜑 → (∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘𝑅)𝑥) = (1r‘𝑅) ↔ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘(oppr‘𝑆))𝑥) = (1r‘𝑅)))
34	33	anbi2d 464	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘𝑅)𝑥) = (1r‘𝑅)) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘(oppr‘𝑆))𝑥) = (1r‘𝑅))))
35		eqidd 2230	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝑅) = (Base‘𝑅))
36		eqidd 2230	. . . . . . . 8 ⊢ (𝜑 → (.r‘𝑅) = (.r‘𝑅))
37	35, 3, 8, 36	dvdsrd 14073	. . . . . . 7 ⊢ (𝜑 → (𝑥(∥r‘𝑅)(1r‘𝑅) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘𝑅)𝑥) = (1r‘𝑅))))
38	10, 26	opprbasg 14053	. . . . . . . . . 10 ⊢ (𝑅 ∈ SRing → (Base‘𝑅) = (Base‘(oppr‘𝑅)))
39	8, 38	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(oppr‘𝑅)))
40	4	fveq2d 5633	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝑆) = (Base‘(oppr‘𝑅)))
41	20, 18	opprbasg 14053	. . . . . . . . . 10 ⊢ (𝑆 ∈ Ring → (Base‘𝑆) = (Base‘(oppr‘𝑆)))
42	13, 41	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝑆) = (Base‘(oppr‘𝑆)))
43	39, 40, 42	3eqtr2d 2268	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(oppr‘𝑆)))
44		eqidd 2230	. . . . . . . 8 ⊢ (𝜑 → (∥r‘(oppr‘𝑆)) = (∥r‘(oppr‘𝑆)))
45	20	opprring 14057	. . . . . . . . . 10 ⊢ (𝑆 ∈ Ring → (oppr‘𝑆) ∈ Ring)
46	13, 45	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (oppr‘𝑆) ∈ Ring)
47		ringsrg 14025	. . . . . . . . 9 ⊢ ((oppr‘𝑆) ∈ Ring → (oppr‘𝑆) ∈ SRing)
48	46, 47	syl 14	. . . . . . . 8 ⊢ (𝜑 → (oppr‘𝑆) ∈ SRing)
49		eqidd 2230	. . . . . . . 8 ⊢ (𝜑 → (.r‘(oppr‘𝑆)) = (.r‘(oppr‘𝑆)))
50	43, 44, 48, 49	dvdsrd 14073	. . . . . . 7 ⊢ (𝜑 → (𝑥(∥r‘(oppr‘𝑆))(1r‘𝑅) ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑦 ∈ (Base‘𝑅)(𝑦(.r‘(oppr‘𝑆))𝑥) = (1r‘𝑅))))
51	34, 37, 50	3bitr4d 220	. . . . . 6 ⊢ (𝜑 → (𝑥(∥r‘𝑅)(1r‘𝑅) ↔ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑅)))
52	51	anbi1d 465	. . . . 5 ⊢ (𝜑 → ((𝑥(∥r‘𝑅)(1r‘𝑅) ∧ 𝑥(∥r‘𝑆)(1r‘𝑅)) ↔ (𝑥(∥r‘(oppr‘𝑆))(1r‘𝑅) ∧ 𝑥(∥r‘𝑆)(1r‘𝑅))))
53	9, 52	bitrd 188	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘(oppr‘𝑆))(1r‘𝑅) ∧ 𝑥(∥r‘𝑆)(1r‘𝑅))))
54	53	biancomd 271	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑈 ↔ (𝑥(∥r‘𝑆)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑅))))
55		eqidd 2230	. . . 4 ⊢ (𝜑 → (Unit‘𝑆) = (Unit‘𝑆))
56		eqid 2229	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
57	10, 56	oppr1g 14060	. . . . . 6 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) = (1r‘(oppr‘𝑅)))
58	6, 57	syl 14	. . . . 5 ⊢ (𝜑 → (1r‘𝑅) = (1r‘(oppr‘𝑅)))
59	4	fveq2d 5633	. . . . 5 ⊢ (𝜑 → (1r‘𝑆) = (1r‘(oppr‘𝑅)))
60	58, 59	eqtr4d 2265	. . . 4 ⊢ (𝜑 → (1r‘𝑅) = (1r‘𝑆))
61		eqidd 2230	. . . 4 ⊢ (𝜑 → (oppr‘𝑆) = (oppr‘𝑆))
62		ringsrg 14025	. . . . 5 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
63	13, 62	syl 14	. . . 4 ⊢ (𝜑 → 𝑆 ∈ SRing)
64	55, 60, 5, 61, 44, 63	isunitd 14085	. . 3 ⊢ (𝜑 → (𝑥 ∈ (Unit‘𝑆) ↔ (𝑥(∥r‘𝑆)(1r‘𝑅) ∧ 𝑥(∥r‘(oppr‘𝑆))(1r‘𝑅))))
65	54, 64	bitr4d 191	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑈 ↔ 𝑥 ∈ (Unit‘𝑆)))
66	65	eqrdv 2227	1 ⊢ (𝜑 → 𝑈 = (Unit‘𝑆))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  ∃wrex 2509  Vcvv 2799   class class class wbr 4083  ‘cfv 5318  (class class class)co 6007  Basecbs 13047  ._rcmulr 13126  1_rcur 13937  SRingcsrg 13941  Ringcrg 13974  opp_rcoppr 14045  ∥_rcdsr 14064  Unitcui 14065

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 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-pre-ltirr 8122  ax-pre-lttrn 8124  ax-pre-ltadd 8126

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-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-tpos 6397  df-pnf 8194  df-mnf 8195  df-ltxr 8197  df-inn 9122  df-2 9180  df-3 9181  df-ndx 13050  df-slot 13051  df-base 13053  df-sets 13054  df-plusg 13138  df-mulr 13139  df-0g 13306  df-mgm 13404  df-sgrp 13450  df-mnd 13465  df-grp 13551  df-minusg 13552  df-cmn 13838  df-abl 13839  df-mgp 13899  df-ur 13938  df-srg 13942  df-ring 13976  df-oppr 14046  df-dvdsr 14067  df-unit 14068

This theorem is referenced by: (None)