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

Theorem rngimcnv 20601
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 20591 . 2 (𝐹 ∈ (𝑆 RngIso 𝑇) → (𝑆 ∈ V ∧ 𝑇 ∈ V))
2 isrngim 20590 . . 3 ((𝑆 ∈ V ∧ 𝑇 ∈ V) → (𝐹 ∈ (𝑆 RngIso 𝑇) ↔ (𝐹 ∈ (𝑆 RngHom 𝑇) ∧ 𝐹 ∈ (𝑇 RngHom 𝑆))))
3 eqid 2762 . . . . . . . 8 (Base‘𝑆) = (Base‘𝑆)
4 eqid 2762 . . . . . . . 8 (Base‘𝑇) = (Base‘𝑇)
53, 4rnghmf 20593 . . . . . . 7 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
6 frel 6712 . . . . . . . 8 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → Rel 𝐹)
7 dfrel2 6186 . . . . . . . 8 (Rel 𝐹𝐹 = 𝐹)
86, 7sylib 221 . . . . . . 7 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → 𝐹 = 𝐹)
95, 8syl 18 . . . . . 6 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹 = 𝐹)
10 id 23 . . . . . 6 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹 ∈ (𝑆 RngHom 𝑇))
119, 10eqeltrd 2862 . . . . 5 (𝐹 ∈ (𝑆 RngHom 𝑇) → 𝐹 ∈ (𝑆 RngHom 𝑇))
1211anim1ci 628 . . . 4 ((𝐹 ∈ (𝑆 RngHom 𝑇) ∧ 𝐹 ∈ (𝑇 RngHom 𝑆)) → (𝐹 ∈ (𝑇 RngHom 𝑆) ∧ 𝐹 ∈ (𝑆 RngHom 𝑇)))
13 isrngim 20590 . . . . 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 2145  Vcvv 3453  ccnv 5658  Rel wrel 5664  wf 6533  cfv 6537  (class class class)co 7416  Basecbs 17305   RngHom crnghm 20579   RngIso crngim 20580
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831  df-ghm 19345  df-abl 19914  df-rng 20292  df-rnghm 20581  df-rngim 20582
This theorem is used by:  rngisom1  20611  rngringbdlem2  21514  rngqiprngu  21525
  Copyright terms: Public domain W3C validator