Theorem funfocofob 48255

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 6744	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)
2	1	biimpi 219	. . . . . . 7 ⊢ (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
3	2	3ad2ant1 1151	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐹:dom 𝐹⟶ran 𝐹)
4	3	adantr 486	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → 𝐹:dom 𝐹⟶ran 𝐹)
5		eqid 2760	. . . . 5 ⊢ (ran 𝐹 ∩ 𝐴) = (ran 𝐹 ∩ 𝐴)
6		eqid 2760	. . . . 5 ⊢ (◡𝐹 “ 𝐴) = (◡𝐹 “ 𝐴)
7		eqid 2760	. . . . 5 ⊢ (𝐹 ↾ (◡𝐹 “ 𝐴)) = (𝐹 ↾ (◡𝐹 “ 𝐴))
8		simp2 1155	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐺:𝐴⟶𝐵)
9	8	adantr 486	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → 𝐺:𝐴⟶𝐵)
10		eqid 2760	. . . . 5 ⊢ (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = (𝐺 ↾ (ran 𝐹 ∩ 𝐴))
11		simpr 490	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
12	4, 5, 6, 7, 9, 10, 11	fcoresfo 48248	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵)
13	12	ex 418	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵))
14		sseqin2 4119	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
15	14	biimpi 219	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
16	15	3ad2ant3 1153	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (ran 𝐹 ∩ 𝐴) = 𝐴)
17	8	fdmd 6723	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → dom 𝐺 = 𝐴)
18	16, 17	eqtr4d 2798	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (ran 𝐹 ∩ 𝐴) = dom 𝐺)
19	18	reseq2d 5970	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = (𝐺 ↾ dom 𝐺))
20	8	freld 6719	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → Rel 𝐺)
21		resdm 6016	. . . . . 6 ⊢ (Rel 𝐺 → (𝐺 ↾ dom 𝐺) = 𝐺)
22	20, 21	syl 18	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ dom 𝐺) = 𝐺)
23	19, 22	eqtrd 2795	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹 ∩ 𝐴)) = 𝐺)
24		eqidd 2761	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → 𝐵 = 𝐵)
25	23, 16, 24	foeq123d 6820	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ↾ (ran 𝐹 ∩ 𝐴)):(ran 𝐹 ∩ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))
26	13, 25	sylibd 242	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 → 𝐺:𝐴–onto→𝐵))
27		simpr 490	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → 𝐺:𝐴–onto→𝐵)
28		simpl1 1210	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → Fun 𝐹)
29		simpl3 1212	. . . 4 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → 𝐴 ⊆ ran 𝐹)
30		focofo 6812	. . . 4 ⊢ ((𝐺:𝐴–onto→𝐵 ∧ Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
31	27, 28, 29, 30	syl3anc 1398	. . 3 ⊢ (((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴–onto→𝐵) → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵)
32	31	ex 418	. 2 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → (𝐺:𝐴–onto→𝐵 → (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵))
33	26, 32	impbid 215	1 ⊢ ((Fun 𝐹 ∧ 𝐺:𝐴⟶𝐵 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐴)–onto→𝐵 ↔ 𝐺:𝐴–onto→𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ⊆ wss 3896   ∩ cin 4088  ^◡ccnv 5649  dom cdm 5650  ran crn 5651   ↾ cres 5652   “ cima 5653   ∘ ccom 5654  Rel wrel 5655  Fun wfun 6535  ⟶wf 6537  –onto→wfo 6539

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-fo 6547  df-fv 6549

This theorem is used by:  fnfocofob  48256