![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > setcsect | Structured version Visualization version GIF version |
Description: A section in the category of sets, written out. (Contributed by Mario Carneiro, 3-Jan-2017.) |
Ref | Expression |
---|---|
setcmon.c | ⊢ 𝐶 = (SetCat‘𝑈) |
setcmon.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
setcmon.x | ⊢ (𝜑 → 𝑋 ∈ 𝑈) |
setcmon.y | ⊢ (𝜑 → 𝑌 ∈ 𝑈) |
setcsect.n | ⊢ 𝑆 = (Sect‘𝐶) |
Ref | Expression |
---|---|
setcsect | ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2794 | . . 3 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
2 | eqid 2794 | . . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
3 | eqid 2794 | . . 3 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
4 | eqid 2794 | . . 3 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
5 | setcsect.n | . . 3 ⊢ 𝑆 = (Sect‘𝐶) | |
6 | setcmon.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
7 | setcmon.c | . . . . 5 ⊢ 𝐶 = (SetCat‘𝑈) | |
8 | 7 | setccat 17174 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat) |
9 | 6, 8 | syl 17 | . . 3 ⊢ (𝜑 → 𝐶 ∈ Cat) |
10 | setcmon.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑈) | |
11 | 7, 6 | setcbas 17167 | . . . 4 ⊢ (𝜑 → 𝑈 = (Base‘𝐶)) |
12 | 10, 11 | eleqtrd 2884 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
13 | setcmon.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
14 | 13, 11 | eleqtrd 2884 | . . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
15 | 1, 2, 3, 4, 5, 9, 12, 14 | issect 16852 | . 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))) |
16 | 7, 6, 2, 10, 13 | elsetchom 17170 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹:𝑋⟶𝑌)) |
17 | 7, 6, 2, 13, 10 | elsetchom 17170 | . . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ↔ 𝐺:𝑌⟶𝑋)) |
18 | 16, 17 | anbi12d 630 | . . . . 5 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋))) |
19 | 18 | anbi1d 629 | . . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))) |
20 | 6 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑈 ∈ 𝑉) |
21 | 10 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑋 ∈ 𝑈) |
22 | 13 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑌 ∈ 𝑈) |
23 | simprl 767 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝐹:𝑋⟶𝑌) | |
24 | simprr 769 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝐺:𝑌⟶𝑋) | |
25 | 7, 20, 3, 21, 22, 21, 23, 24 | setcco 17172 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = (𝐺 ∘ 𝐹)) |
26 | 7, 4, 6, 10 | setcid 17175 | . . . . . . 7 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝑋)) |
27 | 26 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝑋)) |
28 | 25, 27 | eqeq12d 2809 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → ((𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ↔ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋))) |
29 | 28 | pm5.32da 579 | . . . 4 ⊢ (𝜑 → (((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
30 | 19, 29 | bitrd 280 | . . 3 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
31 | df-3an 1082 | . . 3 ⊢ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))) | |
32 | df-3an 1082 | . . 3 ⊢ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋))) | |
33 | 30, 31, 32 | 3bitr4g 315 | . 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
34 | 15, 33 | bitrd 280 | 1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1080 = wceq 1522 ∈ wcel 2080 〈cop 4480 class class class wbr 4964 I cid 5350 ↾ cres 5448 ∘ ccom 5450 ⟶wf 6224 ‘cfv 6228 (class class class)co 7019 Basecbs 16312 Hom chom 16405 compcco 16406 Catccat 16764 Idccid 16765 Sectcsect 16843 SetCatcsetc 17164 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1778 ax-4 1792 ax-5 1889 ax-6 1948 ax-7 1993 ax-8 2082 ax-9 2090 ax-10 2111 ax-11 2125 ax-12 2140 ax-13 2343 ax-ext 2768 ax-rep 5084 ax-sep 5097 ax-nul 5104 ax-pow 5160 ax-pr 5224 ax-un 7322 ax-cnex 10442 ax-resscn 10443 ax-1cn 10444 ax-icn 10445 ax-addcl 10446 ax-addrcl 10447 ax-mulcl 10448 ax-mulrcl 10449 ax-mulcom 10450 ax-addass 10451 ax-mulass 10452 ax-distr 10453 ax-i2m1 10454 ax-1ne0 10455 ax-1rid 10456 ax-rnegex 10457 ax-rrecex 10458 ax-cnre 10459 ax-pre-lttri 10460 ax-pre-lttrn 10461 ax-pre-ltadd 10462 ax-pre-mulgt0 10463 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1763 df-nf 1767 df-sb 2042 df-mo 2575 df-eu 2611 df-clab 2775 df-cleq 2787 df-clel 2862 df-nfc 2934 df-ne 2984 df-nel 3090 df-ral 3109 df-rex 3110 df-reu 3111 df-rmo 3112 df-rab 3113 df-v 3438 df-sbc 3708 df-csb 3814 df-dif 3864 df-un 3866 df-in 3868 df-ss 3876 df-pss 3878 df-nul 4214 df-if 4384 df-pw 4457 df-sn 4475 df-pr 4477 df-tp 4479 df-op 4481 df-uni 4748 df-int 4785 df-iun 4829 df-br 4965 df-opab 5027 df-mpt 5044 df-tr 5067 df-id 5351 df-eprel 5356 df-po 5365 df-so 5366 df-fr 5405 df-we 5407 df-xp 5452 df-rel 5453 df-cnv 5454 df-co 5455 df-dm 5456 df-rn 5457 df-res 5458 df-ima 5459 df-pred 6026 df-ord 6072 df-on 6073 df-lim 6074 df-suc 6075 df-iota 6192 df-fun 6230 df-fn 6231 df-f 6232 df-f1 6233 df-fo 6234 df-f1o 6235 df-fv 6236 df-riota 6980 df-ov 7022 df-oprab 7023 df-mpo 7024 df-om 7440 df-1st 7548 df-2nd 7549 df-wrecs 7801 df-recs 7863 df-rdg 7901 df-1o 7956 df-oadd 7960 df-er 8142 df-map 8261 df-en 8361 df-dom 8362 df-sdom 8363 df-fin 8364 df-pnf 10526 df-mnf 10527 df-xr 10528 df-ltxr 10529 df-le 10530 df-sub 10721 df-neg 10722 df-nn 11489 df-2 11550 df-3 11551 df-4 11552 df-5 11553 df-6 11554 df-7 11555 df-8 11556 df-9 11557 df-n0 11748 df-z 11832 df-dec 11949 df-uz 12094 df-fz 12743 df-struct 16314 df-ndx 16315 df-slot 16316 df-base 16318 df-hom 16418 df-cco 16419 df-cat 16768 df-cid 16769 df-sect 16846 df-setc 17165 |
This theorem is referenced by: setcinv 17179 |
Copyright terms: Public domain | W3C validator |