ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  unitpropdg GIF version

Theorem unitpropdg 14186
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.
StepHypRef 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)
61, 2, 3, 4, 5rngidpropdg 14184 . . . . . 6 (𝜑 → (1r𝐾) = (1r𝐿))
76breq2d 4101 . . . . 5 (𝜑 → (𝑧(∥r𝐾)(1r𝐾) ↔ 𝑧(∥r𝐾)(1r𝐿)))
86breq2d 4101 . . . . 5 (𝜑 → (𝑧(∥r‘(oppr𝐾))(1r𝐾) ↔ 𝑧(∥r‘(oppr𝐾))(1r𝐿)))
97, 8anbi12d 473 . . . 4 (𝜑 → ((𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾)) ↔ (𝑧(∥r𝐾)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐿))))
10 ringsrg 14084 . . . . . . . 8 (𝐾 ∈ Ring → 𝐾 ∈ SRing)
114, 10syl 14 . . . . . . 7 (𝜑𝐾 ∈ SRing)
12 ringsrg 14084 . . . . . . . 8 (𝐿 ∈ Ring → 𝐿 ∈ SRing)
135, 12syl 14 . . . . . . 7 (𝜑𝐿 ∈ SRing)
141, 2, 3, 11, 13dvdsrpropdg 14185 . . . . . 6 (𝜑 → (∥r𝐾) = (∥r𝐿))
1514breqd 4100 . . . . 5 (𝜑 → (𝑧(∥r𝐾)(1r𝐿) ↔ 𝑧(∥r𝐿)(1r𝐿)))
16 eqid 2230 . . . . . . . . . 10 (oppr𝐾) = (oppr𝐾)
17 eqid 2230 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
1816, 17opprbasg 14112 . . . . . . . . 9 (𝐾 ∈ Ring → (Base‘𝐾) = (Base‘(oppr𝐾)))
194, 18syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐾) = (Base‘(oppr𝐾)))
201, 19eqtrd 2263 . . . . . . 7 (𝜑𝐵 = (Base‘(oppr𝐾)))
21 eqid 2230 . . . . . . . . . 10 (oppr𝐿) = (oppr𝐿)
22 eqid 2230 . . . . . . . . . 10 (Base‘𝐿) = (Base‘𝐿)
2321, 22opprbasg 14112 . . . . . . . . 9 (𝐿 ∈ Ring → (Base‘𝐿) = (Base‘(oppr𝐿)))
245, 23syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐿) = (Base‘(oppr𝐿)))
252, 24eqtrd 2263 . . . . . . 7 (𝜑𝐵 = (Base‘(oppr𝐿)))
263ancom2s 568 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
274adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝐾 ∈ Ring)
28 simprl 531 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝑦𝐵)
29 simprr 533 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝑥𝐵)
30 eqid 2230 . . . . . . . . . 10 (.r𝐾) = (.r𝐾)
31 eqid 2230 . . . . . . . . . 10 (.r‘(oppr𝐾)) = (.r‘(oppr𝐾))
3217, 30, 16, 31opprmulg 14108 . . . . . . . . 9 ((𝐾 ∈ Ring ∧ 𝑦𝐵𝑥𝐵) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑥(.r𝐾)𝑦))
3327, 28, 29, 32syl3anc 1273 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑥(.r𝐾)𝑦))
345adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝐿 ∈ Ring)
35 eqid 2230 . . . . . . . . . 10 (.r𝐿) = (.r𝐿)
36 eqid 2230 . . . . . . . . . 10 (.r‘(oppr𝐿)) = (.r‘(oppr𝐿))
3722, 35, 21, 36opprmulg 14108 . . . . . . . . 9 ((𝐿 ∈ Ring ∧ 𝑦𝐵𝑥𝐵) → (𝑦(.r‘(oppr𝐿))𝑥) = (𝑥(.r𝐿)𝑦))
3834, 28, 29, 37syl3anc 1273 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐿))𝑥) = (𝑥(.r𝐿)𝑦))
3926, 33, 383eqtr4d 2273 . . . . . . 7 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑦(.r‘(oppr𝐿))𝑥))
4016opprring 14116 . . . . . . . 8 (𝐾 ∈ Ring → (oppr𝐾) ∈ Ring)
41 ringsrg 14084 . . . . . . . 8 ((oppr𝐾) ∈ Ring → (oppr𝐾) ∈ SRing)
424, 40, 413syl 17 . . . . . . 7 (𝜑 → (oppr𝐾) ∈ SRing)
4321opprring 14116 . . . . . . . 8 (𝐿 ∈ Ring → (oppr𝐿) ∈ Ring)
44 ringsrg 14084 . . . . . . . 8 ((oppr𝐿) ∈ Ring → (oppr𝐿) ∈ SRing)
455, 43, 443syl 17 . . . . . . 7 (𝜑 → (oppr𝐿) ∈ SRing)
4620, 25, 39, 42, 45dvdsrpropdg 14185 . . . . . 6 (𝜑 → (∥r‘(oppr𝐾)) = (∥r‘(oppr𝐿)))
4746breqd 4100 . . . . 5 (𝜑 → (𝑧(∥r‘(oppr𝐾))(1r𝐿) ↔ 𝑧(∥r‘(oppr𝐿))(1r𝐿)))
4815, 47anbi12d 473 . . . 4 (𝜑 → ((𝑧(∥r𝐾)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐿)) ↔ (𝑧(∥r𝐿)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐿))(1r𝐿))))
499, 48bitrd 188 . . 3 (𝜑 → ((𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾)) ↔ (𝑧(∥r𝐿)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐿))(1r𝐿))))
50 eqidd 2231 . . . 4 (𝜑 → (Unit‘𝐾) = (Unit‘𝐾))
51 eqidd 2231 . . . 4 (𝜑 → (1r𝐾) = (1r𝐾))
52 eqidd 2231 . . . 4 (𝜑 → (∥r𝐾) = (∥r𝐾))
53 eqidd 2231 . . . 4 (𝜑 → (oppr𝐾) = (oppr𝐾))
54 eqidd 2231 . . . 4 (𝜑 → (∥r‘(oppr𝐾)) = (∥r‘(oppr𝐾)))
5550, 51, 52, 53, 54, 11isunitd 14144 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ (𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾))))
56 eqidd 2231 . . . 4 (𝜑 → (Unit‘𝐿) = (Unit‘𝐿))
57 eqidd 2231 . . . 4 (𝜑 → (1r𝐿) = (1r𝐿))
58 eqidd 2231 . . . 4 (𝜑 → (∥r𝐿) = (∥r𝐿))
59 eqidd 2231 . . . 4 (𝜑 → (oppr𝐿) = (oppr𝐿))
60 eqidd 2231 . . . 4 (𝜑 → (∥r‘(oppr𝐿)) = (∥r‘(oppr𝐿)))
6156, 57, 58, 59, 60, 13isunitd 14144 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐿) ↔ (𝑧(∥r𝐿)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐿))(1r𝐿))))
6249, 55, 613bitr4d 220 . 2 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ 𝑧 ∈ (Unit‘𝐿)))
6362eqrdv 2228 1 (𝜑 → (Unit‘𝐾) = (Unit‘𝐿))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2201   class class class wbr 4089  cfv 5328  (class class class)co 6023  Basecbs 13105  .rcmulr 13184  1rcur 13996  SRingcsrg 14000  Ringcrg 14033  opprcoppr 14104  rcdsr 14123  Unitcui 14124
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-addass 8139  ax-i2m1 8142  ax-0lt1 8143  ax-0id 8145  ax-rnegex 8146  ax-pre-ltirr 8149  ax-pre-lttrn 8151  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-tpos 6416  df-pnf 8221  df-mnf 8222  df-ltxr 8224  df-inn 9149  df-2 9207  df-3 9208  df-ndx 13108  df-slot 13109  df-base 13111  df-sets 13112  df-plusg 13196  df-mulr 13197  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-grp 13609  df-minusg 13610  df-cmn 13896  df-abl 13897  df-mgp 13958  df-ur 13997  df-srg 14001  df-ring 14035  df-oppr 14105  df-dvdsr 14126  df-unit 14127
This theorem is referenced by:  invrpropdg  14187
  Copyright terms: Public domain W3C validator