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

Theorem elrhmunit 14197
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 2232 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Base‘𝑅) = (Base‘𝑅))
3 eqidd 2232 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Unit‘𝑅) = (Unit‘𝑅))
4 rhmrcl1 14175 . . . . . . 7 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑅 ∈ Ring)
54adantr 276 . . . . . 6 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑅 ∈ Ring)
6 ringsrg 14066 . . . . . 6 (𝑅 ∈ Ring → 𝑅 ∈ SRing)
75, 6syl 14 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑅 ∈ SRing)
8 simpr 110 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴 ∈ (Unit‘𝑅))
92, 3, 7, 8unitcld 14128 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴 ∈ (Base‘𝑅))
10 eqid 2231 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
11 eqid 2231 . . . . . 6 (1r𝑅) = (1r𝑅)
1210, 11ringidcl 14039 . . . . 5 (𝑅 ∈ Ring → (1r𝑅) ∈ (Base‘𝑅))
131, 4, 123syl 17 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑅) ∈ (Base‘𝑅))
14 eqidd 2232 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑅) = (1r𝑅))
15 eqidd 2232 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r𝑅) = (∥r𝑅))
16 eqidd 2232 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (oppr𝑅) = (oppr𝑅))
17 eqidd 2232 . . . . . . 7 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r‘(oppr𝑅)) = (∥r‘(oppr𝑅)))
183, 14, 15, 16, 17, 7isunitd 14126 . . . . . 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 2231 . . . . 5 (∥r𝑅) = (∥r𝑅)
22 eqid 2231 . . . . 5 (∥r𝑆) = (∥r𝑆)
2310, 21, 22rhmdvdsr 14195 . . . 4 (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Base‘𝑅) ∧ (1r𝑅) ∈ (Base‘𝑅)) ∧ 𝐴(∥r𝑅)(1r𝑅)) → (𝐹𝐴)(∥r𝑆)(𝐹‘(1r𝑅)))
241, 9, 13, 20, 23syl31anc 1276 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴)(∥r𝑆)(𝐹‘(1r𝑅)))
25 eqid 2231 . . . . . 6 (1r𝑆) = (1r𝑆)
2611, 25rhm1 14187 . . . . 5 (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘(1r𝑅)) = (1r𝑆))
2726breq2d 4100 . . . 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 14196 . . . . 5 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 ∈ ((oppr𝑅) RingHom (oppr𝑆)))
3130adantr 276 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐹 ∈ ((oppr𝑅) RingHom (oppr𝑆)))
32 eqid 2231 . . . . . . 7 (oppr𝑅) = (oppr𝑅)
3332, 10opprbasg 14094 . . . . . 6 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘(oppr𝑅)))
345, 33syl 14 . . . . 5 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Base‘𝑅) = (Base‘(oppr𝑅)))
359, 34eleqtrd 2310 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴 ∈ (Base‘(oppr𝑅)))
3613, 34eleqtrd 2310 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑅) ∈ (Base‘(oppr𝑅)))
3719simprd 114 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝐴(∥r‘(oppr𝑅))(1r𝑅))
38 eqid 2231 . . . . 5 (Base‘(oppr𝑅)) = (Base‘(oppr𝑅))
39 eqid 2231 . . . . 5 (∥r‘(oppr𝑅)) = (∥r‘(oppr𝑅))
40 eqid 2231 . . . . 5 (∥r‘(oppr𝑆)) = (∥r‘(oppr𝑆))
4138, 39, 40rhmdvdsr 14195 . . . 4 (((𝐹 ∈ ((oppr𝑅) RingHom (oppr𝑆)) ∧ 𝐴 ∈ (Base‘(oppr𝑅)) ∧ (1r𝑅) ∈ (Base‘(oppr𝑅))) ∧ 𝐴(∥r‘(oppr𝑅))(1r𝑅)) → (𝐹𝐴)(∥r‘(oppr𝑆))(𝐹‘(1r𝑅)))
4231, 35, 36, 37, 41syl31anc 1276 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴)(∥r‘(oppr𝑆))(𝐹‘(1r𝑅)))
4326breq2d 4100 . . . 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 2232 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (Unit‘𝑆) = (Unit‘𝑆))
47 eqidd 2232 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (1r𝑆) = (1r𝑆))
48 eqidd 2232 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r𝑆) = (∥r𝑆))
49 eqidd 2232 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (oppr𝑆) = (oppr𝑆))
50 eqidd 2232 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (∥r‘(oppr𝑆)) = (∥r‘(oppr𝑆)))
51 rhmrcl2 14176 . . . . 5 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑆 ∈ Ring)
5251adantr 276 . . . 4 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑆 ∈ Ring)
53 ringsrg 14066 . . . 4 (𝑆 ∈ Ring → 𝑆 ∈ SRing)
5452, 53syl 14 . . 3 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → 𝑆 ∈ SRing)
5546, 47, 48, 49, 50, 54isunitd 14126 . 2 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → ((𝐹𝐴) ∈ (Unit‘𝑆) ↔ ((𝐹𝐴)(∥r𝑆)(1r𝑆) ∧ (𝐹𝐴)(∥r‘(oppr𝑆))(1r𝑆))))
5629, 45, 55mpbir2and 952 1 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ (Unit‘𝑅)) → (𝐹𝐴) ∈ (Unit‘𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1397  wcel 2202   class class class wbr 4088  cfv 5326  (class class class)co 6018  Basecbs 13087  1rcur 13978  SRingcsrg 13982  Ringcrg 14015  opprcoppr 14086  rcdsr 14105  Unitcui 14106   RingHom crh 14170
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-1st 6303  df-2nd 6304  df-tpos 6411  df-map 6819  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-mhm 13547  df-grp 13591  df-minusg 13592  df-ghm 13833  df-cmn 13878  df-abl 13879  df-mgp 13940  df-ur 13979  df-srg 13983  df-ring 14017  df-oppr 14087  df-dvdsr 14108  df-unit 14109  df-rhm 14172
This theorem is referenced by:  rhmunitinv  14198
  Copyright terms: Public domain W3C validator