Theorem fundcmpsurbijinj 48082

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 6709	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)
2		funimaexg 6623	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) ∈ V)
3	1, 2	sylan 591	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) ∈ V)
4		abrexexg 7958	. . . 4 ⊢ (𝐴 ∈ 𝑉 → {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V)
5	4	adantl 486	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V)
6		fveq2 6882	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
7	6	sneqd 4606	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → {(𝐹‘𝑦)} = {(𝐹‘𝑥)})
8	7	imaeq2d 6063	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (◡𝐹 “ {(𝐹‘𝑦)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
9	8	eqeq2d 2780	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑧 = (◡𝐹 “ {(𝐹‘𝑦)}) ↔ 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})))
10	9	cbvrexvw 3250	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)}) ↔ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)}))
11	10	abbii 2836	. . . 4 ⊢ {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
12	11	fundcmpsurbijinjpreimafv 48079	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
13		foeq3 6791	. . . . . . . . 9 ⊢ (𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} → (𝑔:𝐴–onto→𝑝 ↔ 𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}))
14	13	adantl 486	. . . . . . . 8 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (𝑔:𝐴–onto→𝑝 ↔ 𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}))
15		f1oeq23 6812	. . . . . . . . 9 ⊢ ((𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ 𝑞 = (𝐹 “ 𝐴)) → (ℎ:𝑝–1-1-onto→𝑞 ↔ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴)))
16	15	ancoms 463	. . . . . . . 8 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (ℎ:𝑝–1-1-onto→𝑞 ↔ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴)))
17		f1eq2 6771	. . . . . . . . 9 ⊢ (𝑞 = (𝐹 “ 𝐴) → (𝑖:𝑞–1-1→𝐵 ↔ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵))
18	17	adantr 485	. . . . . . . 8 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (𝑖:𝑞–1-1→𝐵 ↔ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵))
19	14, 16, 18	3anbi123d 1462	. . . . . . 7 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → ((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ↔ (𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵)))
20	19	anbi1d 642	. . . . . 6 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
21	20	3exbidv 1952	. . . . 5 ⊢ ((𝑞 = (𝐹 “ 𝐴) ∧ 𝑝 = {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}) → (∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
22	21	spc2egv 3567	. . . 4 ⊢ (((𝐹 “ 𝐴) ∈ V ∧ {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V) → (∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) → ∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
23	22	imp 411	. . 3 ⊢ ((((𝐹 “ 𝐴) ∈ V ∧ {𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∈ V) ∧ ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})} ∧ ℎ:{𝑧 ∣ ∃𝑦 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑦)})}–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))) → ∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
24	3, 5, 12, 23	syl21anc 850	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
25		exrot4 2207	. . 3 ⊢ (∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑞∃𝑝∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
26		excom13 2205	. . . 4 ⊢ (∃𝑞∃𝑝∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
27	26	2exbii 1876	. . 3 ⊢ (∃𝑔∃ℎ∃𝑞∃𝑝∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
28	25, 27	bitri 278	. 2 ⊢ (∃𝑞∃𝑝∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
29	24, 28	sylib 221	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖∃𝑝∃𝑞((𝑔:𝐴–onto→𝑝 ∧ ℎ:𝑝–1-1-onto→𝑞 ∧ 𝑖:𝑞–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567  ∃wex 1806   ∈ wcel 2149  {cab 2747  ∃wrex 3095  Vcvv 3463  {csn 4594  ^◡ccnv 5661   “ cima 5665   ∘ ccom 5666  Fun wfun 6531  ⟶wf 6533  –1-1→wf1 6534  –onto→wfo 6535  –1-1-onto→wf1o 6536  ‘cfv 6537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545

This theorem is referenced by: (None)