Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fullres2c | Structured version Visualization version GIF version |
Description: Condition for a full functor to also be a full functor into the restriction. (Contributed by Mario Carneiro, 30-Jan-2017.) |
Ref | Expression |
---|---|
ffthres2c.a | ⊢ 𝐴 = (Base‘𝐶) |
ffthres2c.e | ⊢ 𝐸 = (𝐷 ↾s 𝑆) |
ffthres2c.d | ⊢ (𝜑 → 𝐷 ∈ Cat) |
ffthres2c.r | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
ffthres2c.1 | ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) |
Ref | Expression |
---|---|
fullres2c | ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ 𝐹(𝐶 Full 𝐸)𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ffthres2c.a | . . . 4 ⊢ 𝐴 = (Base‘𝐶) | |
2 | ffthres2c.e | . . . 4 ⊢ 𝐸 = (𝐷 ↾s 𝑆) | |
3 | ffthres2c.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat) | |
4 | ffthres2c.r | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
5 | ffthres2c.1 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) | |
6 | 1, 2, 3, 4, 5 | funcres2c 17171 | . . 3 ⊢ (𝜑 → (𝐹(𝐶 Func 𝐷)𝐺 ↔ 𝐹(𝐶 Func 𝐸)𝐺)) |
7 | eqid 2821 | . . . . . . . 8 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷) | |
8 | 2, 7 | resshom 16691 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → (Hom ‘𝐷) = (Hom ‘𝐸)) |
9 | 4, 8 | syl 17 | . . . . . 6 ⊢ (𝜑 → (Hom ‘𝐷) = (Hom ‘𝐸)) |
10 | 9 | oveqd 7173 | . . . . 5 ⊢ (𝜑 → ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦))) |
11 | 10 | eqeq2d 2832 | . . . 4 ⊢ (𝜑 → (ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)) ↔ ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦)))) |
12 | 11 | 2ralbidv 3199 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦)))) |
13 | 6, 12 | anbi12d 632 | . 2 ⊢ (𝜑 → ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦))) ↔ (𝐹(𝐶 Func 𝐸)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦))))) |
14 | 1, 7 | isfull 17180 | . 2 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)))) |
15 | eqid 2821 | . . 3 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸) | |
16 | 1, 15 | isfull 17180 | . 2 ⊢ (𝐹(𝐶 Full 𝐸)𝐺 ↔ (𝐹(𝐶 Func 𝐸)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦)))) |
17 | 13, 14, 16 | 3bitr4g 316 | 1 ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ 𝐹(𝐶 Full 𝐸)𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 class class class wbr 5066 ran crn 5556 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 ↾s cress 16484 Hom chom 16576 Catccat 16935 Func cfunc 17124 Full cful 17172 |
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-fal 1550 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-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-er 8289 df-map 8408 df-pm 8409 df-ixp 8462 df-en 8510 df-dom 8511 df-sdom 8512 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-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-hom 16589 df-cco 16590 df-cat 16939 df-cid 16940 df-homf 16941 df-comf 16942 df-ssc 17080 df-resc 17081 df-subc 17082 df-func 17128 df-full 17174 |
This theorem is referenced by: ffthres2c 17210 |
Copyright terms: Public domain | W3C validator |