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 48414
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 4137 . . . . 5 (ran 𝐹 ∩ 𝐶) ⊆ 𝐶
53, 4eqsstrdi 3957 . . . 4 (𝜑 → 𝐸 ⊆ 𝐶)
61, 5fssresd 6779 . . 3 (𝜑 → (𝐺 ↾ 𝐸):𝐸⟶𝐷)
7 fcores.y . . . 4 𝑌 = (𝐺 ↾ 𝐸)
87feq1i 6730 . . 3 (𝑌:𝐸⟶𝐷 ↔ (𝐺 ↾ 𝐸):𝐸⟶𝐷)
96, 8sylibr 237 . 2 (𝜑 → 𝑌:𝐸⟶𝐷)
10 fcores.f . . . 4 (𝜑 → 𝐹:𝐴⟶𝐵)
11 fcores.p . . . 4 𝑃 = (◡𝐹 “ 𝐶)
12 fcores.x . . . 4 𝑋 = (𝐹 ↾ 𝑃)
1310, 2, 11, 12fcoreslem3 48408 . . 3 (𝜑 → 𝑋:𝑃⟶onto𝐸)
14 fof 6826 . . 3 (𝑋:𝑃⟶onto𝐸 → 𝑋:𝑃⟶𝐸)
1513, 14syl 18 . 2 (𝜑 → 𝑋:𝑃⟶𝐸)
16 fcoresfo.s . . 3 (𝜑 → (𝐺 ∘ 𝐹):𝑃⟶onto𝐷)
1710, 2, 11, 12, 1, 7fcores 48410 . . . . 5 (𝜑 → (𝐺 ∘ 𝐹) = (𝑌 ∘ 𝑋))
1817eqcomd 2769 . . . 4 (𝜑 → (𝑌 ∘ 𝑋) = (𝐺 ∘ 𝐹))
19 foeq1 6822 . . . 4 ((𝑌 ∘ 𝑋) = (𝐺 ∘ 𝐹) → ((𝑌 ∘ 𝑋):𝑃⟶onto𝐷 ↔ (𝐺 ∘ 𝐹):𝑃⟶onto𝐷))
2018, 19syl 18 . . 3 (𝜑 → ((𝑌 ∘ 𝑋):𝑃⟶onto𝐷 ↔ (𝐺 ∘ 𝐹):𝑃⟶onto𝐷))
2116, 20mpbird 260 . 2 (𝜑 → (𝑌 ∘ 𝑋):𝑃⟶onto𝐷)
22 foco2 7141 . 2 ((𝑌:𝐸⟶𝐷 ∧ 𝑋:𝑃⟶𝐸 ∧ (𝑌 ∘ 𝑋):𝑃⟶onto𝐷) → 𝑌:𝐸⟶onto𝐷)
239, 15, 21, 22syl3anc 1399 1 (𝜑 → 𝑌:𝐸⟶onto𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∩ cin 4092  ◡ccnv 5657  ran crn 5659   ↾ cres 5660   “ cima 5661   ∘ ccom 5662  ⟶wf 6562  ⟶ontowfo 6564
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fo 6572  df-fv 6574
This theorem is used by:  fcoresfob  48415  funfocofob  48421
  Copyright terms: Public domain W3C validator