Theorem fundcmpsurinjpreimafv 48311

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 48310	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
3		vex 3454	. . . . . . 7 ⊢ 𝑗 ∈ V
4		vex 3454	. . . . . . 7 ⊢ 𝑓 ∈ V
5	3, 4	coex 7928	. . . . . 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 6817	. . . . . . . . . 10 ⊢ (𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) → 𝑓:𝑃–1-1→(𝐹 “ 𝐴))
9	8	3ad2ant2 1152	. . . . . . . . 9 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → 𝑓:𝑃–1-1→(𝐹 “ 𝐴))
10		f1co 6785	. . . . . . . . 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 6767	. . . . . . . 8 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (ℎ:𝑃–1-1→𝐵 ↔ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵))
16		coeq1 5837	. . . . . . . . 9 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (ℎ ∘ 𝑔) = ((𝑗 ∘ 𝑓) ∘ 𝑔))
17	16	eqeq2d 2771	. . . . . . . 8 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (𝐹 = (ℎ ∘ 𝑔) ↔ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
18	15, 17	3anbi23d 1467	. . . . . . 7 ⊢ (ℎ = (𝑗 ∘ 𝑓) → ((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)) ↔ (𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))))
19	18	spcegv 3551	. . . . . 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 2145  {cab 2738  ∃wrex 3086  Vcvv 3450  {csn 4584  ^◡ccnv 5654   “ cima 5658   ∘ ccom 5659  ⟶wf 6529  –1-1→wf1 6530  –onto→wfo 6531  –1-1-onto→wf1o 6532  ‘cfv 6533

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541

This theorem is used by:  fundcmpsurinj  48312