Theorem fundcmpsurinjpreimafv 43617

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 43616	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
3		vex 3497	. . . . . . 7 ⊢ 𝑗 ∈ V
4		vex 3497	. . . . . . 7 ⊢ 𝑓 ∈ V
5	3, 4	coex 7635	. . . . . 6 ⊢ (𝑗 ∘ 𝑓) ∈ V
6		simprl1 1214	. . . . . . 7 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → 𝑔:𝐴–onto→𝑃)
7		simp3 1134	. . . . . . . . 9 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → 𝑗:(𝐹 “ 𝐴)–1-1→𝐵)
8		f1of1 6614	. . . . . . . . . 10 ⊢ (𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) → 𝑓:𝑃–1-1→(𝐹 “ 𝐴))
9	8	3ad2ant2 1130	. . . . . . . . 9 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → 𝑓:𝑃–1-1→(𝐹 “ 𝐴))
10		f1co 6585	. . . . . . . . 9 ⊢ ((𝑗:(𝐹 “ 𝐴)–1-1→𝐵 ∧ 𝑓:𝑃–1-1→(𝐹 “ 𝐴)) → (𝑗 ∘ 𝑓):𝑃–1-1→𝐵)
11	7, 9, 10	syl2anc 586	. . . . . . . 8 ⊢ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) → (𝑗 ∘ 𝑓):𝑃–1-1→𝐵)
12	11	ad2antrl 726	. . . . . . 7 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → (𝑗 ∘ 𝑓):𝑃–1-1→𝐵)
13		simprr 771	. . . . . . 7 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))
14	6, 12, 13	3jca 1124	. . . . . 6 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → (𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
15		f1eq1 6570	. . . . . . . 8 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (ℎ:𝑃–1-1→𝐵 ↔ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵))
16		coeq1 5728	. . . . . . . . 9 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (ℎ ∘ 𝑔) = ((𝑗 ∘ 𝑓) ∘ 𝑔))
17	16	eqeq2d 2832	. . . . . . . 8 ⊢ (ℎ = (𝑗 ∘ 𝑓) → (𝐹 = (ℎ ∘ 𝑔) ↔ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)))
18	15, 17	3anbi23d 1435	. . . . . . 7 ⊢ (ℎ = (𝑗 ∘ 𝑓) → ((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)) ↔ (𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))))
19	18	spcegv 3597	. . . . . 6 ⊢ ((𝑗 ∘ 𝑓) ∈ V → ((𝑔:𝐴–onto→𝑃 ∧ (𝑗 ∘ 𝑓):𝑃–1-1→𝐵 ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
20	5, 14, 19	mpsyl 68	. . . . 5 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ ((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔))) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))
21	20	ex 415	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
22	21	exlimdvv 1935	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
23	22	eximdv 1918	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (∃𝑔∃𝑓∃𝑗((𝑔:𝐴–onto→𝑃 ∧ 𝑓:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑗:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑗 ∘ 𝑓) ∘ 𝑔)) → ∃𝑔∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
24	2, 23	mpd 15	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ(𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1537  ∃wex 1780   ∈ wcel 2114  {cab 2799  ∃wrex 3139  Vcvv 3494  {csn 4567  ^◡ccnv 5554   “ cima 5558   ∘ ccom 5559  ⟶wf 6351  –1-1→wf1 6352  –onto→wfo 6353  –1-1-onto→wf1o 6354  ‘cfv 6355

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363

This theorem is referenced by:  fundcmpsurinj  43618