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 50669
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 18165. (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 18133 . . . . . 6 (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
43sseli 3909 . . . . 5 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐼 ∈ (𝐷 Func 𝐸))
52, 4imaidfu2lem 50617 . . . 4 (𝐼 ∈ (𝐷 Full 𝐸) → ((1st ‘𝐼) “ (Base‘𝐷)) = (Base‘𝐷))
61, 5eqtr4id 2817 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐵 = ((1st ‘𝐼) “ (Base‘𝐷)))
7 eqid 2763 . . . . 5 ((1st ‘𝐼) “ (Base‘𝐷)) = ((1st ‘𝐼) “ (Base‘𝐷))
8 eqid 2763 . . . . 5 (Hom ‘𝐷) = (Hom ‘𝐷)
9 eqid 2763 . . . . 5 (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))) = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝)))
10 relfull 18135 . . . . . 6 Rel (𝐷 Full 𝐸)
11 1st2ndbr 8087 . . . . . 6 ((Rel (𝐷 Full 𝐸) ∧ 𝐼 ∈ (𝐷 Full 𝐸)) → (1st ‘𝐼)(𝐷 Full 𝐸)(2nd ‘𝐼))
1210, 11mpan 703 . . . . 5 (𝐼 ∈ (𝐷 Full 𝐸) → (1st ‘𝐼)(𝐷 Full 𝐸)(2nd ‘𝐼))
13 idfullsubc.c . . . . 5 𝐶 = (Base‘𝐸)
14 idfullsubc.j . . . . 5 𝐽 = (Homf ‘𝐸)
157, 8, 9, 12, 13, 14imasubc 50659 . . . 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 1161 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → ((1st ‘𝐼) “ (Base‘𝐷)) ⊆ 𝐶)
176, 16eqsstrd 3947 . 2 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐵 ⊆ 𝐶)
1815simp3d 1162 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷)))) = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))))
196sqxpeqd 5690 . . . 4 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵 × 𝐵) = (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷))))
2019reseq2d 5986 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (𝐵 × 𝐵)) = (𝐽 ↾ (((1st ‘𝐼) “ (Base‘𝐷)) × ((1st ‘𝐼) “ (Base‘𝐷)))))
21 idsubc.h . . . 4 𝐻 = (Homf ‘𝐷)
222, 4, 8, 21, 9, 5imaidfu2 50619 . . 3 (𝐼 ∈ (𝐷 Full 𝐸) → 𝐻 = (𝑥 ∈ ((1st ‘𝐼) “ (Base‘𝐷)), 𝑦 ∈ ((1st ‘𝐼) “ (Base‘𝐷)) ↦ ∪ 𝑝 ∈ ((◡(1st ‘𝐼) “ {𝑥}) × (◡(1st ‘𝐼) “ {𝑦}))(((2nd ‘𝐼)‘𝑝) “ ((Hom ‘𝐷)‘𝑝))))
2318, 20, 223eqtr4d 2808 . 2 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻)
2417, 23jca 521 1 (𝐼 ∈ (𝐷 Full 𝐸) → (𝐵 ⊆ 𝐶 ∧ (𝐽 ↾ (𝐵 × 𝐵)) = 𝐻))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  {csn 4588  ∪ ciun 4956   class class class wbr 5108   × cxp 5656  ◡ccnv 5657   ↾ cres 5660   “ cima 5661  Rel wrel 5663   Fn wfn 6561  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034  Basecbs 17431  Hom chom 17483  Homf chomf 17890   Func cfunc 18079  idfunccidfu 18080   Full cful 18129
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-ixp 8964  df-cat 17892  df-cid 17893  df-homf 17894  df-func 18083  df-idfu 18084  df-full 18131
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator