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

Theorem unitpropdg 14165
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 14163 . . . . . 6 (𝜑 → (1r𝐾) = (1r𝐿))
76breq2d 4100 . . . . 5 (𝜑 → (𝑧(∥r𝐾)(1r𝐾) ↔ 𝑧(∥r𝐾)(1r𝐿)))
86breq2d 4100 . . . . 5 (𝜑 → (𝑧(∥r‘(oppr𝐾))(1r𝐾) ↔ 𝑧(∥r‘(oppr𝐾))(1r𝐿)))
97, 8anbi12d 473 . . . 4 (𝜑 → ((𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾)) ↔ (𝑧(∥r𝐾)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐿))))
10 ringsrg 14063 . . . . . . . 8 (𝐾 ∈ Ring → 𝐾 ∈ SRing)
114, 10syl 14 . . . . . . 7 (𝜑𝐾 ∈ SRing)
12 ringsrg 14063 . . . . . . . 8 (𝐿 ∈ Ring → 𝐿 ∈ SRing)
135, 12syl 14 . . . . . . 7 (𝜑𝐿 ∈ SRing)
141, 2, 3, 11, 13dvdsrpropdg 14164 . . . . . 6 (𝜑 → (∥r𝐾) = (∥r𝐿))
1514breqd 4099 . . . . 5 (𝜑 → (𝑧(∥r𝐾)(1r𝐿) ↔ 𝑧(∥r𝐿)(1r𝐿)))
16 eqid 2231 . . . . . . . . . 10 (oppr𝐾) = (oppr𝐾)
17 eqid 2231 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
1816, 17opprbasg 14091 . . . . . . . . 9 (𝐾 ∈ Ring → (Base‘𝐾) = (Base‘(oppr𝐾)))
194, 18syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐾) = (Base‘(oppr𝐾)))
201, 19eqtrd 2264 . . . . . . 7 (𝜑𝐵 = (Base‘(oppr𝐾)))
21 eqid 2231 . . . . . . . . . 10 (oppr𝐿) = (oppr𝐿)
22 eqid 2231 . . . . . . . . . 10 (Base‘𝐿) = (Base‘𝐿)
2321, 22opprbasg 14091 . . . . . . . . 9 (𝐿 ∈ Ring → (Base‘𝐿) = (Base‘(oppr𝐿)))
245, 23syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐿) = (Base‘(oppr𝐿)))
252, 24eqtrd 2264 . . . . . . 7 (𝜑𝐵 = (Base‘(oppr𝐿)))
263ancom2s 568 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
274adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝐾 ∈ Ring)
28 simprl 531 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝑦𝐵)
29 simprr 533 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝑥𝐵)
30 eqid 2231 . . . . . . . . . 10 (.r𝐾) = (.r𝐾)
31 eqid 2231 . . . . . . . . . 10 (.r‘(oppr𝐾)) = (.r‘(oppr𝐾))
3217, 30, 16, 31opprmulg 14087 . . . . . . . . 9 ((𝐾 ∈ Ring ∧ 𝑦𝐵𝑥𝐵) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑥(.r𝐾)𝑦))
3327, 28, 29, 32syl3anc 1273 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑥(.r𝐾)𝑦))
345adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝐿 ∈ Ring)
35 eqid 2231 . . . . . . . . . 10 (.r𝐿) = (.r𝐿)
36 eqid 2231 . . . . . . . . . 10 (.r‘(oppr𝐿)) = (.r‘(oppr𝐿))
3722, 35, 21, 36opprmulg 14087 . . . . . . . . 9 ((𝐿 ∈ Ring ∧ 𝑦𝐵𝑥𝐵) → (𝑦(.r‘(oppr𝐿))𝑥) = (𝑥(.r𝐿)𝑦))
3834, 28, 29, 37syl3anc 1273 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐿))𝑥) = (𝑥(.r𝐿)𝑦))
3926, 33, 383eqtr4d 2274 . . . . . . 7 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑦(.r‘(oppr𝐿))𝑥))
4016opprring 14095 . . . . . . . 8 (𝐾 ∈ Ring → (oppr𝐾) ∈ Ring)
41 ringsrg 14063 . . . . . . . 8 ((oppr𝐾) ∈ Ring → (oppr𝐾) ∈ SRing)
424, 40, 413syl 17 . . . . . . 7 (𝜑 → (oppr𝐾) ∈ SRing)
4321opprring 14095 . . . . . . . 8 (𝐿 ∈ Ring → (oppr𝐿) ∈ Ring)
44 ringsrg 14063 . . . . . . . 8 ((oppr𝐿) ∈ Ring → (oppr𝐿) ∈ SRing)
455, 43, 443syl 17 . . . . . . 7 (𝜑 → (oppr𝐿) ∈ SRing)
4620, 25, 39, 42, 45dvdsrpropdg 14164 . . . . . 6 (𝜑 → (∥r‘(oppr𝐾)) = (∥r‘(oppr𝐿)))
4746breqd 4099 . . . . 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 2232 . . . 4 (𝜑 → (Unit‘𝐾) = (Unit‘𝐾))
51 eqidd 2232 . . . 4 (𝜑 → (1r𝐾) = (1r𝐾))
52 eqidd 2232 . . . 4 (𝜑 → (∥r𝐾) = (∥r𝐾))
53 eqidd 2232 . . . 4 (𝜑 → (oppr𝐾) = (oppr𝐾))
54 eqidd 2232 . . . 4 (𝜑 → (∥r‘(oppr𝐾)) = (∥r‘(oppr𝐾)))
5550, 51, 52, 53, 54, 11isunitd 14123 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ (𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾))))
56 eqidd 2232 . . . 4 (𝜑 → (Unit‘𝐿) = (Unit‘𝐿))
57 eqidd 2232 . . . 4 (𝜑 → (1r𝐿) = (1r𝐿))
58 eqidd 2232 . . . 4 (𝜑 → (∥r𝐿) = (∥r𝐿))
59 eqidd 2232 . . . 4 (𝜑 → (oppr𝐿) = (oppr𝐿))
60 eqidd 2232 . . . 4 (𝜑 → (∥r‘(oppr𝐿)) = (∥r‘(oppr𝐿)))
6156, 57, 58, 59, 60, 13isunitd 14123 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐿) ↔ (𝑧(∥r𝐿)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐿))(1r𝐿))))
6249, 55, 613bitr4d 220 . 2 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ 𝑧 ∈ (Unit‘𝐿)))
6362eqrdv 2229 1 (𝜑 → (Unit‘𝐾) = (Unit‘𝐿))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202   class class class wbr 4088  cfv 5326  (class class class)co 6018  Basecbs 13084  .rcmulr 13163  1rcur 13975  SRingcsrg 13979  Ringcrg 14012  opprcoppr 14083  rcdsr 14102  Unitcui 14103
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-tpos 6411  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13087  df-slot 13088  df-base 13090  df-sets 13091  df-plusg 13175  df-mulr 13176  df-0g 13343  df-mgm 13441  df-sgrp 13487  df-mnd 13502  df-grp 13588  df-minusg 13589  df-cmn 13875  df-abl 13876  df-mgp 13937  df-ur 13976  df-srg 13980  df-ring 14014  df-oppr 14084  df-dvdsr 14105  df-unit 14106
This theorem is referenced by:  invrpropdg  14166
  Copyright terms: Public domain W3C validator