setciso - Metamath Proof Explorer

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

Theorem setciso 16741

Description: An isomorphism in the category of sets is a bijection. (Contributed by Mario Carneiro, 3-Jan-2017.)

**Hypotheses**
Ref	Expression
setcmon.c	⊢ 𝐶 = (SetCat‘𝑈)
setcmon.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
setcmon.x	⊢ (𝜑 → 𝑋 ∈ 𝑈)
setcmon.y	⊢ (𝜑 → 𝑌 ∈ 𝑈)
setciso.n	⊢ 𝐼 = (Iso‘𝐶)

**Assertion**
Ref	Expression
setciso	⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌))

**Proof of Theorem setciso**
Step	Hyp	Ref	Expression
1		eqid 2622	. . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2622	. . . 4 ⊢ (Inv‘𝐶) = (Inv‘𝐶)
3		setcmon.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
4		setcmon.c	. . . . . 6 ⊢ 𝐶 = (SetCat‘𝑈)
5	4	setccat 16735	. . . . 5 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
6	3, 5	syl 17	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
7		setcmon.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑈)
8	4, 3	setcbas 16728	. . . . 5 ⊢ (𝜑 → 𝑈 = (Base‘𝐶))
9	7, 8	eleqtrd 2703	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
10		setcmon.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑈)
11	10, 8	eleqtrd 2703	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
12		setciso.n	. . . 4 ⊢ 𝐼 = (Iso‘𝐶)
13	1, 2, 6, 9, 11, 12	isoval 16425	. . 3 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋(Inv‘𝐶)𝑌))
14	13	eleq2d 2687	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
15	1, 2, 6, 9, 11	invfun 16424	. . . . 5 ⊢ (𝜑 → Fun (𝑋(Inv‘𝐶)𝑌))
16		funfvbrb 6330	. . . . 5 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
17	15, 16	syl 17	. . . 4 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
18	4, 3, 7, 10, 2	setcinv 16740	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ^◡𝐹)))
19		simpl 473	. . . . 5 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ^◡𝐹) → 𝐹:𝑋–1-1-onto→𝑌)
20	18, 19	syl6bi 243	. . . 4 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) → 𝐹:𝑋–1-1-onto→𝑌))
21	17, 20	sylbid 230	. . 3 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) → 𝐹:𝑋–1-1-onto→𝑌))
22		eqid 2622	. . . 4 ⊢ ^◡𝐹 = ^◡𝐹
23	4, 3, 7, 10, 2	setcinv 16740	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ^◡𝐹 = ^◡𝐹)))
24		funrel 5905	. . . . . . 7 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → Rel (𝑋(Inv‘𝐶)𝑌))
25	15, 24	syl 17	. . . . . 6 ⊢ (𝜑 → Rel (𝑋(Inv‘𝐶)𝑌))
26		releldm 5358	. . . . . . 7 ⊢ ((Rel (𝑋(Inv‘𝐶)𝑌) ∧ 𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))
27	26	ex 450	. . . . . 6 ⊢ (Rel (𝑋(Inv‘𝐶)𝑌) → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
28	25, 27	syl 17	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
29	23, 28	sylbird 250	. . . 4 ⊢ (𝜑 → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ^◡𝐹 = ^◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
30	22, 29	mpan2i 713	. . 3 ⊢ (𝜑 → (𝐹:𝑋–1-1-onto→𝑌 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
31	21, 30	impbid 202	. 2 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌))
32	14, 31	bitrd 268	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 class class class wbr 4653 ^◡ccnv 5113 dom cdm 5114 Rel wrel 5119 Fun wfun 5882 –1-1-onto→wf1o 5887 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 Catccat 16325 Invcinv 16405 Isociso 16406 SetCatcsetc 16725

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-fz 12327 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-hom 15966 df-cco 15967 df-cat 16329 df-cid 16330 df-sect 16407 df-inv 16408 df-iso 16409 df-setc 16726

This theorem is referenced by: yonffthlem 16922

W3C validator