Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fcoresfo Structured version   Visualization version   GIF version

Theorem fcoresfo 48248
Description: If a composition is surjective, then the restriction of its first component to the minimum domain is surjective. (Contributed by AV, 17-Sep-2024.)
Hypotheses
Ref Expression
fcores.f (𝜑 → 𝐹:𝐴⟶𝐵)
fcores.e 𝐸 = (ran 𝐹 ∩ 𝐶)
fcores.p 𝑃 = (◡𝐹 “ 𝐶)
fcores.x 𝑋 = (𝐹 ↾ 𝑃)
fcores.g (𝜑 → 𝐺:𝐶⟶𝐷)
fcores.y 𝑌 = (𝐺 ↾ 𝐸)
fcoresfo.s (𝜑 → (𝐺 ∘ 𝐹):𝑃–onto→𝐷)
Assertion
Ref Expression
fcoresfo (𝜑 → 𝑌:𝐸–onto→𝐷)

Proof of Theorem fcoresfo
StepHypRef Expression
1 fcores.g . . . 4 (𝜑 → 𝐺:𝐶⟶𝐷)
2 fcores.e . . . . . 6 𝐸 = (ran 𝐹 ∩ 𝐶)
32a1i 11 . . . . 5 (𝜑 → 𝐸 = (ran 𝐹 ∩ 𝐶))
4 inss2 4133 . . . . 5 (ran 𝐹 ∩ 𝐶) ⊆ 𝐶
53, 4eqsstrdi 3953 . . . 4 (𝜑 → 𝐸 ⊆ 𝐶)
61, 5fssresd 6752 . . 3 (𝜑 → (𝐺 ↾ 𝐸):𝐸⟶𝐷)
7 fcores.y . . . 4 𝑌 = (𝐺 ↾ 𝐸)
87feq1i 6703 . . 3 (𝑌:𝐸⟶𝐷 ↔ (𝐺 ↾ 𝐸):𝐸⟶𝐷)
96, 8sylibr 237 . 2 (𝜑 → 𝑌:𝐸⟶𝐷)
10 fcores.f . . . 4 (𝜑 → 𝐹:𝐴⟶𝐵)
11 fcores.p . . . 4 𝑃 = (◡𝐹 “ 𝐶)
12 fcores.x . . . 4 𝑋 = (𝐹 ↾ 𝑃)
1310, 2, 11, 12fcoreslem3 48242 . . 3 (𝜑 → 𝑋:𝑃–onto→𝐸)
14 fof 6799 . . 3 (𝑋:𝑃–onto→𝐸 → 𝑋:𝑃⟶𝐸)
1513, 14syl 18 . 2 (𝜑 → 𝑋:𝑃⟶𝐸)
16 fcoresfo.s . . 3 (𝜑 → (𝐺 ∘ 𝐹):𝑃–onto→𝐷)
1710, 2, 11, 12, 1, 7fcores 48244 . . . . 5 (𝜑 → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋))
1817eqcomd 2766 . . . 4 (𝜑 → (𝑌 ∘ 𝑋) = (𝐺 ∘ 𝐹))
19 foeq1 6795 . . . 4 ((𝑌 ∘ 𝑋) = (𝐺 ∘ 𝐹) → ((𝑌 ∘ 𝑋):𝑃–onto→𝐷 ↔ (𝐺 ∘ 𝐹):𝑃–onto→𝐷))
2018, 19syl 18 . . 3 (𝜑 → ((𝑌 ∘ 𝑋):𝑃–onto→𝐷 ↔ (𝐺 ∘ 𝐹):𝑃–onto→𝐷))
2116, 20mpbird 260 . 2 (𝜑 → (𝑌 ∘ 𝑋):𝑃–onto→𝐷)
22 foco2 7112 . 2 ((𝑌:𝐸⟶𝐷 ∧ 𝑋:𝑃⟶𝐸 ∧ (𝑌 ∘ 𝑋):𝑃–onto→𝐷) → 𝑌:𝐸–onto→𝐷)
239, 15, 21, 22syl3anc 1398 1 (𝜑 → 𝑌:𝐸–onto→𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∩ cin 4088  ◡ccnv 5649  ran crn 5651   ↾ cres 5652   “ cima 5653   ∘ ccom 5654  ⟶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:  fcoresfob  48249  funfocofob  48255
  Copyright terms: Public domain W3C validator