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

Theorem fnfocofob 48422
Description: If the domain of a function 𝐺 equals the range of a function 𝐹, then the composition (𝐺 ∘ 𝐹) is surjective iff 𝐺 is surjective. (Contributed by GL and AV, 29-Sep-2024.)
Assertion
Ref Expression
fnfocofob ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → ((𝐺 ∘ 𝐹):𝐴⟶onto𝐶 ↔ 𝐺:𝐵⟶onto𝐶))

Proof of Theorem fnfocofob
StepHypRef Expression
1 cnvimarndm 6098 . . . . 5 (◡𝐹 “ ran 𝐹) = dom 𝐹
2 fndm 6672 . . . . . 6 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
323ad2ant1 1151 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → dom 𝐹 = 𝐴)
41, 3eqtr2id 2811 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → 𝐴 = (◡𝐹 “ ran 𝐹))
5 imaeq2 6066 . . . . 5 (ran 𝐹 = 𝐵 → (◡𝐹 “ ran 𝐹) = (◡𝐹 “ 𝐵))
653ad2ant3 1153 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → (◡𝐹 “ ran 𝐹) = (◡𝐹 “ 𝐵))
74, 6eqtrd 2798 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → 𝐴 = (◡𝐹 “ 𝐵))
8 foeq2 6823 . . 3 (𝐴 = (◡𝐹 “ 𝐵) → ((𝐺 ∘ 𝐹):𝐴⟶onto𝐶 ↔ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐵)⟶onto𝐶))
97, 8syl 18 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → ((𝐺 ∘ 𝐹):𝐴⟶onto𝐶 ↔ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐵)⟶onto𝐶))
10 fnfun 6669 . . 3 (𝐹 Fn 𝐴 → Fun 𝐹)
11 id 23 . . 3 (𝐺:𝐵⟶𝐶 → 𝐺:𝐵⟶𝐶)
12 eqimss2 3972 . . 3 (ran 𝐹 = 𝐵 → 𝐵 ⊆ ran 𝐹)
13 funfocofob 48421 . . 3 ((Fun 𝐹 ∧ 𝐺:𝐵⟶𝐶 ∧ 𝐵 ⊆ ran 𝐹) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐵)⟶onto𝐶 ↔ 𝐺:𝐵⟶onto𝐶))
1410, 11, 12, 13syl3an 1178 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → ((𝐺 ∘ 𝐹):(◡𝐹 “ 𝐵)⟶onto𝐶 ↔ 𝐺:𝐵⟶onto𝐶))
159, 14bitrd 282 1 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → ((𝐺 ∘ 𝐹):𝐴⟶onto𝐶 ↔ 𝐺:𝐵⟶onto𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ⊆ wss 3900  ◡ccnv 5657  dom cdm 5658  ran crn 5659   “ cima 5661   ∘ ccom 5662  Fun wfun 6560   Fn wfn 6561  ⟶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:  focofob  48423  f1ocof1ob  48424
  Copyright terms: Public domain W3C validator