Theorem funfocofob 47052

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 6701	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)
2	1	biimpi 216	. . . . . . 7 ⊢ (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
3	2	3ad2ant1 1133	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐹:dom 𝐹⟶ran 𝐹)
4	3	adantr 480	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → 𝐹:dom 𝐹⟶ran 𝐹)
5		eqid 2729	. . . . 5 ⊢ (ran 𝐹 ∩ 𝐴) = (ran 𝐹 ∩ 𝐴)
6		eqid 2729	. . . . 5 ⊢ (◡𝐹 “ 𝐴) = (◡𝐹 “ 𝐴)
7		eqid 2729	. . . . 5 ⊢ (𝐹 ↾ (◡𝐹 “ 𝐴)) = (𝐹 ↾ (◡𝐹 “ 𝐴))
8		simp2 1137	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐺:𝐴⟶𝐵)
9	8	adantr 480	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → 𝐺:𝐴⟶𝐵)
10		eqid 2729	. . . . 5 ⊢ (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = (𝐺 ↾ (ran 𝐹 ∩ 𝐴))
11		simpr 484	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
12	4, 5, 6, 7, 9, 10, 11	fcoresfo 47045	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵)
13	12	ex 412	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵))
14		sseqin2 4182	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
15	14	biimpi 216	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
16	15	3ad2ant3 1135	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (ran 𝐹 ∩ 𝐴) = 𝐴)
17	8	fdmd 6680	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → dom 𝐺 = 𝐴)
18	16, 17	eqtr4d 2767	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (ran 𝐹 ∩ 𝐴) = dom 𝐺)
19	18	reseq2d 5939	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = (𝐺 ↾ dom 𝐺))
20	8	freld 6676	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → Rel 𝐺)
21		resdm 5986	. . . . . 6 ⊢ (Rel 𝐺 → (𝐺 ↾ dom 𝐺) = 𝐺)
22	20, 21	syl 17	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ dom 𝐺) = 𝐺)
23	19, 22	eqtrd 2764	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = 𝐺)
24		eqidd 2730	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐵 = 𝐵)
25	23, 16, 24	foeq123d 6775	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))
26	13, 25	sylibd 239	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 → 𝐺:𝐴–onto→𝐵))
27		simpr 484	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → 𝐺:𝐴–onto→𝐵)
28		simpl1 1192	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → Fun 𝐹)
29		simpl3 1194	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → 𝐴 ⊆ ran 𝐹)
30		focofo 6767	. . . 4 ⊢ ((𝐺:𝐴–onto→𝐵 ∧ Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
31	27, 28, 29, 30	syl3anc 1373	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
32	31	ex 412	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺:𝐴–onto→𝐵 → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵))
33	26, 32	impbid 212	1 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∩ cin 3910   ⊆ wss 3911  ^◡ccnv 5630  dom cdm 5631  ran crn 5632   ↾ cres 5633   “ cima 5634   ∘ ccom 5635  Rel wrel 5636  Fun wfun 6493  ⟶wf 6495  –onto→wfo 6497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-fo 6505  df-fv 6507

This theorem is referenced by:  fnfocofob  47053