Theorem fcoresfob 48141

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 48140	. 2 ⊢ ((𝜑 ∧ (𝐺 ∘ 𝐹):𝑃–onto→𝐷) → 𝑌:𝐸–onto→𝐷)
11	1, 3, 4, 5	fcoreslem3 48134	. . . . 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 48136	. . . . 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 3898  ^◡ccnv 5650  ran crn 5652   ↾ cres 5653   “ cima 5654   ∘ ccom 5655  ⟶wf 6534  –onto→wfo 6536

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546

This theorem is used by:  fcoresf1ob  48142