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

Theorem elrhmunit 13733
Description: Ring homomorphisms preserve unit elements. (Contributed by Thierry Arnoux, 23-Oct-2017.)
Assertion
Ref Expression
elrhmunit ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴) ∈ (Unit‘𝑆))

Proof of Theorem elrhmunit
StepHypRef Expression
1 simpl 109 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐹 ∈ (𝑅 RingHom 𝑆))
2 eqidd 2197 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Base‘𝑅) = (Base‘𝑅))
3 eqidd 2197 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Unit‘𝑅) = (Unit‘𝑅))
4 rhmrcl1 13711 . . . . . . 7 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑅 ∈ Ring)
54adantr 276 . . . . . 6 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑅 ∈ Ring)
6 ringsrg 13603 . . . . . 6 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
75, 6syl 14 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑅 ∈ SRing)
8 simpr 110 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴 ∈ (Unit‘𝑅))
92, 3, 7, 8unitcld 13664 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴 ∈ (Base‘𝑅))
10 eqid 2196 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
11 eqid 2196 . . . . . 6 (1r𝑅) = (1r𝑅)
1210, 11ringidcl 13576 . . . . 5 (𝑅 ∈ Ring → (1r𝑅) ∈ (Base‘𝑅))
131, 4, 123syl 17 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑅) ∈ (Base‘𝑅))
14 eqidd 2197 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑅) = (1r𝑅))
15 eqidd 2197 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r𝑅) = (∥r𝑅))
16 eqidd 2197 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (oppr𝑅) = (oppr𝑅))
17 eqidd 2197 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r‘(oppr𝑅)) = (∥r‘(oppr𝑅)))
183, 14, 15, 16, 17, 7isunitd 13662 . . . . . 6 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐴 ∈ (Unit‘𝑅) ↔ (𝐴(∥r𝑅)(1r𝑅) ∧ 𝐴(∥r‘(oppr𝑅))(1r𝑅))))
198, 18mpbid 147 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐴(∥r𝑅)(1r𝑅) ∧ 𝐴(∥r‘(oppr𝑅))(1r𝑅)))
2019simpld 112 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴(∥r𝑅)(1r𝑅))
21 eqid 2196 . . . . 5 (∥r𝑅) = (∥r𝑅)
22 eqid 2196 . . . . 5 (∥r𝑆) = (∥r𝑆)
2310, 21, 22rhmdvdsr 13731 . . . 4 (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Base‘𝑅) ∧ (1r𝑅) ∈ (Base‘𝑅)) ∧ 𝐴(∥r𝑅)(1r𝑅)) → (𝐹𝐴)(∥r𝑆)(𝐹‘(1r𝑅)))
241, 9, 13, 20, 23syl31anc 1252 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴)(∥r𝑆)(𝐹‘(1r𝑅)))
25 eqid 2196 . . . . . 6 (1r𝑆) = (1r𝑆)
2611, 25rhm1 13723 . . . . 5 (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘(1r𝑅)) = (1r𝑆))
2726breq2d 4045 . . . 4 (𝐹 ∈ (𝑅 RingHom 𝑆) → ((𝐹𝐴)(∥r𝑆)(𝐹‘(1r𝑅)) ↔ (𝐹𝐴)(∥r𝑆)(1r𝑆)))
2827adantr 276 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → ((𝐹𝐴)(∥r𝑆)(𝐹‘(1r𝑅)) ↔ (𝐹𝐴)(∥r𝑆)(1r𝑆)))
2924, 28mpbid 147 . 2 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴)(∥r𝑆)(1r𝑆))
30 rhmopp 13732 . . . . 5 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 ∈ ((oppr𝑅) RingHom (oppr𝑆)))
3130adantr 276 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐹 ∈ ((oppr𝑅) RingHom (oppr𝑆)))
32 eqid 2196 . . . . . . 7 (oppr𝑅) = (oppr𝑅)
3332, 10opprbasg 13631 . . . . . 6 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘(oppr𝑅)))
345, 33syl 14 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Base‘𝑅) = (Base‘(oppr𝑅)))
359, 34eleqtrd 2275 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴 ∈ (Base‘(oppr𝑅)))
3613, 34eleqtrd 2275 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑅) ∈ (Base‘(oppr𝑅)))
3719simprd 114 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴(∥r‘(oppr𝑅))(1r𝑅))
38 eqid 2196 . . . . 5 (Base‘(oppr𝑅)) = (Base‘(oppr𝑅))
39 eqid 2196 . . . . 5 (∥r‘(oppr𝑅)) = (∥r‘(oppr𝑅))
40 eqid 2196 . . . . 5 (∥r‘(oppr𝑆)) = (∥r‘(oppr𝑆))
4138, 39, 40rhmdvdsr 13731 . . . 4 (((𝐹 ∈ ((oppr𝑅) RingHom (oppr𝑆)) ∧ 𝐴 ∈ (Base‘(oppr𝑅)) ∧ (1r𝑅) ∈ (Base‘(oppr𝑅))) ∧ 𝐴(∥r‘(oppr𝑅))(1r𝑅)) → (𝐹𝐴)(∥r‘(oppr𝑆))(𝐹‘(1r𝑅)))
4231, 35, 36, 37, 41syl31anc 1252 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴)(∥r‘(oppr𝑆))(𝐹‘(1r𝑅)))
4326breq2d 4045 . . . 4 (𝐹 ∈ (𝑅 RingHom 𝑆) → ((𝐹𝐴)(∥r‘(oppr𝑆))(𝐹‘(1r𝑅)) ↔ (𝐹𝐴)(∥r‘(oppr𝑆))(1r𝑆)))
4443adantr 276 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → ((𝐹𝐴)(∥r‘(oppr𝑆))(𝐹‘(1r𝑅)) ↔ (𝐹𝐴)(∥r‘(oppr𝑆))(1r𝑆)))
4542, 44mpbid 147 . 2 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴)(∥r‘(oppr𝑆))(1r𝑆))
46 eqidd 2197 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Unit‘𝑆) = (Unit‘𝑆))
47 eqidd 2197 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑆) = (1r𝑆))
48 eqidd 2197 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r𝑆) = (∥r𝑆))
49 eqidd 2197 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (oppr𝑆) = (oppr𝑆))
50 eqidd 2197 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r‘(oppr𝑆)) = (∥r‘(oppr𝑆)))
51 rhmrcl2 13712 . . . . 5 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑆 ∈ Ring)
5251adantr 276 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑆 ∈ Ring)
53 ringsrg 13603 . . . 4 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
5452, 53syl 14 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑆 ∈ SRing)
5546, 47, 48, 49, 50, 54isunitd 13662 . 2 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → ((𝐹𝐴) ∈ (Unit‘𝑆) ↔ ((𝐹𝐴)(∥r𝑆)(1r𝑆) ∧ (𝐹𝐴)(∥r‘(oppr𝑆))(1r𝑆))))
5629, 45, 55mpbir2and 946 1 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴) ∈ (Unit‘𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1364  wcel 2167   class class class wbr 4033  cfv 5258  (class class class)co 5922  Basecbs 12678  1rcur 13515  SRingcsrg 13519  Ringcrg 13552  opprcoppr 13623  rcdsr 13642  Unitcui 13643   RingHom crh 13706
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-1st 6198  df-2nd 6199  df-tpos 6303  df-map 6709  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-mhm 13091  df-grp 13135  df-minusg 13136  df-ghm 13371  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  df-rhm 13708
This theorem is referenced by:  rhmunitinv  13734
  Copyright terms: Public domain W3C validator