Theorem f1ocoima 7259

Description: The composition of two bijections as bijection onto the image of the range of the first bijection. (Contributed by AV, 15-Aug-2025.)

Assertion

Ref	Expression
f1ocoima	⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵))

Proof of Theorem f1ocoima

Step	Hyp	Ref	Expression
1		f1of1 6781	. . . . . 6 ⊢ (𝐺:𝐶–1-1-onto→𝐷 → 𝐺:𝐶–1-1→𝐷)
2	1	anim1i 616	. . . . 5 ⊢ ((𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶))
3	2	3adant1 1131	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶))
4		f1ores 6796	. . . 4 ⊢ ((𝐺:𝐶–1-1→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵))
5	3, 4	syl 17	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵))
6		simp1 1137	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → 𝐹:𝐴–1-1-onto→𝐵)
7		f1oco 6805	. . 3 ⊢ (((𝐺 ↾ 𝐵):𝐵–1-1-onto→(𝐺 “ 𝐵) ∧ 𝐹:𝐴–1-1-onto→𝐵) → ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵))
8	5, 6, 7	syl2anc 585	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵))
9		f1ofo 6789	. . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–onto→𝐵)
10		forn 6757	. . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵)
11	9, 10	syl 17	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ran 𝐹 = 𝐵)
12	11	eqimssd 3992	. . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ran 𝐹 ⊆ 𝐵)
13	12	3ad2ant1 1134	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ran 𝐹 ⊆ 𝐵)
14		cores 6215	. . . . 5 ⊢ (ran 𝐹 ⊆ 𝐵 → ((𝐺 ↾ 𝐵) ∘ 𝐹) = (𝐺 ∘ 𝐹))
15	14	eqcomd 2743	. . . 4 ⊢ (ran 𝐹 ⊆ 𝐵 → (𝐺 ∘ 𝐹) = ((𝐺 ↾ 𝐵) ∘ 𝐹))
16	13, 15	syl 17	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹) = ((𝐺 ↾ 𝐵) ∘ 𝐹))
17	16	f1oeq1d 6777	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → ((𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵) ↔ ((𝐺 ↾ 𝐵) ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵)))
18	8, 17	mpbird 257	1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷 ∧ 𝐵 ⊆ 𝐶) → (𝐺 ∘ 𝐹):𝐴–1-1-onto→(𝐺 “ 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ⊆ wss 3903  ran crn 5633   ↾ cres 5634   “ cima 5635   ∘ ccom 5636  –1-1→wf1 6497  –onto→wfo 6498  –1-1-onto→wf1o 6499

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-sep 5243  ax-pr 5379

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-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507

This theorem is referenced by:  3f1oss1  47435