Theorem unitpropdg 13704

Description: The set of units depends only on the ring's base set and multiplication operation. (Contributed by Mario Carneiro, 26-Dec-2014.)

Hypotheses

Ref	Expression
unitpropdg.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
unitpropdg.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
unitpropdg.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
unitpropdg.k	⊢ (𝜑 → 𝐾 ∈ Ring)
unitpropdg.l	⊢ (𝜑 → 𝐿 ∈ Ring)

Assertion

Ref	Expression
unitpropdg	⊢ (𝜑 → (Unit‘𝐾) = (Unit‘𝐿))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦

Proof of Theorem unitpropdg

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unitpropdg.1	. . . . . . 7 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		unitpropdg.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3		unitpropdg.3	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
4		unitpropdg.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Ring)
5		unitpropdg.l	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ Ring)
6	1, 2, 3, 4, 5	rngidpropdg 13702	. . . . . 6 ⊢ (𝜑 → (1r‘𝐾) = (1r‘𝐿))
7	6	breq2d 4045	. . . . 5 ⊢ (𝜑 → (𝑧(∥r‘𝐾)(1r‘𝐾) ↔ 𝑧(∥r‘𝐾)(1r‘𝐿)))
8	6	breq2d 4045	. . . . 5 ⊢ (𝜑 → (𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾) ↔ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿)))
9	7, 8	anbi12d 473	. . . 4 ⊢ (𝜑 → ((𝑧(∥r‘𝐾)(1r‘𝐾) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾)) ↔ (𝑧(∥r‘𝐾)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿))))
10		ringsrg 13603	. . . . . . . 8 ⊢ (𝐾 ∈ Ring → 𝐾 ∈ SRing)
11	4, 10	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ SRing)
12		ringsrg 13603	. . . . . . . 8 ⊢ (𝐿 ∈ Ring → 𝐿 ∈ SRing)
13	5, 12	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ SRing)
14	1, 2, 3, 11, 13	dvdsrpropdg 13703	. . . . . 6 ⊢ (𝜑 → (∥r‘𝐾) = (∥r‘𝐿))
15	14	breqd 4044	. . . . 5 ⊢ (𝜑 → (𝑧(∥r‘𝐾)(1r‘𝐿) ↔ 𝑧(∥r‘𝐿)(1r‘𝐿)))
16		eqid 2196	. . . . . . . . . 10 ⊢ (oppr‘𝐾) = (oppr‘𝐾)
17		eqid 2196	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
18	16, 17	opprbasg 13631	. . . . . . . . 9 ⊢ (𝐾 ∈ Ring → (Base‘𝐾) = (Base‘(oppr‘𝐾)))
19	4, 18	syl 14	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐾) = (Base‘(oppr‘𝐾)))
20	1, 19	eqtrd 2229	. . . . . . 7 ⊢ (𝜑 → 𝐵 = (Base‘(oppr‘𝐾)))
21		eqid 2196	. . . . . . . . . 10 ⊢ (oppr‘𝐿) = (oppr‘𝐿)
22		eqid 2196	. . . . . . . . . 10 ⊢ (Base‘𝐿) = (Base‘𝐿)
23	21, 22	opprbasg 13631	. . . . . . . . 9 ⊢ (𝐿 ∈ Ring → (Base‘𝐿) = (Base‘(oppr‘𝐿)))
24	5, 23	syl 14	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐿) = (Base‘(oppr‘𝐿)))
25	2, 24	eqtrd 2229	. . . . . . 7 ⊢ (𝜑 → 𝐵 = (Base‘(oppr‘𝐿)))
26	3	ancom2s 566	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
27	4	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝐾 ∈ Ring)
28		simprl 529	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
29		simprr 531	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
30		eqid 2196	. . . . . . . . . 10 ⊢ (.r‘𝐾) = (.r‘𝐾)
31		eqid 2196	. . . . . . . . . 10 ⊢ (.r‘(oppr‘𝐾)) = (.r‘(oppr‘𝐾))
32	17, 30, 16, 31	opprmulg 13627	. . . . . . . . 9 ⊢ ((𝐾 ∈ Ring ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑦(.r‘(oppr‘𝐾))𝑥) = (𝑥(.r‘𝐾)𝑦))
33	27, 28, 29, 32	syl3anc 1249	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(.r‘(oppr‘𝐾))𝑥) = (𝑥(.r‘𝐾)𝑦))
34	5	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝐿 ∈ Ring)
35		eqid 2196	. . . . . . . . . 10 ⊢ (.r‘𝐿) = (.r‘𝐿)
36		eqid 2196	. . . . . . . . . 10 ⊢ (.r‘(oppr‘𝐿)) = (.r‘(oppr‘𝐿))
37	22, 35, 21, 36	opprmulg 13627	. . . . . . . . 9 ⊢ ((𝐿 ∈ Ring ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑦(.r‘(oppr‘𝐿))𝑥) = (𝑥(.r‘𝐿)𝑦))
38	34, 28, 29, 37	syl3anc 1249	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(.r‘(oppr‘𝐿))𝑥) = (𝑥(.r‘𝐿)𝑦))
39	26, 33, 38	3eqtr4d 2239	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(.r‘(oppr‘𝐾))𝑥) = (𝑦(.r‘(oppr‘𝐿))𝑥))
40	16	opprring 13635	. . . . . . . 8 ⊢ (𝐾 ∈ Ring → (oppr‘𝐾) ∈ Ring)
41		ringsrg 13603	. . . . . . . 8 ⊢ ((oppr‘𝐾) ∈ Ring → (oppr‘𝐾) ∈ SRing)
42	4, 40, 41	3syl 17	. . . . . . 7 ⊢ (𝜑 → (oppr‘𝐾) ∈ SRing)
43	21	opprring 13635	. . . . . . . 8 ⊢ (𝐿 ∈ Ring → (oppr‘𝐿) ∈ Ring)
44		ringsrg 13603	. . . . . . . 8 ⊢ ((oppr‘𝐿) ∈ Ring → (oppr‘𝐿) ∈ SRing)
45	5, 43, 44	3syl 17	. . . . . . 7 ⊢ (𝜑 → (oppr‘𝐿) ∈ SRing)
46	20, 25, 39, 42, 45	dvdsrpropdg 13703	. . . . . 6 ⊢ (𝜑 → (∥r‘(oppr‘𝐾)) = (∥r‘(oppr‘𝐿)))
47	46	breqd 4044	. . . . 5 ⊢ (𝜑 → (𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿) ↔ 𝑧(∥r‘(oppr‘𝐿))(1r‘𝐿)))
48	15, 47	anbi12d 473	. . . 4 ⊢ (𝜑 → ((𝑧(∥r‘𝐾)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿)) ↔ (𝑧(∥r‘𝐿)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐿))(1r‘𝐿))))
49	9, 48	bitrd 188	. . 3 ⊢ (𝜑 → ((𝑧(∥r‘𝐾)(1r‘𝐾) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾)) ↔ (𝑧(∥r‘𝐿)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐿))(1r‘𝐿))))
50		eqidd 2197	. . . 4 ⊢ (𝜑 → (Unit‘𝐾) = (Unit‘𝐾))
51		eqidd 2197	. . . 4 ⊢ (𝜑 → (1r‘𝐾) = (1r‘𝐾))
52		eqidd 2197	. . . 4 ⊢ (𝜑 → (∥r‘𝐾) = (∥r‘𝐾))
53		eqidd 2197	. . . 4 ⊢ (𝜑 → (oppr‘𝐾) = (oppr‘𝐾))
54		eqidd 2197	. . . 4 ⊢ (𝜑 → (∥r‘(oppr‘𝐾)) = (∥r‘(oppr‘𝐾)))
55	50, 51, 52, 53, 54, 11	isunitd 13662	. . 3 ⊢ (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ (𝑧(∥r‘𝐾)(1r‘𝐾) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾))))
56		eqidd 2197	. . . 4 ⊢ (𝜑 → (Unit‘𝐿) = (Unit‘𝐿))
57		eqidd 2197	. . . 4 ⊢ (𝜑 → (1r‘𝐿) = (1r‘𝐿))
58		eqidd 2197	. . . 4 ⊢ (𝜑 → (∥r‘𝐿) = (∥r‘𝐿))
59		eqidd 2197	. . . 4 ⊢ (𝜑 → (oppr‘𝐿) = (oppr‘𝐿))
60		eqidd 2197	. . . 4 ⊢ (𝜑 → (∥r‘(oppr‘𝐿)) = (∥r‘(oppr‘𝐿)))
61	56, 57, 58, 59, 60, 13	isunitd 13662	. . 3 ⊢ (𝜑 → (𝑧 ∈ (Unit‘𝐿) ↔ (𝑧(∥r‘𝐿)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐿))(1r‘𝐿))))
62	49, 55, 61	3bitr4d 220	. 2 ⊢ (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ 𝑧 ∈ (Unit‘𝐿)))
63	62	eqrdv 2194	1 ⊢ (𝜑 → (Unit‘𝐾) = (Unit‘𝐿))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2167   class class class wbr 4033  ‘cfv 5258  (class class class)co 5922  Basecbs 12678  ._rcmulr 12756  1_rcur 13515  SRingcsrg 13519  Ringcrg 13552  opp_rcoppr 13623  ∥_rcdsr 13642  Unitcui 13643

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-pre-ltirr 7991  ax-pre-lttrn 7993  ax-pre-ltadd 7995

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-tpos 6303  df-pnf 8063  df-mnf 8064  df-ltxr 8066  df-inn 8991  df-2 9049  df-3 9050  df-ndx 12681  df-slot 12682  df-base 12684  df-sets 12685  df-plusg 12768  df-mulr 12769  df-0g 12929  df-mgm 12999  df-sgrp 13045  df-mnd 13058  df-grp 13135  df-minusg 13136  df-cmn 13416  df-abl 13417  df-mgp 13477  df-ur 13516  df-srg 13520  df-ring 13554  df-oppr 13624  df-dvdsr 13645  df-unit 13646

This theorem is referenced by:  invrpropdg  13705