rngciso - Metamath Proof Explorer

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

Theorem rngciso 20920

Description: An isomorphism in the category of non-unital rings is a bijection. (Contributed by AV, 28-Feb-2020.)

**Hypotheses**
Ref	Expression
rngcsect.c	⊢ 𝐶 = (RngCat‘𝑈)
rngcsect.b	⊢ 𝐵 = (Base‘𝐶)
rngcsect.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
rngcsect.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
rngcsect.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
rngciso.n	⊢ 𝐼 = (Iso‘𝐶)

**Assertion**
Ref	Expression
rngciso	⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹 ∈ (𝑋 RngIso 𝑌)))

**Proof of Theorem rngciso**
Step	Hyp	Ref	Expression
1		rngcsect.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
2		eqid 2763	. . . 4 ⊢ (Inv‘𝐶) = (Inv‘𝐶)
3		rngcsect.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
4		rngcsect.c	. . . . . 6 ⊢ 𝐶 = (RngCat‘𝑈)
5	4	rngccat 20916	. . . . 5 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
6	3, 5	syl 18	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
7		rngcsect.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
8		rngcsect.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
9		rngciso.n	. . . 4 ⊢ 𝐼 = (Iso‘𝐶)
10	1, 2, 6, 7, 8, 9	isoval 17969	. . 3 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋(Inv‘𝐶)𝑌))
11	10	eleq2d 2850	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
12	1, 2, 6, 7, 8	invfun 17968	. . . . 5 ⊢ (𝜑 → Fun (𝑋(Inv‘𝐶)𝑌))
13		funfvbrb 7073	. . . . 5 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
14	12, 13	syl 18	. . . 4 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
15	4, 1, 3, 7, 8, 2	rngcinv 20919	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) ↔ (𝐹 ∈ (𝑋 RngIso 𝑌) ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ^◡𝐹)))
16		simpl 488	. . . . 5 ⊢ ((𝐹 ∈ (𝑋 RngIso 𝑌) ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ^◡𝐹) → 𝐹 ∈ (𝑋 RngIso 𝑌))
17	15, 16	biimtrdi 256	. . . 4 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) → 𝐹 ∈ (𝑋 RngIso 𝑌)))
18	14, 17	sylbid 243	. . 3 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) → 𝐹 ∈ (𝑋 RngIso 𝑌)))
19		eqid 2763	. . . 4 ⊢ ^◡𝐹 = ^◡𝐹
20	4, 1, 3, 7, 8, 2	rngcinv 20919	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 ↔ (𝐹 ∈ (𝑋 RngIso 𝑌) ∧ ^◡𝐹 = ^◡𝐹)))
21		funrel 6576	. . . . . . 7 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → Rel (𝑋(Inv‘𝐶)𝑌))
22	12, 21	syl 18	. . . . . 6 ⊢ (𝜑 → Rel (𝑋(Inv‘𝐶)𝑌))
23		releldm 5933	. . . . . . 7 ⊢ ((Rel (𝑋(Inv‘𝐶)𝑌) ∧ 𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))
24	23	ex 418	. . . . . 6 ⊢ (Rel (𝑋(Inv‘𝐶)𝑌) → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
25	22, 24	syl 18	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
26	20, 25	sylbird 263	. . . 4 ⊢ (𝜑 → ((𝐹 ∈ (𝑋 RngIso 𝑌) ∧ ^◡𝐹 = ^◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
27	19, 26	mpan2i 710	. . 3 ⊢ (𝜑 → (𝐹 ∈ (𝑋 RngIso 𝑌) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
28	18, 27	impbid 215	. 2 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹 ∈ (𝑋 RngIso 𝑌)))
29	11, 28	bitrd 282	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹 ∈ (𝑋 RngIso 𝑌)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 ^◡ccnv 5654 dom cdm 5655 Rel wrel 5660 Fun wfun 6552 ‘cfv 6558 (class class class)co 7443 Basecbs 17416 Catccat 17867 Invcinv 17949 Isociso 17950 RngIso crngim 20695 RngCatcrngc 20898

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-er 8745 df-map 8877 df-pm 8878 df-ixp 8954 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-4 12434 df-5 12435 df-6 12436 df-7 12437 df-8 12438 df-9 12439 df-n0 12634 df-z 12721 df-dec 12842 df-uz 12993 df-fz 13667 df-struct 17354 df-sets 17371 df-slot 17389 df-ndx 17401 df-base 17417 df-ress 17438 df-plusg 17470 df-hom 17481 df-cco 17482 df-0g 17641 df-cat 17871 df-cid 17872 df-homf 17873 df-sect 17951 df-inv 17952 df-iso 17953 df-ssc 18014 df-resc 18015 df-subc 18016 df-estrc 18326 df-mgm 18845 df-mgmhm 18910 df-sgrp 18937 df-mnd 18953 df-mhm 19007 df-grp 19176 df-ghm 19457 df-abl 20027 df-mgp 20391 df-rng 20405 df-rnghm 20696 df-rngim 20697 df-rngc 20899

This theorem is used by: (None)

W3C validator