Theorem funfocofob 46596

Description: If the domain of a function 𝐺 is a subset of the range of a function 𝐹, then the composition (𝐺 ∘ 𝐹) is surjective iff 𝐺 is surjective. (Contributed by GL and AV, 29-Sep-2024.)

Assertion

Ref	Expression
funfocofob	⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))

Proof of Theorem funfocofob

Step	Hyp	Ref	Expression
1		fdmrn 6755	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)
2	1	biimpi 215	. . . . . . 7 ⊢ (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
3	2	3ad2ant1 1130	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐹:dom 𝐹⟶ran 𝐹)
4	3	adantr 479	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → 𝐹:dom 𝐹⟶ran 𝐹)
5		eqid 2725	. . . . 5 ⊢ (ran 𝐹 ∩ 𝐴) = (ran 𝐹 ∩ 𝐴)
6		eqid 2725	. . . . 5 ⊢ (◡𝐹 “ 𝐴) = (◡𝐹 “ 𝐴)
7		eqid 2725	. . . . 5 ⊢ (𝐹 ↾ (◡𝐹 “ 𝐴)) = (𝐹 ↾ (◡𝐹 “ 𝐴))
8		simp2 1134	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐺:𝐴⟶𝐵)
9	8	adantr 479	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → 𝐺:𝐴⟶𝐵)
10		eqid 2725	. . . . 5 ⊢ (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = (𝐺 ↾ (ran 𝐹 ∩ 𝐴))
11		simpr 483	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
12	4, 5, 6, 7, 9, 10, 11	fcoresfo 46591	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵)
13	12	ex 411	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵))
14		sseqin2 4213	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
15	14	biimpi 215	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
16	15	3ad2ant3 1132	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (ran 𝐹 ∩ 𝐴) = 𝐴)
17	8	fdmd 6733	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → dom 𝐺 = 𝐴)
18	16, 17	eqtr4d 2768	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (ran 𝐹 ∩ 𝐴) = dom 𝐺)
19	18	reseq2d 5985	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = (𝐺 ↾ dom 𝐺))
20	8	freld 6729	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → Rel 𝐺)
21		resdm 6031	. . . . . 6 ⊢ (Rel 𝐺 → (𝐺 ↾ dom 𝐺) = 𝐺)
22	20, 21	syl 17	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ dom 𝐺) = 𝐺)
23	19, 22	eqtrd 2765	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = 𝐺)
24		eqidd 2726	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐵 = 𝐵)
25	23, 16, 24	foeq123d 6831	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))
26	13, 25	sylibd 238	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 → 𝐺:𝐴–onto→𝐵))
27		simpr 483	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → 𝐺:𝐴–onto→𝐵)
28		simpl1 1188	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → Fun 𝐹)
29		simpl3 1190	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → 𝐴 ⊆ ran 𝐹)
30		focofo 6823	. . . 4 ⊢ ((𝐺:𝐴–onto→𝐵 ∧ Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
31	27, 28, 29, 30	syl3anc 1368	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
32	31	ex 411	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺:𝐴–onto→𝐵 → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵))
33	26, 32	impbid 211	1 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∩ cin 3943   ⊆ wss 3944  ^◡ccnv 5677  dom cdm 5678  ran crn 5679   ↾ cres 5680   “ cima 5681   ∘ ccom 5682  Rel wrel 5683  Fun wfun 6543  ⟶wf 6545  –onto→wfo 6547

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pr 5429

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-fo 6555  df-fv 6557

This theorem is referenced by:  fnfocofob  46597