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 2737 | . . 3 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
2 | eqid 2737 | . . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
3 | eqid 2737 | . . 3 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
4 | eqid 2737 | . . 3 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
5 | setcsect.n | . . 3 ⊢ 𝑆 = (Sect‘𝐶) | |
6 | setcmon.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
7 | setcmon.c | . . . . 5 ⊢ 𝐶 = (SetCat‘𝑈) | |
8 | 7 | setccat 17591 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat) |
9 | 6, 8 | syl 17 | . . 3 ⊢ (𝜑 → 𝐶 ∈ Cat) |
10 | setcmon.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑈) | |
11 | 7, 6 | setcbas 17584 | . . . 4 ⊢ (𝜑 → 𝑈 = (Base‘𝐶)) |
12 | 10, 11 | eleqtrd 2840 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
13 | setcmon.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
14 | 13, 11 | eleqtrd 2840 | . . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
15 | 1, 2, 3, 4, 5, 9, 12, 14 | issect 17258 | . 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))) |
16 | 7, 6, 2, 10, 13 | elsetchom 17587 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹:𝑋⟶𝑌)) |
17 | 7, 6, 2, 13, 10 | elsetchom 17587 | . . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ↔ 𝐺:𝑌⟶𝑋)) |
18 | 16, 17 | anbi12d 634 | . . . . 5 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋))) |
19 | 18 | anbi1d 633 | . . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))) |
20 | 6 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑈 ∈ 𝑉) |
21 | 10 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑋 ∈ 𝑈) |
22 | 13 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑌 ∈ 𝑈) |
23 | simprl 771 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝐹:𝑋⟶𝑌) | |
24 | simprr 773 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝐺:𝑌⟶𝑋) | |
25 | 7, 20, 3, 21, 22, 21, 23, 24 | setcco 17589 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = (𝐺 ∘ 𝐹)) |
26 | 7, 4, 6, 10 | setcid 17592 | . . . . . . 7 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝑋)) |
27 | 26 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝑋)) |
28 | 25, 27 | eqeq12d 2753 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → ((𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ↔ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋))) |
29 | 28 | pm5.32da 582 | . . . 4 ⊢ (𝜑 → (((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
30 | 19, 29 | bitrd 282 | . . 3 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
31 | df-3an 1091 | . . 3 ⊢ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))) | |
32 | df-3an 1091 | . . 3 ⊢ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋))) | |
33 | 30, 31, 32 | 3bitr4g 317 | . 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
34 | 15, 33 | bitrd 282 | 1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 〈cop 4547 class class class wbr 5053 I cid 5454 ↾ cres 5553 ∘ ccom 5555 ⟶wf 6376 ‘cfv 6380 (class class class)co 7213 Basecbs 16760 Hom chom 16813 compcco 16814 Catccat 17167 Idccid 17168 Sectcsect 17249 SetCatcsetc 17581 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5179 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-1st 7761 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-1o 8202 df-er 8391 df-map 8510 df-en 8627 df-dom 8628 df-sdom 8629 df-fin 8630 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-2 11893 df-3 11894 df-4 11895 df-5 11896 df-6 11897 df-7 11898 df-8 11899 df-9 11900 df-n0 12091 df-z 12177 df-dec 12294 df-uz 12439 df-fz 13096 df-struct 16700 df-slot 16735 df-ndx 16745 df-base 16761 df-hom 16826 df-cco 16827 df-cat 17171 df-cid 17172 df-sect 17252 df-setc 17582 |
This theorem is referenced by: setcinv 17596 |
Copyright terms: Public domain | W3C validator |