Theorem fundcmpsurinj 47843

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

Assertion

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

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

Allowed substitution hints:   𝑉(ℎ,𝑝)

Proof of Theorem fundcmpsurinj

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

Step	Hyp	Ref	Expression
1		abrexexg 7905	. . . 4 ⊢ (𝐴 ∈ 𝑉 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ∈ V)
2	1	adantl 481	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ∈ V)
3		fveq2 6832	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
4	3	sneqd 4580	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → {(𝐹‘𝑥)} = {(𝐹‘𝑦)})
5	4	imaeq2d 6017	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (◡𝐹 “ {(𝐹‘𝑥)}) = (◡𝐹 “ {(𝐹‘𝑦)}))
6	5	eqeq2d 2748	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑧 = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})))
7	6	cbvrexvw 3217	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)}) ↔ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)}))
8	7	abbii 2804	. . . 4 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}
9	8	fundcmpsurinjpreimafv 47842	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ(𝑔:𝐴–onto→{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ∧ ℎ:{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))
10		foeq3 6742	. . . . 5 ⊢ (𝑝 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} → (𝑔:𝐴–onto→𝑝 ↔ 𝑔:𝐴–onto→{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}))
11		f1eq2 6724	. . . . 5 ⊢ (𝑝 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} → (ℎ:𝑝–1-1→𝐵 ↔ ℎ:{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}–1-1→𝐵))
12	10, 11	3anbi12d 1440	. . . 4 ⊢ (𝑝 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} → ((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)) ↔ (𝑔:𝐴–onto→{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ∧ ℎ:{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
13	12	2exbidv 1926	. . 3 ⊢ (𝑝 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} → (∃𝑔∃ℎ(𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)) ↔ ∃𝑔∃ℎ(𝑔:𝐴–onto→{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} ∧ ℎ:{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔))))
14	2, 9, 13	spcedv 3541	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑝∃𝑔∃ℎ(𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))
15		exrot3 2171	. 2 ⊢ (∃𝑝∃𝑔∃ℎ(𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑝(𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))
16	14, 15	sylib 218	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑝(𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1→𝐵 ∧ 𝐹 = (ℎ ∘ 𝑔)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715  ∃wrex 3062  Vcvv 3430  {csn 4568  ^◡ccnv 5621   “ cima 5625   ∘ ccom 5626  ⟶wf 6486  –1-1→wf1 6487  –onto→wfo 6488  ‘cfv 6490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  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)