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 18041

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 2733	. . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2733	. . . 4 ⊢ (Inv‘𝐶) = (Inv‘𝐶)
3		setcmon.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
4		setcmon.c	. . . . . 6 ⊢ 𝐶 = (SetCat‘𝑈)
5	4	setccat 18035	. . . . 5 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
6	3, 5	syl 17	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
7		setcmon.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑈)
8	4, 3	setcbas 18028	. . . . 5 ⊢ (𝜑 → 𝑈 = (Base‘𝐶))
9	7, 8	eleqtrd 2836	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
10		setcmon.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑈)
11	10, 8	eleqtrd 2836	. . . 4 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
12		setciso.n	. . . 4 ⊢ 𝐼 = (Iso‘𝐶)
13	1, 2, 6, 9, 11, 12	isoval 17712	. . 3 ⊢ (𝜑 → (𝑋𝐼𝑌) = dom (𝑋(Inv‘𝐶)𝑌))
14	13	eleq2d 2820	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
15	1, 2, 6, 9, 11	invfun 17711	. . . . 5 ⊢ (𝜑 → Fun (𝑋(Inv‘𝐶)𝑌))
16		funfvbrb 7053	. . . . 5 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
17	15, 16	syl 17	. . . 4 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹)))
18	4, 3, 7, 10, 2	setcinv 18040	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ^◡𝐹)))
19		simpl 484	. . . . 5 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ((𝑋(Inv‘𝐶)𝑌)‘𝐹) = ^◡𝐹) → 𝐹:𝑋–1-1-onto→𝑌)
20	18, 19	syl6bi 253	. . . 4 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)((𝑋(Inv‘𝐶)𝑌)‘𝐹) → 𝐹:𝑋–1-1-onto→𝑌))
21	17, 20	sylbid 239	. . 3 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) → 𝐹:𝑋–1-1-onto→𝑌))
22		eqid 2733	. . . 4 ⊢ ^◡𝐹 = ^◡𝐹
23	4, 3, 7, 10, 2	setcinv 18040	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 ↔ (𝐹:𝑋–1-1-onto→𝑌 ∧ ^◡𝐹 = ^◡𝐹)))
24		funrel 6566	. . . . . . 7 ⊢ (Fun (𝑋(Inv‘𝐶)𝑌) → Rel (𝑋(Inv‘𝐶)𝑌))
25	15, 24	syl 17	. . . . . 6 ⊢ (𝜑 → Rel (𝑋(Inv‘𝐶)𝑌))
26		releldm 5944	. . . . . . 7 ⊢ ((Rel (𝑋(Inv‘𝐶)𝑌) ∧ 𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌))
27	26	ex 414	. . . . . 6 ⊢ (Rel (𝑋(Inv‘𝐶)𝑌) → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
28	25, 27	syl 17	. . . . 5 ⊢ (𝜑 → (𝐹(𝑋(Inv‘𝐶)𝑌)^◡𝐹 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
29	23, 28	sylbird 260	. . . 4 ⊢ (𝜑 → ((𝐹:𝑋–1-1-onto→𝑌 ∧ ^◡𝐹 = ^◡𝐹) → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
30	22, 29	mpan2i 696	. . 3 ⊢ (𝜑 → (𝐹:𝑋–1-1-onto→𝑌 → 𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌)))
31	21, 30	impbid 211	. 2 ⊢ (𝜑 → (𝐹 ∈ dom (𝑋(Inv‘𝐶)𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌))
32	14, 31	bitrd 279	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ 𝐹:𝑋–1-1-onto→𝑌))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 class class class wbr 5149 ^◡ccnv 5676 dom cdm 5677 Rel wrel 5682 Fun wfun 6538 –1-1-onto→wf1o 6543 ‘cfv 6544 (class class class)co 7409 Basecbs 17144 Catccat 17608 Invcinv 17692 Isociso 17693 SetCatcsetc 18025

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-fz 13485 df-struct 17080 df-slot 17115 df-ndx 17127 df-base 17145 df-hom 17221 df-cco 17222 df-cat 17612 df-cid 17613 df-sect 17694 df-inv 17695 df-iso 17696 df-setc 18026

This theorem is referenced by: yonffthlem 18235

W3C validator