Theorem uobeq 50272

Description: If a full functor (in fact, a full embedding) is a section of a functor (surjective on objects), then the sets of universal objects are equal. (Contributed by Zhi Wang, 17-Nov-2025.)

Hypotheses

Ref	Expression
uobffth.b	⊢ 𝐵 = (Base‘𝐷)
uobffth.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
uobffth.f	⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
uobffth.g	⊢ (𝜑 → (𝐾 ∘func 𝐹) = 𝐺)
uobffth.y	⊢ (𝜑 → ((1st ‘𝐾)‘𝑋) = 𝑌)
uobeq.i	⊢ 𝐼 = (idfunc‘𝐷)
uobeq.k	⊢ (𝜑 → 𝐾 ∈ (𝐷 Full 𝐸))
uobeq.n	⊢ (𝜑 → (𝐿 ∘func 𝐾) = 𝐼)
uobeq.l	⊢ (𝜑 → 𝐿 ∈ (𝐸 Func 𝐷))

Assertion

Ref	Expression
uobeq	⊢ (𝜑 → dom (𝐹(𝐶 UP 𝐷)𝑋) = dom (𝐺(𝐶 UP 𝐸)𝑌))

Proof of Theorem uobeq

Step	Hyp	Ref	Expression
1		uobffth.b	. 2 ⊢ 𝐵 = (Base‘𝐷)
2		uobffth.x	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
3		uobffth.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
4		uobffth.g	. 2 ⊢ (𝜑 → (𝐾 ∘func 𝐹) = 𝐺)
5		uobffth.y	. 2 ⊢ (𝜑 → ((1st ‘𝐾)‘𝑋) = 𝑌)
6		uobeq.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ (𝐷 Full 𝐸))
7		relfunc 18017	. . . . 5 ⊢ Rel (𝐷 Func 𝐸)
8		fullfunc 18063	. . . . . 6 ⊢ (𝐷 Full 𝐸) ⊆ (𝐷 Func 𝐸)
9	8, 6	sselid 3929	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ (𝐷 Func 𝐸))
10		1st2nd 8039	. . . . 5 ⊢ ((Rel (𝐷 Func 𝐸) ∧ 𝐾 ∈ (𝐷 Func 𝐸)) → 𝐾 = ⟨(1st ‘𝐾), (2nd ‘𝐾)⟩)
11	7, 9, 10	sylancr 599	. . . 4 ⊢ (𝜑 → 𝐾 = ⟨(1st ‘𝐾), (2nd ‘𝐾)⟩)
12		uobeq.i	. . . . . 6 ⊢ 𝐼 = (idfunc‘𝐷)
13	9	func1st2nd 50128	. . . . . 6 ⊢ (𝜑 → (1st ‘𝐾)(𝐷 Func 𝐸)(2nd ‘𝐾))
14		uobeq.l	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ (𝐸 Func 𝐷))
15	14	func1st2nd 50128	. . . . . 6 ⊢ (𝜑 → (1st ‘𝐿)(𝐸 Func 𝐷)(2nd ‘𝐿))
16	9, 14	cofu1st2nd 50144	. . . . . . 7 ⊢ (𝜑 → (𝐿 ∘func 𝐾) = (⟨(1st ‘𝐿), (2nd ‘𝐿)⟩ ∘func ⟨(1st ‘𝐾), (2nd ‘𝐾)⟩))
17		uobeq.n	. . . . . . 7 ⊢ (𝜑 → (𝐿 ∘func 𝐾) = 𝐼)
18	16, 17	eqtr3d 2798	. . . . . 6 ⊢ (𝜑 → (⟨(1st ‘𝐿), (2nd ‘𝐿)⟩ ∘func ⟨(1st ‘𝐾), (2nd ‘𝐾)⟩) = 𝐼)
19	12, 13, 15, 18	cofidfth 50214	. . . . 5 ⊢ (𝜑 → (1st ‘𝐾)(𝐷 Faith 𝐸)(2nd ‘𝐾))
20		df-br 5104	. . . . 5 ⊢ ((1st ‘𝐾)(𝐷 Faith 𝐸)(2nd ‘𝐾) ↔ ⟨(1st ‘𝐾), (2nd ‘𝐾)⟩ ∈ (𝐷 Faith 𝐸))
21	19, 20	sylib 221	. . . 4 ⊢ (𝜑 → ⟨(1st ‘𝐾), (2nd ‘𝐾)⟩ ∈ (𝐷 Faith 𝐸))
22	11, 21	eqeltrd 2861	. . 3 ⊢ (𝜑 → 𝐾 ∈ (𝐷 Faith 𝐸))
23	6, 22	elind 4146	. 2 ⊢ (𝜑 → 𝐾 ∈ ((𝐷 Full 𝐸) ∩ (𝐷 Faith 𝐸)))
24	1, 2, 3, 4, 5, 23	uobffth 50270	1 ⊢ (𝜑 → dom (𝐹(𝐶 UP 𝐷)𝑋) = dom (𝐺(𝐶 UP 𝐸)𝑌))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   class class class wbr 5103  dom cdm 5651  Rel wrel 5656  ‘cfv 6531  (class class class)co 7412  1^st c1st 7988  2^nd c2nd 7989  Basecbs 17367   Func cfunc 18009  id_funccidfu 18010   ∘_func ccofu 18011   Full cful 18059   Faith cfth 18060   UP cup 50225

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-map 8833  df-ixp 8910  df-cat 17822  df-cid 17823  df-func 18013  df-idfu 18014  df-cofu 18015  df-full 18061  df-fth 18062  df-up 50226

This theorem is used by:  uobeq2  50453