| 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 17807 | . . 3 ⊢ (𝜑 → (𝐹(𝐶 Func 𝐷)𝐺 ↔ 𝐹(𝐶 Func 𝐸)𝐺)) |
| 7 | eqid 2731 | . . . . . . . 8 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷) | |
| 8 | 2, 7 | resshom 17319 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → (Hom ‘𝐷) = (Hom ‘𝐸)) |
| 9 | 4, 8 | syl 17 | . . . . . 6 ⊢ (𝜑 → (Hom ‘𝐷) = (Hom ‘𝐸)) |
| 10 | 9 | oveqd 7363 | . . . . 5 ⊢ (𝜑 → ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦))) |
| 11 | 10 | eqeq2d 2742 | . . . 4 ⊢ (𝜑 → (ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)) ↔ ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦)))) |
| 12 | 11 | 2ralbidv 3196 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦)))) |
| 13 | 6, 12 | anbi12d 632 | . 2 ⊢ (𝜑 → ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦))) ↔ (𝐹(𝐶 Func 𝐸)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦))))) |
| 14 | 1, 7 | isfull 17816 | . 2 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)))) |
| 15 | eqid 2731 | . . 3 ⊢ (Hom ‘𝐸) = (Hom ‘𝐸) | |
| 16 | 1, 15 | isfull 17816 | . 2 ⊢ (𝐹(𝐶 Full 𝐸)𝐺 ↔ (𝐹(𝐶 Func 𝐸)𝐺 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ran (𝑥𝐺𝑦) = ((𝐹‘𝑥)(Hom ‘𝐸)(𝐹‘𝑦)))) |
| 17 | 13, 14, 16 | 3bitr4g 314 | 1 ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ 𝐹(𝐶 Full 𝐸)𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∀wral 3047 class class class wbr 5091 ran crn 5617 ⟶wf 6477 ‘cfv 6481 (class class class)co 7346 Basecbs 17117 ↾s cress 17138 Hom chom 17169 Catccat 17567 Func cfunc 17758 Full cful 17808 |
| 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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-er 8622 df-map 8752 df-pm 8753 df-ixp 8822 df-en 8870 df-dom 8871 df-sdom 8872 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-nn 12123 df-2 12185 df-3 12186 df-4 12187 df-5 12188 df-6 12189 df-7 12190 df-8 12191 df-9 12192 df-n0 12379 df-z 12466 df-dec 12586 df-sets 17072 df-slot 17090 df-ndx 17102 df-base 17118 df-ress 17139 df-hom 17182 df-cco 17183 df-cat 17571 df-cid 17572 df-homf 17573 df-comf 17574 df-ssc 17714 df-resc 17715 df-subc 17716 df-func 17762 df-full 17810 |
| This theorem is referenced by: ffthres2c 17846 |
| Copyright terms: Public domain | W3C validator |