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

Theorem rngisom1 20598
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 20588 . . . . . . . . 9 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹 ∈ (𝑆 RngIso 𝑅))
2 rngisom1.b . . . . . . . . . 10 𝐵 = (Base‘𝑆)
3 eqid 2765 . . . . . . . . . 10 (Base‘𝑅) = (Base‘𝑅)
42, 3rngimrnghm 20587 . . . . . . . . 9 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹 ∈ (𝑆 RngHom 𝑅))
51, 4syl 18 . . . . . . . 8 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹 ∈ (𝑆 RngHom 𝑅))
653ad2ant3 1153 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngHom 𝑅))
76adantr 486 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝐹 ∈ (𝑆 RngHom 𝑅))
8 rngisom1.1 . . . . . . . . 9 1 = (1r𝑅)
98, 2rngisomfv1 20597 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹1 ) ∈ 𝐵)
1093adant2 1149 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹1 ) ∈ 𝐵)
1110adantr 486 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹1 ) ∈ 𝐵)
12 simpr 490 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑥𝐵)
13 rngisom1.t . . . . . . 7 · = (.r𝑆)
14 eqid 2765 . . . . . . 7 (.r𝑅) = (.r𝑅)
152, 13, 14rnghmmul 20581 . . . . . 6 ((𝐹 ∈ (𝑆 RngHom 𝑅) ∧ (𝐹1 ) ∈ 𝐵𝑥𝐵) → (𝐹‘((𝐹1 ) · 𝑥)) = ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)))
167, 11, 12, 15syl3anc 1398 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹1 ) · 𝑥)) = ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)))
1716fveq2d 6889 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))))
183, 2rngimf1o 20586 . . . . . 6 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹:(Base‘𝑅)–1-1-onto𝐵)
19183ad2ant3 1153 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹:(Base‘𝑅)–1-1-onto𝐵)
20 simpl2 1211 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑆 ∈ Rng)
212, 13rngcl 20290 . . . . . 6 ((𝑆 ∈ Rng ∧ (𝐹1 ) ∈ 𝐵𝑥𝐵) → ((𝐹1 ) · 𝑥) ∈ 𝐵)
2220, 11, 12, 21syl3anc 1398 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹1 ) · 𝑥) ∈ 𝐵)
23 f1ocnvfv2 7284 . . . . 5 ((𝐹:(Base‘𝑅)–1-1-onto𝐵 ∧ ((𝐹1 ) · 𝑥) ∈ 𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = ((𝐹1 ) · 𝑥))
2419, 22, 23syl2an2r 698 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘((𝐹1 ) · 𝑥))) = ((𝐹1 ) · 𝑥))
253, 8ringidcl 20397 . . . . . . . . . . . 12 (𝑅 ∈ Ring → 1 ∈ (Base‘𝑅))
26253ad2ant1 1151 . . . . . . . . . . 11 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 1 ∈ (Base‘𝑅))
2719, 26jca 521 . . . . . . . . . 10 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → (𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)))
2827adantr 486 . . . . . . . . 9 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)))
29 f1ocnvfv1 7283 . . . . . . . . 9 ((𝐹:(Base‘𝑅)–1-1-onto𝐵1 ∈ (Base‘𝑅)) → (𝐹‘(𝐹1 )) = 1 )
3028, 29syl 18 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹1 )) = 1 )
3130oveq1d 7434 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)) = ( 1 (.r𝑅)(𝐹𝑥)))
32 simpl1 1210 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝑅 ∈ Ring)
332, 3rngimf1o 20586 . . . . . . . . . . . 12 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹:𝐵1-1-onto→(Base‘𝑅))
34 f1of 6824 . . . . . . . . . . . 12 (𝐹:𝐵1-1-onto→(Base‘𝑅) → 𝐹:𝐵⟶(Base‘𝑅))
3533, 34syl 18 . . . . . . . . . . 11 (𝐹 ∈ (𝑆 RngIso 𝑅) → 𝐹:𝐵⟶(Base‘𝑅))
361, 35syl 18 . . . . . . . . . 10 (𝐹 ∈ (𝑅 RngIso 𝑆) → 𝐹:𝐵⟶(Base‘𝑅))
37363ad2ant3 1153 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹:𝐵⟶(Base‘𝑅))
3837ffvelcdmda 7083 . . . . . . . 8 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹𝑥) ∈ (Base‘𝑅))
393, 14, 8, 32, 38ringlidmd 20404 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ( 1 (.r𝑅)(𝐹𝑥)) = (𝐹𝑥))
4031, 39eqtrd 2800 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥)) = (𝐹𝑥))
4140fveq2d 6889 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))) = (𝐹‘(𝐹𝑥)))
42 f1ocnvfv2 7284 . . . . . 6 ((𝐹:(Base‘𝑅)–1-1-onto𝐵𝑥𝐵) → (𝐹‘(𝐹𝑥)) = 𝑥)
4319, 42sylan 592 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹𝑥)) = 𝑥)
4441, 43eqtrd 2800 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘((𝐹‘(𝐹1 ))(.r𝑅)(𝐹𝑥))) = 𝑥)
4517, 24, 443eqtr3d 2808 . . 3 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹1 ) · 𝑥) = 𝑥)
4613ad2ant3 1153 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngIso 𝑅))
4746, 4syl 18 . . . . . . . 8 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → 𝐹 ∈ (𝑆 RngHom 𝑅))
4847adantr 486 . . . . . . 7 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → 𝐹 ∈ (𝑆 RngHom 𝑅))
492, 13, 14rnghmmul 20581 . . . . . . 7 ((𝐹 ∈ (𝑆 RngHom 𝑅) ∧ 𝑥𝐵 ∧ (𝐹1 ) ∈ 𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))))
5048, 12, 11, 49syl3anc 1398 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))))
5130oveq2d 7435 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹𝑥)(.r𝑅)(𝐹‘(𝐹1 ))) = ((𝐹𝑥)(.r𝑅) 1 ))
523, 14, 8, 32, 38ringridmd 20405 . . . . . 6 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → ((𝐹𝑥)(.r𝑅) 1 ) = (𝐹𝑥))
5350, 51, 523eqtrd 2804 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝑥 · (𝐹1 ))) = (𝐹𝑥))
5453fveq2d 6889 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝐹‘(𝐹𝑥)))
552, 13rngcl 20290 . . . . . 6 ((𝑆 ∈ Rng ∧ 𝑥𝐵 ∧ (𝐹1 ) ∈ 𝐵) → (𝑥 · (𝐹1 )) ∈ 𝐵)
5620, 12, 11, 55syl3anc 1398 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝑥 · (𝐹1 )) ∈ 𝐵)
57 f1ocnvfv2 7284 . . . . 5 ((𝐹:(Base‘𝑅)–1-1-onto𝐵 ∧ (𝑥 · (𝐹1 )) ∈ 𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝑥 · (𝐹1 )))
5819, 56, 57syl2an2r 698 . . . 4 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝐹‘(𝐹‘(𝑥 · (𝐹1 )))) = (𝑥 · (𝐹1 )))
5954, 58, 433eqtr3d 2808 . . 3 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (𝑥 · (𝐹1 )) = 𝑥)
6045, 59jca 521 . 2 (((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) ∧ 𝑥𝐵) → (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
6160ralrimiva 3159 1 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Rng ∧ 𝐹 ∈ (𝑅 RngIso 𝑆)) → ∀𝑥𝐵 (((𝐹1 ) · 𝑥) = 𝑥 ∧ (𝑥 · (𝐹1 )) = 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3081  ccnv 5662  wf 6536  1-1-ontowf1o 6539  cfv 6540  (class class class)co 7419  Basecbs 17295  .rcmulr 17337  Rngcrng 20278  1rcur 20311  Ringcrg 20363   RngHom crnghm 20566   RngIso crngim 20567
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11175  ax-resscn 11176  ax-1cn 11177  ax-icn 11178  ax-addcl 11179  ax-addrcl 11180  ax-mulcl 11181  ax-mulrcl 11182  ax-mulcom 11183  ax-addass 11184  ax-mulass 11185  ax-distr 11186  ax-i2m1 11187  ax-1ne0 11188  ax-1rid 11189  ax-rnegex 11190  ax-rrecex 11191  ax-cnre 11192  ax-pre-lttri 11193  ax-pre-lttrn 11194  ax-pre-ltadd 11195  ax-pre-mulgt0 11196
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-pnf 11264  df-mnf 11265  df-xr 11266  df-ltxr 11267  df-le 11268  df-sub 11462  df-neg 11463  df-nn 12253  df-2 12322  df-sets 17250  df-slot 17268  df-ndx 17280  df-base 17296  df-plusg 17349  df-0g 17520  df-mgm 18724  df-mgmhm 18786  df-sgrp 18813  df-mnd 18829  df-grp 19051  df-ghm 19332  df-abl 19901  df-mgp 20265  df-rng 20279  df-ur 20312  df-ring 20365  df-rnghm 20568  df-rngim 20569
This theorem is used by:  rngisomring  20599  rngisomring1  20600
  Copyright terms: Public domain W3C validator