Theorem fundcmpsurinjimaid 48760

Description: Every function 𝐹:𝐴⟶𝐵 can be decomposed into a surjective function onto the image (𝐹 “ 𝐴) of the domain of 𝐹 and an injective function from the image (𝐹 “ 𝐴). (Contributed by AV, 17-Mar-2024.)

Hypotheses

Ref	Expression
fundcmpsurinjimaid.i	⊢ 𝐼 = (𝐹 “ 𝐴)
fundcmpsurinjimaid.g	⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
fundcmpsurinjimaid.h	⊢ 𝐻 = ( I ↾ 𝐼)

Assertion

Ref	Expression
fundcmpsurinjimaid	⊢ (𝐹:𝐴⟶𝐵 → (𝐺:𝐴⟶onto𝐼 ∧ 𝐻:𝐼⟶1-1𝐵 ∧ 𝐹 = (𝐻 ∘ 𝐺)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝐻   𝑥,𝐼

Allowed substitution hint:   𝐺(𝑥)

Proof of Theorem fundcmpsurinjimaid

Step	Hyp	Ref	Expression
1		fimadmfo 6833	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶onto(𝐹 “ 𝐴))
2		fundcmpsurinjimaid.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
3		ffn 6737	. . . . . . 7 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
4		dffn5 6972	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
5	3, 4	sylib 221	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
6	5	eqcomd 2769	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = 𝐹)
7	2, 6	eqtrid 2810	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐺 = 𝐹)
8		eqidd 2764	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐴 = 𝐴)
9		fundcmpsurinjimaid.i	. . . . 5 ⊢ 𝐼 = (𝐹 “ 𝐴)
10	9	a1i 11	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐼 = (𝐹 “ 𝐴))
11	7, 8, 10	foeq123d 6845	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐺:𝐴⟶onto𝐼 ↔ 𝐹:𝐴⟶onto(𝐹 “ 𝐴)))
12	1, 11	mpbird 260	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐺:𝐴⟶onto𝐼)
13		f1oi 6892	. . 3 ⊢ ( I ↾ 𝐼):𝐼⟶1-1onto𝐼
14		f1of1 6851	. . 3 ⊢ (( I ↾ 𝐼):𝐼⟶1-1onto𝐼 → ( I ↾ 𝐼):𝐼⟶1-1𝐼)
15		fundcmpsurinjimaid.h	. . . . . . 7 ⊢ 𝐻 = ( I ↾ 𝐼)
16		f1eq1 6801	. . . . . . 7 ⊢ (𝐻 = ( I ↾ 𝐼) → (𝐻:𝐼⟶1-1𝐼 ↔ ( I ↾ 𝐼):𝐼⟶1-1𝐼))
17	15, 16	ax-mp 5	. . . . . 6 ⊢ (𝐻:𝐼⟶1-1𝐼 ↔ ( I ↾ 𝐼):𝐼⟶1-1𝐼)
18	17	biimpri 231	. . . . 5 ⊢ (( I ↾ 𝐼):𝐼⟶1-1𝐼 → 𝐻:𝐼⟶1-1𝐼)
19		fimass 6758	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵)
20	9, 19	eqsstrid 3951	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → 𝐼 ⊆ 𝐵)
21		f1ss 6813	. . . . 5 ⊢ ((𝐻:𝐼⟶1-1𝐼 ∧ 𝐼 ⊆ 𝐵) → 𝐻:𝐼⟶1-1𝐵)
22	18, 20, 21	syl2an 608	. . . 4 ⊢ ((( I ↾ 𝐼):𝐼⟶1-1𝐼 ∧ 𝐹:𝐴⟶𝐵) → 𝐻:𝐼⟶1-1𝐵)
23	22	ex 418	. . 3 ⊢ (( I ↾ 𝐼):𝐼⟶1-1𝐼 → (𝐹:𝐴⟶𝐵 → 𝐻:𝐼⟶1-1𝐵))
24	13, 14, 23	mp2b 10	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐻:𝐼⟶1-1𝐵)
25	15	fveq1i 6915	. . . . 5 ⊢ (𝐻‘(𝐹‘𝑥)) = (( I ↾ 𝐼)‘(𝐹‘𝑥))
26	3	adantr 486	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐹 Fn 𝐴)
27		simpr 490	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
28	26, 27, 27	fnfvimad 7269	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ (𝐹 “ 𝐴))
29	28, 9	eleqtrrdi 2875	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐼)
30		fvresi 7207	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ 𝐼 → (( I ↾ 𝐼)‘(𝐹‘𝑥)) = (𝐹‘𝑥))
31	29, 30	syl 18	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (( I ↾ 𝐼)‘(𝐹‘𝑥)) = (𝐹‘𝑥))
32	25, 31	eqtrid 2810	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐻‘(𝐹‘𝑥)) = (𝐹‘𝑥))
33	32	mpteq2dva 5202	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝑥 ∈ 𝐴 ↦ (𝐻‘(𝐹‘𝑥))) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
34	2	coeq2i 5847	. . . 4 ⊢ (𝐻 ∘ 𝐺) = (𝐻 ∘ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
35		f1of 6852	. . . . . . . 8 ⊢ (( I ↾ 𝐼):𝐼⟶1-1onto𝐼 → ( I ↾ 𝐼):𝐼⟶𝐼)
36	13, 35	ax-mp 5	. . . . . . 7 ⊢ ( I ↾ 𝐼):𝐼⟶𝐼
37	15	feq1i 6728	. . . . . . 7 ⊢ (𝐻:𝐼⟶𝐼 ↔ ( I ↾ 𝐼):𝐼⟶𝐼)
38	36, 37	mpbir 234	. . . . . 6 ⊢ 𝐻:𝐼⟶𝐼
39	38	a1i 11	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → 𝐻:𝐼⟶𝐼)
40	39, 29	cofmpt 7163	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (𝐻 ∘ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) = (𝑥 ∈ 𝐴 ↦ (𝐻‘(𝐹‘𝑥))))
41	34, 40	eqtrid 2810	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐻 ∘ 𝐺) = (𝑥 ∈ 𝐴 ↦ (𝐻‘(𝐹‘𝑥))))
42	33, 41, 5	3eqtr4rd 2809	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = (𝐻 ∘ 𝐺))
43	12, 24, 42	3jca 1146	1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐺:𝐴⟶onto𝐼 ∧ 𝐻:𝐼⟶1-1𝐵 ∧ 𝐹 = (𝐻 ∘ 𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ↦ cmpt 5190   I cid 5550   ↾ cres 5658   “ cima 5659   ∘ ccom 5660   Fn wfn 6559  ⟶wf 6560  ⟶1-1wf1 6561  ⟶ontowfo 6562  ⟶1-1ontowf1o 6563  ‘cfv 6564

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-sep 5253  ax-nul 5264  ax-pr 5396

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-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-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572

This theorem is used by:  fundcmpsurinjALT  48761