Theorem fundcmpsurinjpreimafv 48217

Description: Every function 𝐹:𝐴⟶𝐵 can be decomposed into a surjective function onto 𝑃 and an injective function from 𝑃. (Contributed by AV, 12-Mar-2024.) (Proof shortened by AV, 22-Mar-2024.)

Hypothesis

Ref	Expression
fundcmpsurinj.p	⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}

Assertion

Ref	Expression
fundcmpsurinjpreimafv	⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))

Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧   𝐴,𝑔,ℎ   𝐵,𝑔,ℎ,𝑥   𝑧,𝐵   𝑔,𝐹,ℎ   𝑃,𝑔,ℎ,𝑥   𝑥,𝑉,𝑔

Allowed substitution hints:   𝑃(𝑧)   𝑉(𝑧, ℎ)

Proof of Theorem fundcmpsurinjpreimafv

Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fundcmpsurinj.p	. . 3 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
2	1	fundcmpsurbijinjpreimafv 48216	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
3		vex 3461	. . . . . . 7 ⊢ 𝑗 ∈ V
4		vex 3461	. . . . . . 7 ⊢ 𝑓 ∈ V
5	3, 4	coex 7933	. . . . . 6 ⊢ (𝑗 ∘ 𝑓) ∈ V
6		simprl1 1237	. . . . . . 7 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → 𝑔:𝐴–onto→𝑃)
7		simp3 1156	. . . . . . . . 9 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → 𝑗:(𝐹 “ 𝐴)–1-1→𝐵)
8		f1of1 6823	. . . . . . . . . 10 ⊢ (𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) → 𝑓:𝑃–1-1→(𝐹 “ 𝐴))
9	8	3ad2ant2 1152	. . . . . . . . 9 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → 𝑓:𝑃–1-1→(𝐹 “ 𝐴))
10		f1co 6791	. . . . . . . . 9 ⊢ ((𝑗:(𝐹 “ 𝐴)–1-1→𝐵 ∧ 𝑓:𝑃–1-1→(𝐹 “ 𝐴)) → (𝑗 ∘ 𝑓):𝑃–1-1→𝐵)
11	7, 9, 10	syl2anc 596	. . . . . . . 8 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → (𝑗 ∘ 𝑓):𝑃–1-1→𝐵)
12	11	ad2antrl 741	. . . . . . 7 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → (𝑗 ∘ 𝑓):𝑃–1-1→𝐵)
13		simprr 785	. . . . . . 7 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))
14	6, 12, 13	3jca 1146	. . . . . 6 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → (𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
15		f1eq1 6773	. . . . . . . 8 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (ℎ:𝑃–1-1→𝐵 ↔ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵))
16		coeq1 5845	. . . . . . . . 9 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (ℎ ∘ 𝑔) = ((𝑗 ∘ 𝑓) ∘ 𝑔))
17	16	eqeq2d 2776	. . . . . . . 8 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (𝐹 = (ℎ ∘ 𝑔) ↔ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
18	15, 17	3anbi23d 1467	. . . . . . 7 ⊢ (ℎ = (𝑗 ∘ 𝑓) → ((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)) ↔ (𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))))
19	18	spcegv 3558	. . . . . 6 ⊢ ((𝑗 ∘ 𝑓) ∈ V → ((𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
20	5, 14, 19	mpsyl 69	. . . . 5 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))
21	20	ex 418	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
22	21	exlimdvv 1967	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
23	22	eximdv 1950	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (∃𝑔∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃𝑔∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
24	2, 23	mpd 16	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2146  {cab 2743  ∃wrex 3091  Vcvv 3457  {csn 4591  ^◡ccnv 5662   “ cima 5666   ∘ ccom 5667  ⟶wf 6536  –1-1→wf1 6537  –onto→wfo 6538  –1-1-onto→wf1o 6539  ‘cfv 6540

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548

This theorem is used by:  fundcmpsurinj  48218