Theorem fundcmpsurbijinj 47598

Description: Every function 𝐹:𝐴⟶𝐵 can be decomposed into a surjective, a bijective and an injective function. (Contributed by AV, 23-Mar-2024.)

Assertion

Ref	Expression
fundcmpsurbijinj	⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))

Distinct variable groups:   𝐴,𝑔,ℎ,𝑝   𝐵,𝑔,ℎ,𝑝   𝑔,𝐹,ℎ,𝑝   𝑔,𝑉   𝐴,𝑖,𝑞,𝑔,ℎ,𝑝   𝐵,𝑖,𝑞   𝑖,𝐹,𝑞

Allowed substitution hints:   𝑉(ℎ,𝑖,𝑞,𝑝)

Proof of Theorem fundcmpsurbijinj

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffun 6663	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)
2		funimaexg 6577	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) ∈ V)
3	1, 2	sylan 580	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) ∈ V)
4		abrexexg 7903	. . . 4 ⊢ (𝐴 ∈ 𝑉 → {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V)
5	4	adantl 481	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V)
6		fveq2 6832	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
7	6	sneqd 4590	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → {(𝐹‘𝑦)} = {(𝐹‘𝑥)})
8	7	imaeq2d 6017	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (◡𝐹 “ {(𝐹‘𝑦)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
9	8	eqeq2d 2745	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑧 = (◡𝐹 “ {(𝐹‘𝑦)}) ↔ 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})))
10	9	cbvrexvw 3213	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)}) ↔ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)}))
11	10	abbii 2801	. . . 4 ⊢ {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
12	11	fundcmpsurbijinjpreimafv 47595	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
13		foeq3 6742	. . . . . . . . 9 ⊢ (𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} → (𝑔:𝐴–onto→𝑝 ↔ 𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}))
14	13	adantl 481	. . . . . . . 8 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (𝑔:𝐴–onto→𝑝 ↔ 𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}))
15		f1oeq23 6763	. . . . . . . . 9 ⊢ ((𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ 𝑞 = (𝐹 “ 𝐴)) → (ℎ:𝑝–1-1-onto→𝑞 ↔ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴)))
16	15	ancoms 458	. . . . . . . 8 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (ℎ:𝑝–1-1-onto→𝑞 ↔ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴)))
17		f1eq2 6724	. . . . . . . . 9 ⊢ (𝑞 = (𝐹 “ 𝐴) → (𝑖:𝑞–1-1→𝐵 ↔ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵))
18	17	adantr 480	. . . . . . . 8 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (𝑖:𝑞–1-1→𝐵 ↔ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵))
19	14, 16, 18	3anbi123d 1438	. . . . . . 7 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → ((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ↔ (𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵)))
20	19	anbi1d 631	. . . . . 6 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
21	20	3exbidv 1926	. . . . 5 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
22	21	spc2egv 3551	. . . 4 ⊢ (((𝐹 “ 𝐴) ∈ V ∧ {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V) → (∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) → ∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
23	22	imp 406	. . 3 ⊢ ((((𝐹 “ 𝐴) ∈ V ∧ {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V) ∧ ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))) → ∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
24	3, 5, 12, 23	syl21anc 837	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
25		exrot4 2171	. . 3 ⊢ (∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑞∃𝑝∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
26		excom13 2169	. . . 4 ⊢ (∃𝑞∃𝑝∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
27	26	2exbii 1850	. . 3 ⊢ (∃𝑔∃ℎ∃𝑞∃𝑝∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
28	25, 27	bitri 275	. 2 ⊢ (∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
29	24, 28	sylib 218	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541  ∃wex 1780   ∈ wcel 2113  {cab 2712  ∃wrex 3058  Vcvv 3438  {csn 4578  ^◡ccnv 5621   “ cima 5625   ∘ ccom 5626  Fun wfun 6484  ⟶wf 6486  –1-1→wf1 6487  –onto→wfo 6488  –1-1-onto→wf1o 6489  ‘cfv 6490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498

This theorem is referenced by: (None)