Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  idfullsubc Structured version   Visualization version   GIF version

Theorem idfullsubc 49665
Description: The source category of an inclusion functor is a full subcategory of the target category if the inclusion functor is full. Remark 4.4(2) in [Adamek] p. 49. See also ressffth 17902. (Contributed by Zhi Wang, 11-Nov-2025.)
Hypotheses
Ref Expression
idfth.i 𝐼 = (idfunc𝐶)
idsubc.h 𝐻 = (Homf𝐷)
idfullsubc.j 𝐽 = (Homf𝐸)
idfullsubc.b 𝐵 = (Base‘𝐷)
idfullsubc.c 𝐶 = (Base‘𝐸)
Assertion
Ref Expression
idfullsubc (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵𝐶 ∧ (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻))

Proof of Theorem idfullsubc
Dummy variables 𝑝 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 idfullsubc.b . . . 4 𝐵 = (Base‘𝐷)
2 idfth.i . . . . 5 𝐼 = (idfunc𝐶)
3 fullfunc 17870 . . . . . 6 (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
43sseli 3913 . . . . 5 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐼 ∈ (𝐷 Func 𝐸))
52, 4imaidfu2lem 49613 . . . 4 (𝐼 ∈ (𝐷 Full 𝐸) → ((1st𝐼) “ (Base‘𝐷)) = (Base‘𝐷))
61, 5eqtr4id 2795 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐵 = ((1st𝐼) “ (Base‘𝐷)))
7 eqid 2741 . . . . 5 ((1st𝐼) “ (Base‘𝐷)) = ((1st𝐼) “ (Base‘𝐷))
8 eqid 2741 . . . . 5 (Hom ‘𝐷) = (Hom ‘𝐷)
9 eqid 2741 . . . . 5 (𝑥 ∈ ((1st𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st𝐼) “ (Base‘𝐷)) ↦ 𝑝 ∈ (((1st𝐼) “ {𝑥}) × ((1st𝐼) “ {𝑦}))(((2nd𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))) = (𝑥 ∈ ((1st𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st𝐼) “ (Base‘𝐷)) ↦ 𝑝 ∈ (((1st𝐼) “ {𝑥}) × ((1st𝐼) “ {𝑦}))(((2nd𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝)))
10 relfull 17872 . . . . . 6 Rel (𝐷 Full 𝐸)
11 1st2ndbr 7988 . . . . . 6 ((Rel (𝐷 Full 𝐸) ∧ 𝐼 ∈ (𝐷 Full 𝐸)) → (1st𝐼)(𝐷 Full 𝐸)(2nd𝐼))
1210, 11mpan 697 . . . . 5 (𝐼 ∈ (𝐷 Full 𝐸) → (1st𝐼)(𝐷 Full 𝐸)(2nd𝐼))
13 idfullsubc.c . . . . 5 𝐶 = (Base‘𝐸)
14 idfullsubc.j . . . . 5 𝐽 = (Homf𝐸)
157, 8, 9, 12, 13, 14imasubc 49655 . . . 4 (𝐼 ∈ (𝐷 Full 𝐸) → ((𝑥 ∈ ((1st𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st𝐼) “ (Base‘𝐷)) ↦ 𝑝 ∈ (((1st𝐼) “ {𝑥}) × ((1st𝐼) “ {𝑦}))(((2nd𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))) Fn (((1st𝐼) “ (Base‘𝐷)) × ((1st𝐼) “ (Base‘𝐷))) ∧ ((1st𝐼) “ (Base‘𝐷)) ⊆ 𝐶 ∧ (𝐽 ↾ (((1st𝐼) “ (Base‘𝐷)) × ((1st𝐼) “ (Base‘𝐷)))) = (𝑥 ∈ ((1st𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st𝐼) “ (Base‘𝐷)) ↦ 𝑝 ∈ (((1st𝐼) “ {𝑥}) × ((1st𝐼) “ {𝑦}))(((2nd𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝)))))
1615simp2d 1150 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → ((1st𝐼) “ (Base‘𝐷)) ⊆ 𝐶)
176, 16eqsstrd 3951 . 2 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐵𝐶)
1815simp3d 1151 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (((1st𝐼) “ (Base‘𝐷)) × ((1st𝐼) “ (Base‘𝐷)))) = (𝑥 ∈ ((1st𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st𝐼) “ (Base‘𝐷)) ↦ 𝑝 ∈ (((1st𝐼) “ {𝑥}) × ((1st𝐼) “ {𝑦}))(((2nd𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))))
196sqxpeqd 5653 . . . 4 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵 × 𝐵) = (((1st𝐼) “ (Base‘𝐷)) × ((1st𝐼) “ (Base‘𝐷))))
2019reseq2d 5938 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (𝐵 × 𝐵)) = (𝐽 ↾ (((1st𝐼) “ (Base‘𝐷)) × ((1st𝐼) “ (Base‘𝐷)))))
21 idsubc.h . . . 4 𝐻 = (Homf𝐷)
222, 4, 8, 21, 9, 5imaidfu2 49615 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐻 = (𝑥 ∈ ((1st𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st𝐼) “ (Base‘𝐷)) ↦ 𝑝 ∈ (((1st𝐼) “ {𝑥}) × ((1st𝐼) “ {𝑦}))(((2nd𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))))
2318, 20, 223eqtr4d 2786 . 2 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻)
2417, 23jca 517 1 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵𝐶 ∧ (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1548  wcel 2121  wss 3885  {csn 4558   ciun 4924   class class class wbr 5075   × cxp 5619  ccnv 5620  cres 5623  cima 5624  Rel wrel 5626   Fn wfn 6484  cfv 6489  (class class class)co 7360  cmpo 7362  1st c1st 7933  2nd c2nd 7934  Basecbs 17174  Hom chom 17226  Homf chomf 17627   Func cfunc 17816  idfunccidfu 17817   Full cful 17866
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 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-map 8769  df-ixp 8840  df-cat 17629  df-cid 17630  df-homf 17631  df-func 17820  df-idfu 17821  df-full 17868
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator