Theorem fcoresfob 47869

Description: A composition is surjective iff the restriction of its first component to the minimum domain is surjective. (Contributed by GL and AV, 7-Oct-2024.)

Hypotheses

Ref	Expression
fcores.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
fcores.e	⊢ 𝐸 = (ran 𝐹 ∩ 𝐶)
fcores.p	⊢ 𝑃 = (◡𝐹 “ 𝐶)
fcores.x	⊢ 𝑋 = (𝐹 ↾ 𝑃)
fcores.g	⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
fcores.y	⊢ 𝑌 = (𝐺 ↾ 𝐸)

Assertion

Ref	Expression
fcoresfob	⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–onto→𝐷 ↔ 𝑌:𝐸–onto→𝐷))

Proof of Theorem fcoresfob

Step	Hyp	Ref	Expression
1		fcores.f	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–onto→𝐷) → 𝐹:𝐴⟶𝐵)
3		fcores.e	. . 3 ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶)
4		fcores.p	. . 3 ⊢ 𝑃 = (◡𝐹 “ 𝐶)
5		fcores.x	. . 3 ⊢ 𝑋 = (𝐹 ↾ 𝑃)
6		fcores.g	. . . 4 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
7	6	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–onto→𝐷) → 𝐺:𝐶⟶𝐷)
8		fcores.y	. . 3 ⊢ 𝑌 = (𝐺 ↾ 𝐸)
9		simpr 490	. . 3 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–onto→𝐷) → (𝐺 ∘ 𝐹):𝑃–onto→𝐷)
10	2, 3, 4, 5, 7, 8, 9	fcoresfo 47868	. 2 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–onto→𝐷) → 𝑌:𝐸–onto→𝐷)
11	1, 3, 4, 5	fcoreslem3 47862	. . . . 5 ⊢ (𝜑 → 𝑋:𝑃–onto→𝐸)
12	11	anim1ci 628	. . . 4 ⊢ ((𝜑 ∧ 𝑌:𝐸–onto→𝐷) → (𝑌:𝐸–onto→𝐷 ∧ 𝑋:𝑃–onto→𝐸))
13		foco 6810	. . . 4 ⊢ ((𝑌:𝐸–onto→𝐷 ∧ 𝑋:𝑃–onto→𝐸) → (𝑌 ∘ 𝑋):𝑃–onto→𝐷)
14	12, 13	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑌:𝐸–onto→𝐷) → (𝑌 ∘ 𝑋):𝑃–onto→𝐷)
15	1, 3, 4, 5, 6, 8	fcores 47864	. . . . 5 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋))
16	15	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑌:𝐸–onto→𝐷) → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋))
17		foeq1 6792	. . . 4 ⊢ ((𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋) → ((𝐺 ∘ 𝐹):𝑃–onto→𝐷 ↔ (𝑌 ∘ 𝑋):𝑃–onto→𝐷))
18	16, 17	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑌:𝐸–onto→𝐷) → ((𝐺 ∘ 𝐹):𝑃–onto→𝐷 ↔ (𝑌 ∘ 𝑋):𝑃–onto→𝐷))
19	14, 18	mpbird 260	. 2 ⊢ ((𝜑 ∧ 𝑌:𝐸–onto→𝐷) → (𝐺 ∘ 𝐹):𝑃–onto→𝐷)
20	10, 19	impbida 813	1 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃–onto→𝐷 ↔ 𝑌:𝐸–onto→𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∩ cin 3905  ^◡ccnv 5662  ran crn 5664   ↾ cres 5665   “ cima 5666   ∘ ccom 5667  ⟶wf 6536  –onto→wfo 6538

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fo 6546  df-fv 6548

This theorem is used by:  fcoresf1ob  47870