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

Theorem unitpropdg 14539
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 14537 . . . . . 6 (𝜑 → (1r‘𝐾) = (1r‘𝐿))
76breq2d 4142 . . . . 5 (𝜑 → (𝑧(∥r‘𝐾)(1r‘𝐾) ↔ 𝑧(∥r‘𝐾)(1r‘𝐿)))
86breq2d 4142 . . . . 5 (𝜑 → (𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾) ↔ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿)))
97, 8anbi12d 477 . . . 4 (𝜑 → ((𝑧(∥r‘𝐾)(1r‘𝐾) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾)) ↔ (𝑧(∥r‘𝐾)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿))))
10 ringsrg 14436 . . . . . . . 8 (𝐾 ∈ Ring → 𝐾 ∈ SRing)
114, 10syl 14 . . . . . . 7 (𝜑 → 𝐾 ∈ SRing)
12 ringsrg 14436 . . . . . . . 8 (𝐿 ∈ Ring → 𝐿 ∈ SRing)
135, 12syl 14 . . . . . . 7 (𝜑 → 𝐿 ∈ SRing)
141, 2, 3, 11, 13dvdsrpropdg 14538 . . . . . 6 (𝜑 → (∥r‘𝐾) = (∥r‘𝐿))
1514breqd 4141 . . . . 5 (𝜑 → (𝑧(∥r‘𝐾)(1r‘𝐿) ↔ 𝑧(∥r‘𝐿)(1r‘𝐿)))
16 eqid 2238 . . . . . . . . . 10 (oppr‘𝐾) = (oppr‘𝐾)
17 eqid 2238 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
1816, 17opprbasg 14464 . . . . . . . . 9 (𝐾 ∈ Ring → (Base‘𝐾) = (Base‘(oppr‘𝐾)))
194, 18syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐾) = (Base‘(oppr‘𝐾)))
201, 19eqtrd 2271 . . . . . . 7 (𝜑 → 𝐵 = (Base‘(oppr‘𝐾)))
21 eqid 2238 . . . . . . . . . 10 (oppr‘𝐿) = (oppr‘𝐿)
22 eqid 2238 . . . . . . . . . 10 (Base‘𝐿) = (Base‘𝐿)
2321, 22opprbasg 14464 . . . . . . . . 9 (𝐿 ∈ Ring → (Base‘𝐿) = (Base‘(oppr‘𝐿)))
245, 23syl 14 . . . . . . . 8 (𝜑 → (Base‘𝐿) = (Base‘(oppr‘𝐿)))
252, 24eqtrd 2271 . . . . . . 7 (𝜑 → 𝐵 = (Base‘(oppr‘𝐿)))
263ancom2s 572 . . . . . . . 8 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
274adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝐾 ∈ Ring)
28 simprl 535 . . . . . . . . 9 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
29 simprr 537 . . . . . . . . 9 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
30 eqid 2238 . . . . . . . . . 10 (.r‘𝐾) = (.r‘𝐾)
31 eqid 2238 . . . . . . . . . 10 (.r‘(oppr‘𝐾)) = (.r‘(oppr‘𝐾))
3217, 30, 16, 31opprmulg 14460 . . . . . . . . 9 ((𝐾 ∈ Ring ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑦(.r‘(oppr‘𝐾))𝑥) = (𝑥(.r‘𝐾)𝑦))
3327, 28, 29, 32syl3anc 1278 . . . . . . . 8 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(.r‘(oppr‘𝐾))𝑥) = (𝑥(.r‘𝐾)𝑦))
345adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → 𝐿 ∈ Ring)
35 eqid 2238 . . . . . . . . . 10 (.r‘𝐿) = (.r‘𝐿)
36 eqid 2238 . . . . . . . . . 10 (.r‘(oppr‘𝐿)) = (.r‘(oppr‘𝐿))
3722, 35, 21, 36opprmulg 14460 . . . . . . . . 9 ((𝐿 ∈ Ring ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑦(.r‘(oppr‘𝐿))𝑥) = (𝑥(.r‘𝐿)𝑦))
3834, 28, 29, 37syl3anc 1278 . . . . . . . 8 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(.r‘(oppr‘𝐿))𝑥) = (𝑥(.r‘𝐿)𝑦))
3926, 33, 383eqtr4d 2281 . . . . . . 7 ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(.r‘(oppr‘𝐾))𝑥) = (𝑦(.r‘(oppr‘𝐿))𝑥))
4016opprring 14468 . . . . . . . 8 (𝐾 ∈ Ring → (oppr‘𝐾) ∈ Ring)
41 ringsrg 14436 . . . . . . . 8 ((oppr‘𝐾) ∈ Ring → (oppr‘𝐾) ∈ SRing)
424, 40, 413syl 17 . . . . . . 7 (𝜑 → (oppr‘𝐾) ∈ SRing)
4321opprring 14468 . . . . . . . 8 (𝐿 ∈ Ring → (oppr‘𝐿) ∈ Ring)
44 ringsrg 14436 . . . . . . . 8 ((oppr‘𝐿) ∈ Ring → (oppr‘𝐿) ∈ SRing)
455, 43, 443syl 17 . . . . . . 7 (𝜑 → (oppr‘𝐿) ∈ SRing)
4620, 25, 39, 42, 45dvdsrpropdg 14538 . . . . . 6 (𝜑 → (∥r‘(oppr‘𝐾)) = (∥r‘(oppr‘𝐿)))
4746breqd 4141 . . . . 5 (𝜑 → (𝑧(∥r‘(oppr‘𝐾))(1r‘𝐿) ↔ 𝑧(∥r‘(oppr‘𝐿))(1r‘𝐿)))
4815, 47anbi12d 477 . . . 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 2239 . . . 4 (𝜑 → (Unit‘𝐾) = (Unit‘𝐾))
51 eqidd 2239 . . . 4 (𝜑 → (1r‘𝐾) = (1r‘𝐾))
52 eqidd 2239 . . . 4 (𝜑 → (∥r‘𝐾) = (∥r‘𝐾))
53 eqidd 2239 . . . 4 (𝜑 → (oppr‘𝐾) = (oppr‘𝐾))
54 eqidd 2239 . . . 4 (𝜑 → (∥r‘(oppr‘𝐾)) = (∥r‘(oppr‘𝐾)))
5550, 51, 52, 53, 54, 11isunitd 14497 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ (𝑧(∥r‘𝐾)(1r‘𝐾) ∧ 𝑧(∥r‘(oppr‘𝐾))(1r‘𝐾))))
56 eqidd 2239 . . . 4 (𝜑 → (Unit‘𝐿) = (Unit‘𝐿))
57 eqidd 2239 . . . 4 (𝜑 → (1r‘𝐿) = (1r‘𝐿))
58 eqidd 2239 . . . 4 (𝜑 → (∥r‘𝐿) = (∥r‘𝐿))
59 eqidd 2239 . . . 4 (𝜑 → (oppr‘𝐿) = (oppr‘𝐿))
60 eqidd 2239 . . . 4 (𝜑 → (∥r‘(oppr‘𝐿)) = (∥r‘(oppr‘𝐿)))
6156, 57, 58, 59, 60, 13isunitd 14497 . . 3 (𝜑 → (𝑧 ∈ (Unit‘𝐿) ↔ (𝑧(∥r‘𝐿)(1r‘𝐿) ∧ 𝑧(∥r‘(oppr‘𝐿))(1r‘𝐿))))
6249, 55, 613bitr4d 220 . 2 (𝜑 → (𝑧 ∈ (Unit‘𝐾) ↔ 𝑧 ∈ (Unit‘𝐿)))
6362eqrdv 2236 1 (𝜑 → (Unit‘𝐾) = (Unit‘𝐿))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  .rcmulr 13485  1rcur 14346  SRingcsrg 14351  Ringcrg 14384  opprcoppr 14456  ∥rcdsr 14476  Unitcui 14477
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-plusg 13497  df-mulr 13498  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-cmn 14173  df-abl 14174  df-mgp 14302  df-ur 14347  df-srg 14352  df-ring 14386  df-oppr 14457  df-dvdsr 14479  df-unit 14480
This theorem is used by:  invrpropdg  14540  aprprop  14685
  Copyright terms: Public domain W3C validator