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

Theorem unitpropdg 14282
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 14280 . . . . . 6 (𝜑 → (1r𝐾) = (1r𝐿))
76breq2d 4120 . . . . 5 (𝜑 → (𝑧(∥r𝐾)(1r𝐾) ↔ 𝑧(∥r𝐾)(1r𝐿)))
86breq2d 4120 . . . . 5 (𝜑 → (𝑧(∥r‘(oppr𝐾))(1r𝐾) ↔ 𝑧(∥r‘(oppr𝐾))(1r𝐿)))
97, 8anbi12d 473 . . . 4 (𝜑 → ((𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾)) ↔ (𝑧(∥r𝐾)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐿))))
10 ringsrg 14180 . . . . . . . 8 (𝐾 ∈ Ring → 𝐾 ∈ SRing)
114, 10syl 14 . . . . . . 7 (𝜑𝐾 ∈ SRing)
12 ringsrg 14180 . . . . . . . 8 (𝐿 ∈ Ring → 𝐿 ∈ SRing)
135, 12syl 14 . . . . . . 7 (𝜑𝐿 ∈ SRing)
141, 2, 3, 11, 13dvdsrpropdg 14281 . . . . . 6 (𝜑 → (∥r𝐾) = (∥r𝐿))
1514breqd 4119 . . . . 5 (𝜑 → (𝑧(∥r𝐾)(1r𝐿) ↔ 𝑧(∥r𝐿)(1r𝐿)))
16 eqid 2232 . . . . . . . . . 10 (oppr𝐾) = (oppr𝐾)
17 eqid 2232 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
1816, 17opprbasg 14208 . . . . . . . . 9 (𝐾 ∈ Ring → (Base‘𝐾) = (Base‘(oppr𝐾)))
194, 18syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐾) = (Base‘(oppr𝐾)))
201, 19eqtrd 2265 . . . . . . 7 (𝜑𝐵 = (Base‘(oppr𝐾)))
21 eqid 2232 . . . . . . . . . 10 (oppr𝐿) = (oppr𝐿)
22 eqid 2232 . . . . . . . . . 10 (Base‘𝐿) = (Base‘𝐿)
2321, 22opprbasg 14208 . . . . . . . . 9 (𝐿 ∈ Ring → (Base‘𝐿) = (Base‘(oppr𝐿)))
245, 23syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐿) = (Base‘(oppr𝐿)))
252, 24eqtrd 2265 . . . . . . 7 (𝜑𝐵 = (Base‘(oppr𝐿)))
263ancom2s 568 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
274adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝐾 ∈ Ring)
28 simprl 531 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝑦𝐵)
29 simprr 533 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝑥𝐵)
30 eqid 2232 . . . . . . . . . 10 (.r𝐾) = (.r𝐾)
31 eqid 2232 . . . . . . . . . 10 (.r‘(oppr𝐾)) = (.r‘(oppr𝐾))
3217, 30, 16, 31opprmulg 14204 . . . . . . . . 9 ((𝐾 ∈ Ring ∧ 𝑦𝐵𝑥𝐵) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑥(.r𝐾)𝑦))
3327, 28, 29, 32syl3anc 1274 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑥(.r𝐾)𝑦))
345adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → 𝐿 ∈ Ring)
35 eqid 2232 . . . . . . . . . 10 (.r𝐿) = (.r𝐿)
36 eqid 2232 . . . . . . . . . 10 (.r‘(oppr𝐿)) = (.r‘(oppr𝐿))
3722, 35, 21, 36opprmulg 14204 . . . . . . . . 9 ((𝐿 ∈ Ring ∧ 𝑦𝐵𝑥𝐵) → (𝑦(.r‘(oppr𝐿))𝑥) = (𝑥(.r𝐿)𝑦))
3834, 28, 29, 37syl3anc 1274 . . . . . . . 8 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐿))𝑥) = (𝑥(.r𝐿)𝑦))
3926, 33, 383eqtr4d 2275 . . . . . . 7 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(.r‘(oppr𝐾))𝑥) = (𝑦(.r‘(oppr𝐿))𝑥))
4016opprring 14212 . . . . . . . 8 (𝐾 ∈ Ring → (oppr𝐾) ∈ Ring)
41 ringsrg 14180 . . . . . . . 8 ((oppr𝐾) ∈ Ring → (oppr𝐾) ∈ SRing)
424, 40, 413syl 17 . . . . . . 7 (𝜑 → (oppr𝐾) ∈ SRing)
4321opprring 14212 . . . . . . . 8 (𝐿 ∈ Ring → (oppr𝐿) ∈ Ring)
44 ringsrg 14180 . . . . . . . 8 ((oppr𝐿) ∈ Ring → (oppr𝐿) ∈ SRing)
455, 43, 443syl 17 . . . . . . 7 (𝜑 → (oppr𝐿) ∈ SRing)
4620, 25, 39, 42, 45dvdsrpropdg 14281 . . . . . 6 (𝜑 → (∥r‘(oppr𝐾)) = (∥r‘(oppr𝐿)))
4746breqd 4119 . . . . 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 2233 . . . 4 (𝜑 → (Unit‘𝐾) = (Unit‘𝐾))
51 eqidd 2233 . . . 4 (𝜑 → (1r𝐾) = (1r𝐾))
52 eqidd 2233 . . . 4 (𝜑 → (∥r𝐾) = (∥r𝐾))
53 eqidd 2233 . . . 4 (𝜑 → (oppr𝐾) = (oppr𝐾))
54 eqidd 2233 . . . 4 (𝜑 → (∥r‘(oppr𝐾)) = (∥r‘(oppr𝐾)))
5550, 51, 52, 53, 54, 11isunitd 14240 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ (𝑧(∥r𝐾)(1r𝐾) ∧ 𝑧(∥r‘(oppr𝐾))(1r𝐾))))
56 eqidd 2233 . . . 4 (𝜑 → (Unit‘𝐿) = (Unit‘𝐿))
57 eqidd 2233 . . . 4 (𝜑 → (1r𝐿) = (1r𝐿))
58 eqidd 2233 . . . 4 (𝜑 → (∥r𝐿) = (∥r𝐿))
59 eqidd 2233 . . . 4 (𝜑 → (oppr𝐿) = (oppr𝐿))
60 eqidd 2233 . . . 4 (𝜑 → (∥r‘(oppr𝐿)) = (∥r‘(oppr𝐿)))
6156, 57, 58, 59, 60, 13isunitd 14240 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐿) ↔ (𝑧(∥r𝐿)(1r𝐿) ∧ 𝑧(∥r‘(oppr𝐿))(1r𝐿))))
6249, 55, 613bitr4d 220 . 2 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ 𝑧 ∈ (Unit‘𝐿)))
6362eqrdv 2230 1 (𝜑 → (Unit‘𝐾) = (Unit‘𝐿))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203   class class class wbr 4108  cfv 5351  (class class class)co 6049  Basecbs 13201  .rcmulr 13280  1rcur 14092  SRingcsrg 14096  Ringcrg 14129  opprcoppr 14200  rcdsr 14219  Unitcui 14220
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-addass 8225  ax-i2m1 8228  ax-0lt1 8229  ax-0id 8231  ax-rnegex 8232  ax-pre-ltirr 8235  ax-pre-lttrn 8237  ax-pre-ltadd 8239
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-tpos 6475  df-pnf 8306  df-mnf 8307  df-ltxr 8309  df-inn 9234  df-2 9292  df-3 9293  df-ndx 13204  df-slot 13205  df-base 13207  df-sets 13208  df-plusg 13292  df-mulr 13293  df-0g 13460  df-mgm 13558  df-sgrp 13604  df-mnd 13619  df-grp 13705  df-minusg 13706  df-cmn 13992  df-abl 13993  df-mgp 14054  df-ur 14093  df-srg 14097  df-ring 14131  df-oppr 14201  df-dvdsr 14222  df-unit 14223
This theorem is referenced by:  invrpropdg  14283
  Copyright terms: Public domain W3C validator