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 48118
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 6080 . . . . 5 (◡𝐹 “ ran 𝐹) = dom 𝐹
2 fndm 6640 . . . . . 6 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
323ad2ant1 1151 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → dom 𝐹 = 𝐴)
41, 3eqtr2id 2809 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → 𝐴 = (◡𝐹 “ ran 𝐹))
5 imaeq2 6048 . . . . 5 (ran 𝐹 = 𝐵 → (◡𝐹 “ ran 𝐹) = (◡𝐹 “ 𝐵))
653ad2ant3 1153 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → (◡𝐹 “ ran 𝐹) = (◡𝐹 “ 𝐵))
74, 6eqtrd 2796 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → 𝐴 = (◡𝐹 “ 𝐵))
8 foeq2 6791 . . 3 (𝐴 = (◡𝐹 “ 𝐵) → ((𝐺 ∘ 𝐹):𝐴–onto→𝐶 ↔ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐵)–onto→𝐶))
97, 8syl 18 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺:𝐵⟶𝐶 ∧ ran 𝐹 = 𝐵) → ((𝐺 ∘ 𝐹):𝐴–onto→𝐶 ↔ (𝐺 ∘ 𝐹):(◡𝐹 “ 𝐵)–onto→𝐶))
10 fnfun 6637 . . 3 (𝐹 Fn 𝐴 → Fun 𝐹)
11 id 23 . . 3 (𝐺:𝐵⟶𝐶 → 𝐺:𝐵⟶𝐶)
12 eqimss2 3990 . . 3 (ran 𝐹 = 𝐵 → 𝐵 ⊆ ran 𝐹)
13 funfocofob 48117 . . 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 3899  ◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654   ∘ ccom 5655  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  –onto→wfo 6535
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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545
This theorem is used by:  focofob  48119  f1ocof1ob  48120
  Copyright terms: Public domain W3C validator