MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rngisom1 Structured version   Visualization version   GIF version

Theorem rngisom1 20440
Description: If there is a non-unital ring isomorphism between a unital ring and a non-unital ring, then the function value of the ring unity of the unital ring is a ring unity of the non-unital ring. (Contributed by AV, 27-Feb-2025.)
Hypotheses
Ref Expression
rngisom1.1 1 = (1r𝑅)
rngisom1.b 𝐵 = (Base‘𝑆)
rngisom1.t · = (.r𝑆)
Assertion
Ref Expression
rngisom1 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → ∀𝑥𝐵 (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
Distinct variable groups:   𝑥,𝐹   𝑥,𝑅   𝑥,𝑆
Allowed substitution hints:   𝐵(𝑥)   · (𝑥)   1 (𝑥)

Proof of Theorem rngisom1
StepHypRef Expression
1 rngimcnv 20430 . . . . . . . . 9 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹 ∈ (𝑆 RngIso 𝑅))
2 rngisom1.b . . . . . . . . . 10 𝐵 = (Base‘𝑆)
3 eqid 2737 . . . . . . . . . 10 (Base‘𝑅) = (Base‘𝑅)
42, 3rngimrnghm 20429 . . . . . . . . 9 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹 ∈ (𝑆 RngHom 𝑅))
51, 4syl 17 . . . . . . . 8 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹 ∈ (𝑆 RngHom 𝑅))
653ad2ant3 1136 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngHom 𝑅))
76adantr 480 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝐹 ∈ (𝑆 RngHom 𝑅))
8 rngisom1.1 . . . . . . . . 9 1 = (1r𝑅)
98, 2rngisomfv1 20439 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹1 ) ∈ 𝐵)
1093adant2 1132 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹1 ) ∈ 𝐵)
1110adantr 480 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹1 ) ∈ 𝐵)
12 simpr 484 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑥𝐵)
13 rngisom1.t . . . . . . 7 · = (.r𝑆)
14 eqid 2737 . . . . . . 7 (.r𝑅) = (.r𝑅)
152, 13, 14rnghmmul 20423 . . . . . 6 ((𝐹 ∈ (𝑆 RngHom 𝑅) ∧ (𝐹1 ) ∈ 𝐵𝑥𝐵) → (𝐹‘((𝐹1 ) · 𝑥)) = ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)))
167, 11, 12, 15syl3anc 1374 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹1 ) · 𝑥)) = ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)))
1716fveq2d 6839 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))))
183, 2rngimf1o 20428 . . . . . 6 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹:(Base‘𝑅)–1-1-onto𝐵)
19183ad2ant3 1136 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹:(Base‘𝑅)–1-1-onto𝐵)
20 simpl2 1194 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑆 ∈ Rng)
212, 13rngcl 20139 . . . . . 6 ((𝑆 ∈ Rng ∧ (𝐹1 ) ∈ 𝐵𝑥𝐵) → ((𝐹1 ) · 𝑥) ∈ 𝐵)
2220, 11, 12, 21syl3anc 1374 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹1 ) · 𝑥) ∈ 𝐵)
23 f1ocnvfv2 7226 . . . . 5 ((𝐹:(Base‘𝑅)–1-1-onto𝐵 ∧ ((𝐹1 ) · 𝑥) ∈ 𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = ((𝐹1 ) · 𝑥))
2419, 22, 23syl2an2r 686 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = ((𝐹1 ) · 𝑥))
253, 8ringidcl 20240 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 1 ∈ (Base‘𝑅))
26253ad2ant1 1134 . . . . . . . . . . 11 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 1 ∈ (Base‘𝑅))
2719, 26jca 511 . . . . . . . . . 10 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)))
2827adantr 480 . . . . . . . . 9 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)))
29 f1ocnvfv1 7225 . . . . . . . . 9 ((𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)) → (𝐹‘(𝐹1 )) = 1 )
3028, 29syl 17 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹1 )) = 1 )
3130oveq1d 7376 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)) = ( 1 (.r𝑅)(𝐹𝑥)))
32 simpl1 1193 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑅 ∈ Ring)
332, 3rngimf1o 20428 . . . . . . . . . . . 12 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹:𝐵1-1-onto→(Base‘𝑅))
34 f1of 6775 . . . . . . . . . . . 12 (𝐹:𝐵1-1-onto→(Base‘𝑅) → 𝐹:𝐵⟶(Base‘𝑅))
3533, 34syl 17 . . . . . . . . . . 11 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹:𝐵⟶(Base‘𝑅))
361, 35syl 17 . . . . . . . . . 10 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹:𝐵⟶(Base‘𝑅))
37363ad2ant3 1136 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹:𝐵⟶(Base‘𝑅))
3837ffvelcdmda 7031 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹𝑥) ∈ (Base‘𝑅))
393, 14, 8, 32, 38ringlidmd 20247 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ( 1 (.r𝑅)(𝐹𝑥)) = (𝐹𝑥))
4031, 39eqtrd 2772 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)) = (𝐹𝑥))
4140fveq2d 6839 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))) = (𝐹‘(𝐹𝑥)))
42 f1ocnvfv2 7226 . . . . . 6 ((𝐹:(Base‘𝑅)–1-1-onto𝐵𝑥𝐵) → (𝐹‘(𝐹𝑥)) = 𝑥)
4319, 42sylan 581 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹𝑥)) = 𝑥)
4441, 43eqtrd 2772 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))) = 𝑥)
4517, 24, 443eqtr3d 2780 . . 3 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹1 ) · 𝑥) = 𝑥)
4613ad2ant3 1136 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngIso 𝑅))
4746, 4syl 17 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngHom 𝑅))
4847adantr 480 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝐹 ∈ (𝑆 RngHom 𝑅))
492, 13, 14rnghmmul 20423 . . . . . . 7 ((𝐹 ∈ (𝑆 RngHom 𝑅) ∧ 𝑥𝐵 ∧ (𝐹1 ) ∈ 𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))))
5048, 12, 11, 49syl3anc 1374 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))))
5130oveq2d 7377 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))) = ((𝐹𝑥)(.r𝑅) 1 ))
523, 14, 8, 32, 38ringridmd 20248 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹𝑥)(.r𝑅) 1 ) = (𝐹𝑥))
5350, 51, 523eqtrd 2776 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = (𝐹𝑥))
5453fveq2d 6839 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝐹‘(𝐹𝑥)))
552, 13rngcl 20139 . . . . . 6 ((𝑆 ∈ Rng ∧ 𝑥𝐵 ∧ (𝐹1 ) ∈ 𝐵) → (𝑥 · (𝐹1 )) ∈ 𝐵)
5620, 12, 11, 55syl3anc 1374 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝑥 · (𝐹1 )) ∈ 𝐵)
57 f1ocnvfv2 7226 . . . . 5 ((𝐹:(Base‘𝑅)–1-1-onto𝐵 ∧ (𝑥 · (𝐹1 )) ∈ 𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝑥 · (𝐹1 )))
5819, 56, 57syl2an2r 686 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝑥 · (𝐹1 )))
5954, 58, 433eqtr3d 2780 . . 3 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝑥 · (𝐹1 )) = 𝑥)
6045, 59jca 511 . 2 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
6160ralrimiva 3130 1 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → ∀𝑥𝐵 (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  ccnv 5624  wf 6489  1-1-ontowf1o 6492  cfv 6493  (class class class)co 7361  Basecbs 17173  .rcmulr 17215  Rngcrng 20127  1rcur 20156  Ringcrg 20208   RngHom crnghm 20408   RngIso crngim 20409
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-cnex 11088  ax-resscn 11089  ax-1cn 11090  ax-icn 11091  ax-addcl 11092  ax-addrcl 11093  ax-mulcl 11094  ax-mulrcl 11095  ax-mulcom 11096  ax-addass 11097  ax-mulass 11098  ax-distr 11099  ax-i2m1 11100  ax-1ne0 11101  ax-1rid 11102  ax-rnegex 11103  ax-rrecex 11104  ax-cnre 11105  ax-pre-lttri 11106  ax-pre-lttrn 11107  ax-pre-ltadd 11108  ax-pre-mulgt0 11109
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7318  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-1st 7936  df-2nd 7937  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-pnf 11175  df-mnf 11176  df-xr 11177  df-ltxr 11178  df-le 11179  df-sub 11373  df-neg 11374  df-nn 12169  df-2 12238  df-sets 17128  df-slot 17146  df-ndx 17158  df-base 17174  df-plusg 17227  df-0g 17398  df-mgm 18602  df-mgmhm 18654  df-sgrp 18681  df-mnd 18697  df-grp 18906  df-ghm 19182  df-abl 19752  df-mgp 20116  df-rng 20128  df-ur 20157  df-ring 20210  df-rnghm 20410  df-rngim 20411
This theorem is referenced by:  rngisomring  20441  rngisomring1  20442
  Copyright terms: Public domain W3C validator