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 2821 | . . 3 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
2 | eqid 2821 | . . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
3 | eqid 2821 | . . 3 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
4 | eqid 2821 | . . 3 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
5 | setcsect.n | . . 3 ⊢ 𝑆 = (Sect‘𝐶) | |
6 | setcmon.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
7 | setcmon.c | . . . . 5 ⊢ 𝐶 = (SetCat‘𝑈) | |
8 | 7 | setccat 17345 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat) |
9 | 6, 8 | syl 17 | . . 3 ⊢ (𝜑 → 𝐶 ∈ Cat) |
10 | setcmon.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑈) | |
11 | 7, 6 | setcbas 17338 | . . . 4 ⊢ (𝜑 → 𝑈 = (Base‘𝐶)) |
12 | 10, 11 | eleqtrd 2915 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶)) |
13 | setcmon.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
14 | 13, 11 | eleqtrd 2915 | . . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶)) |
15 | 1, 2, 3, 4, 5, 9, 12, 14 | issect 17023 | . 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))) |
16 | 7, 6, 2, 10, 13 | elsetchom 17341 | . . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹:𝑋⟶𝑌)) |
17 | 7, 6, 2, 13, 10 | elsetchom 17341 | . . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ↔ 𝐺:𝑌⟶𝑋)) |
18 | 16, 17 | anbi12d 632 | . . . . 5 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋))) |
19 | 18 | anbi1d 631 | . . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))) |
20 | 6 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑈 ∈ 𝑉) |
21 | 10 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑋 ∈ 𝑈) |
22 | 13 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝑌 ∈ 𝑈) |
23 | simprl 769 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝐹:𝑋⟶𝑌) | |
24 | simprr 771 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → 𝐺:𝑌⟶𝑋) | |
25 | 7, 20, 3, 21, 22, 21, 23, 24 | setcco 17343 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = (𝐺 ∘ 𝐹)) |
26 | 7, 4, 6, 10 | setcid 17346 | . . . . . . 7 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝑋)) |
27 | 26 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝑋)) |
28 | 25, 27 | eqeq12d 2837 | . . . . 5 ⊢ ((𝜑 ∧ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋)) → ((𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ↔ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋))) |
29 | 28 | pm5.32da 581 | . . . 4 ⊢ (𝜑 → (((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
30 | 19, 29 | bitrd 281 | . . 3 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
31 | df-3an 1085 | . . 3 ⊢ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))) | |
32 | df-3an 1085 | . . 3 ⊢ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)) ↔ ((𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋))) | |
33 | 30, 31, 32 | 3bitr4g 316 | . 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(〈𝑋, 𝑌〉(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
34 | 15, 33 | bitrd 281 | 1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹:𝑋⟶𝑌 ∧ 𝐺:𝑌⟶𝑋 ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝑋)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 〈cop 4573 class class class wbr 5066 I cid 5459 ↾ cres 5557 ∘ ccom 5559 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 Hom chom 16576 compcco 16577 Catccat 16935 Idccid 16936 Sectcsect 17014 SetCatcsetc 17335 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-z 11983 df-dec 12100 df-uz 12245 df-fz 12894 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-hom 16589 df-cco 16590 df-cat 16939 df-cid 16940 df-sect 17017 df-setc 17336 |
This theorem is referenced by: setcinv 17350 |
Copyright terms: Public domain | W3C validator |