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

Theorem rngisom1 20351
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 20341 . . . . . . . . 9 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹 ∈ (𝑆 RngIso 𝑅))
2 rngisom1.b . . . . . . . . . 10 𝐵 = (Base‘𝑆)
3 eqid 2729 . . . . . . . . . 10 (Base‘𝑅) = (Base‘𝑅)
42, 3rngimrnghm 20340 . . . . . . . . 9 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹 ∈ (𝑆 RngHom 𝑅))
51, 4syl 17 . . . . . . . 8 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹 ∈ (𝑆 RngHom 𝑅))
653ad2ant3 1135 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngHom 𝑅))
76adantr 480 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝐹 ∈ (𝑆 RngHom 𝑅))
8 rngisom1.1 . . . . . . . . 9 1 = (1r𝑅)
98, 2rngisomfv1 20350 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹1 ) ∈ 𝐵)
1093adant2 1131 . . . . . . 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 2729 . . . . . . 7 (.r𝑅) = (.r𝑅)
152, 13, 14rnghmmul 20334 . . . . . 6 ((𝐹 ∈ (𝑆 RngHom 𝑅) ∧ (𝐹1 ) ∈ 𝐵𝑥𝐵) → (𝐹‘((𝐹1 ) · 𝑥)) = ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)))
167, 11, 12, 15syl3anc 1373 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹1 ) · 𝑥)) = ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)))
1716fveq2d 6844 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))))
183, 2rngimf1o 20339 . . . . . 6 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹:(Base‘𝑅)–1-1-onto𝐵)
19183ad2ant3 1135 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹:(Base‘𝑅)–1-1-onto𝐵)
20 simpl2 1193 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑆 ∈ Rng)
212, 13rngcl 20049 . . . . . 6 ((𝑆 ∈ Rng ∧ (𝐹1 ) ∈ 𝐵𝑥𝐵) → ((𝐹1 ) · 𝑥) ∈ 𝐵)
2220, 11, 12, 21syl3anc 1373 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹1 ) · 𝑥) ∈ 𝐵)
23 f1ocnvfv2 7234 . . . . 5 ((𝐹:(Base‘𝑅)–1-1-onto𝐵 ∧ ((𝐹1 ) · 𝑥) ∈ 𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = ((𝐹1 ) · 𝑥))
2419, 22, 23syl2an2r 685 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = ((𝐹1 ) · 𝑥))
253, 8ringidcl 20150 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 1 ∈ (Base‘𝑅))
26253ad2ant1 1133 . . . . . . . . . . 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 7233 . . . . . . . . 9 ((𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)) → (𝐹‘(𝐹1 )) = 1 )
3028, 29syl 17 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹1 )) = 1 )
3130oveq1d 7384 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)) = ( 1 (.r𝑅)(𝐹𝑥)))
32 simpl1 1192 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑅 ∈ Ring)
332, 3rngimf1o 20339 . . . . . . . . . . . 12 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹:𝐵1-1-onto→(Base‘𝑅))
34 f1of 6782 . . . . . . . . . . . 12 (𝐹:𝐵1-1-onto→(Base‘𝑅) → 𝐹:𝐵⟶(Base‘𝑅))
3533, 34syl 17 . . . . . . . . . . 11 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹:𝐵⟶(Base‘𝑅))
361, 35syl 17 . . . . . . . . . 10 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹:𝐵⟶(Base‘𝑅))
37363ad2ant3 1135 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹:𝐵⟶(Base‘𝑅))
3837ffvelcdmda 7038 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹𝑥) ∈ (Base‘𝑅))
393, 14, 8, 32, 38ringlidmd 20157 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ( 1 (.r𝑅)(𝐹𝑥)) = (𝐹𝑥))
4031, 39eqtrd 2764 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)) = (𝐹𝑥))
4140fveq2d 6844 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))) = (𝐹‘(𝐹𝑥)))
42 f1ocnvfv2 7234 . . . . . 6 ((𝐹:(Base‘𝑅)–1-1-onto𝐵𝑥𝐵) → (𝐹‘(𝐹𝑥)) = 𝑥)
4319, 42sylan 580 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹𝑥)) = 𝑥)
4441, 43eqtrd 2764 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))) = 𝑥)
4517, 24, 443eqtr3d 2772 . . 3 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹1 ) · 𝑥) = 𝑥)
4613ad2ant3 1135 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngIso 𝑅))
4746, 4syl 17 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngHom 𝑅))
4847adantr 480 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝐹 ∈ (𝑆 RngHom 𝑅))
492, 13, 14rnghmmul 20334 . . . . . . 7 ((𝐹 ∈ (𝑆 RngHom 𝑅) ∧ 𝑥𝐵 ∧ (𝐹1 ) ∈ 𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))))
5048, 12, 11, 49syl3anc 1373 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))))
5130oveq2d 7385 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))) = ((𝐹𝑥)(.r𝑅) 1 ))
523, 14, 8, 32, 38ringridmd 20158 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹𝑥)(.r𝑅) 1 ) = (𝐹𝑥))
5350, 51, 523eqtrd 2768 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = (𝐹𝑥))
5453fveq2d 6844 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝐹‘(𝐹𝑥)))
552, 13rngcl 20049 . . . . . 6 ((𝑆 ∈ Rng ∧ 𝑥𝐵 ∧ (𝐹1 ) ∈ 𝐵) → (𝑥 · (𝐹1 )) ∈ 𝐵)
5620, 12, 11, 55syl3anc 1373 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝑥 · (𝐹1 )) ∈ 𝐵)
57 f1ocnvfv2 7234 . . . . 5 ((𝐹:(Base‘𝑅)–1-1-onto𝐵 ∧ (𝑥 · (𝐹1 )) ∈ 𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝑥 · (𝐹1 )))
5819, 56, 57syl2an2r 685 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝑥 · (𝐹1 )))
5954, 58, 433eqtr3d 2772 . . 3 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝑥 · (𝐹1 )) = 𝑥)
6045, 59jca 511 . 2 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
6160ralrimiva 3125 1 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → ∀𝑥𝐵 (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3044  ccnv 5630  wf 6495  1-1-ontowf1o 6498  cfv 6499  (class class class)co 7369  Basecbs 17155  .rcmulr 17197  Rngcrng 20037  1rcur 20066  Ringcrg 20118   RngHom crnghm 20319   RngIso crngim 20320
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-map 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-nn 12163  df-2 12225  df-sets 17110  df-slot 17128  df-ndx 17140  df-base 17156  df-plusg 17209  df-0g 17380  df-mgm 18543  df-mgmhm 18595  df-sgrp 18622  df-mnd 18638  df-grp 18844  df-ghm 19121  df-abl 19689  df-mgp 20026  df-rng 20038  df-ur 20067  df-ring 20120  df-rnghm 20321  df-rngim 20322
This theorem is referenced by:  rngisomring  20352  rngisomring1  20353
  Copyright terms: Public domain W3C validator