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

Theorem rngimcnv 20564
Description: The converse of an isomorphism of non-unital rings is an isomorphism of non-unital rings. (Contributed by AV, 27-Feb-2025.)
Assertion
Ref Expression
rngimcnv (𝐹 ∈ (𝑆 RngIso 𝑇) → 𝐹 ∈ (𝑇 RngIso 𝑆))

Proof of Theorem rngimcnv
StepHypRef Expression
1 rngimrcl 20554 . 2 (𝐹 ∈ (𝑆 RngIso 𝑇) → (𝑆 ∈ V ∧ 𝑇 ∈ V))
2 isrngim 20553 . . 3 ((𝑆 ∈ V ∧ 𝑇 ∈ V) → (𝐹 ∈ (𝑆 RngIso 𝑇) ↔ (𝐹 ∈ (𝑆 RngHom 𝑇) ∧ 𝐹 ∈ (𝑇 RngHom 𝑆))))
3 eqid 2766 . . . . . . . 8 (Base‘𝑆) = (Base‘𝑆)
4 eqid 2766 . . . . . . . 8 (Base‘𝑇) = (Base‘𝑇)
53, 4rnghmf 20556 . . . . . . 7 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
6 frel 6718 . . . . . . . 8 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → Rel 𝐹)
7 dfrel2 6192 . . . . . . . 8 (Rel 𝐹𝐹 = 𝐹)
86, 7sylib 221 . . . . . . 7 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → 𝐹 = 𝐹)
95, 8syl 18 . . . . . 6 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹 = 𝐹)
10 id 23 . . . . . 6 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹 ∈ (𝑆 RngHom 𝑇))
119, 10eqeltrd 2866 . . . . 5 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹 ∈ (𝑆 RngHom 𝑇))
1211anim1ci 628 . . . 4 ((𝐹 ∈ (𝑆 RngHom 𝑇) ∧ 𝐹 ∈ (𝑇 RngHom 𝑆)) → (𝐹 ∈ (𝑇 RngHom 𝑆) ∧ 𝐹 ∈ (𝑆 RngHom 𝑇)))
13 isrngim 20553 . . . . 5 ((𝑇 ∈ V ∧ 𝑆 ∈ V) → (𝐹 ∈ (𝑇 RngIso 𝑆) ↔ (𝐹 ∈ (𝑇 RngHom 𝑆) ∧ 𝐹 ∈ (𝑆 RngHom 𝑇))))
1413ancoms 464 . . . 4 ((𝑆 ∈ V ∧ 𝑇 ∈ V) → (𝐹 ∈ (𝑇 RngIso 𝑆) ↔ (𝐹 ∈ (𝑇 RngHom 𝑆) ∧ 𝐹 ∈ (𝑆 RngHom 𝑇))))
1512, 14imbitrrid 249 . . 3 ((𝑆 ∈ V ∧ 𝑇 ∈ V) → ((𝐹 ∈ (𝑆 RngHom 𝑇) ∧ 𝐹 ∈ (𝑇 RngHom 𝑆)) → 𝐹 ∈ (𝑇 RngIso 𝑆)))
162, 15sylbid 243 . 2 ((𝑆 ∈ V ∧ 𝑇 ∈ V) → (𝐹 ∈ (𝑆 RngIso 𝑇) → 𝐹 ∈ (𝑇 RngIso 𝑆)))
171, 16mpcom 39 1 (𝐹 ∈ (𝑆 RngIso 𝑇) → 𝐹 ∈ (𝑇 RngIso 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  Vcvv 3458  ccnv 5665  Rel wrel 5671  wf 6539  cfv 6543  (class class class)co 7423  Basecbs 17294   RngHom crnghm 20542   RngIso crngim 20543
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 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-map 8835  df-ghm 19309  df-abl 19878  df-rng 20256  df-rnghm 20544  df-rngim 20545
This theorem is used by:  rngisom1  20574  rngringbdlem2  21477  rngqiprngu  21488
  Copyright terms: Public domain W3C validator