Theorem imaf1hom 49015

Description: The hom-set of an image of a functor injective on objects. (Contributed by Zhi Wang, 7-Nov-2025.)

Hypotheses

Ref	Expression
imaf1hom.s	⊢ 𝑆 = (𝐹 “ 𝐴)
imaf1hom.1	⊢ (𝜑 → 𝐹:𝐵–1-1→𝐶)
imaf1hom.x	⊢ (𝜑 → 𝑋 ∈ 𝑆)
imaf1hom.y	⊢ (𝜑 → 𝑌 ∈ 𝑆)
imaf1hom.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
imaf1hom.k	⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))

Assertion

Ref	Expression
imaf1hom	⊢ (𝜑 → (𝑋𝐾𝑌) = (((◡𝐹‘𝑋)𝐺(◡𝐹‘𝑌)) “ ((◡𝐹‘𝑋)𝐻(◡𝐹‘𝑌))))

Distinct variable groups:   𝐹,𝑝,𝑥,𝑦   𝐺,𝑝,𝑥,𝑦   𝐻,𝑝,𝑥,𝑦   𝑥,𝑆,𝑦   𝑋,𝑝,𝑥,𝑦   𝑌,𝑝,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑝)   𝐴(𝑥,𝑦,𝑝)   𝐵(𝑥,𝑦,𝑝)   𝐶(𝑥,𝑦,𝑝)   𝑆(𝑝)   𝐾(𝑥,𝑦,𝑝)   𝑉(𝑥,𝑦,𝑝)

Proof of Theorem imaf1hom

Step	Hyp	Ref	Expression
1		imaf1hom.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
2		imaf1hom.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
3		imaf1hom.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑆)
4		imaf1hom.k	. . . 4 ⊢ 𝐾 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ∪ 𝑝 ∈ ((◡𝐹 “ {𝑥}) × (◡𝐹 “ {𝑦}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
5	1, 1, 2, 3, 4	imasubclem3 49013	. . 3 ⊢ (𝜑 → (𝑋𝐾𝑌) = ∪ 𝑝 ∈ ((◡𝐹 “ {𝑋}) × (◡𝐹 “ {𝑌}))((𝐺‘𝑝) “ (𝐻‘𝑝)))
6		imaf1hom.s	. . . . . . . 8 ⊢ 𝑆 = (𝐹 “ 𝐴)
7		imaf1hom.1	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐵–1-1→𝐶)
8	6, 7, 2	imaf1homlem 49014	. . . . . . 7 ⊢ (𝜑 → ({(◡𝐹‘𝑋)} = (◡𝐹 “ {𝑋}) ∧ (𝐹‘(◡𝐹‘𝑋)) = 𝑋 ∧ (◡𝐹‘𝑋) ∈ 𝐵))
9	8	simp1d 1142	. . . . . 6 ⊢ (𝜑 → {(◡𝐹‘𝑋)} = (◡𝐹 “ {𝑋}))
10	6, 7, 3	imaf1homlem 49014	. . . . . . 7 ⊢ (𝜑 → ({(◡𝐹‘𝑌)} = (◡𝐹 “ {𝑌}) ∧ (𝐹‘(◡𝐹‘𝑌)) = 𝑌 ∧ (◡𝐹‘𝑌) ∈ 𝐵))
11	10	simp1d 1142	. . . . . 6 ⊢ (𝜑 → {(◡𝐹‘𝑌)} = (◡𝐹 “ {𝑌}))
12	9, 11	xpeq12d 5685	. . . . 5 ⊢ (𝜑 → ({(◡𝐹‘𝑋)} × {(◡𝐹‘𝑌)}) = ((◡𝐹 “ {𝑋}) × (◡𝐹 “ {𝑌})))
13		fvex 6888	. . . . . 6 ⊢ (◡𝐹‘𝑋) ∈ V
14		fvex 6888	. . . . . 6 ⊢ (◡𝐹‘𝑌) ∈ V
15	13, 14	xpsn 7130	. . . . 5 ⊢ ({(◡𝐹‘𝑋)} × {(◡𝐹‘𝑌)}) = {⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩}
16	12, 15	eqtr3di 2785	. . . 4 ⊢ (𝜑 → ((◡𝐹 “ {𝑋}) × (◡𝐹 “ {𝑌})) = {⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩})
17	16	iuneq1d 4995	. . 3 ⊢ (𝜑 → ∪ 𝑝 ∈ ((◡𝐹 “ {𝑋}) × (◡𝐹 “ {𝑌}))((𝐺‘𝑝) “ (𝐻‘𝑝)) = ∪ 𝑝 ∈ {⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩} ((𝐺‘𝑝) “ (𝐻‘𝑝)))
18	5, 17	eqtrd 2770	. 2 ⊢ (𝜑 → (𝑋𝐾𝑌) = ∪ 𝑝 ∈ {⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩} ((𝐺‘𝑝) “ (𝐻‘𝑝)))
19		opex 5439	. . 3 ⊢ ⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩ ∈ V
20		fveq2 6875	. . . . 5 ⊢ (𝑝 = ⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩ → (𝐺‘𝑝) = (𝐺‘⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩))
21		df-ov 7406	. . . . 5 ⊢ ((◡𝐹‘𝑋)𝐺(◡𝐹‘𝑌)) = (𝐺‘⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩)
22	20, 21	eqtr4di 2788	. . . 4 ⊢ (𝑝 = ⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩ → (𝐺‘𝑝) = ((◡𝐹‘𝑋)𝐺(◡𝐹‘𝑌)))
23		fveq2 6875	. . . . 5 ⊢ (𝑝 = ⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩ → (𝐻‘𝑝) = (𝐻‘⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩))
24		df-ov 7406	. . . . 5 ⊢ ((◡𝐹‘𝑋)𝐻(◡𝐹‘𝑌)) = (𝐻‘⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩)
25	23, 24	eqtr4di 2788	. . . 4 ⊢ (𝑝 = ⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩ → (𝐻‘𝑝) = ((◡𝐹‘𝑋)𝐻(◡𝐹‘𝑌)))
26	22, 25	imaeq12d 6048	. . 3 ⊢ (𝑝 = ⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩ → ((𝐺‘𝑝) “ (𝐻‘𝑝)) = (((◡𝐹‘𝑋)𝐺(◡𝐹‘𝑌)) “ ((◡𝐹‘𝑋)𝐻(◡𝐹‘𝑌))))
27	19, 26	iunxsn 5067	. 2 ⊢ ∪ 𝑝 ∈ {⟨(◡𝐹‘𝑋), (◡𝐹‘𝑌)⟩} ((𝐺‘𝑝) “ (𝐻‘𝑝)) = (((◡𝐹‘𝑋)𝐺(◡𝐹‘𝑌)) “ ((◡𝐹‘𝑋)𝐻(◡𝐹‘𝑌)))
28	18, 27	eqtrdi 2786	1 ⊢ (𝜑 → (𝑋𝐾𝑌) = (((◡𝐹‘𝑋)𝐺(◡𝐹‘𝑌)) “ ((◡𝐹‘𝑋)𝐻(◡𝐹‘𝑌))))

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2108  {csn 4601  ⟨cop 4607  ∪ ciun 4967   × cxp 5652  ^◡ccnv 5653   “ cima 5657  –1-1→wf1 6527  ‘cfv 6530  (class class class)co 7403   ∈ cmpo 7405

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7727

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6483  df-fun 6532  df-fn 6533  df-f 6534  df-f1 6535  df-fo 6536  df-f1o 6537  df-fv 6538  df-ov 7406  df-oprab 7407  df-mpo 7408

This theorem is referenced by:  imaidfu  49017  imaf1co  49043