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

Theorem funfocofob 46993
Description: If the domain of a function 𝐺 is a subset of the range of a function 𝐹, then the composition (𝐺𝐹) is surjective iff 𝐺 is surjective. (Contributed by GL and AV, 29-Sep-2024.)
Assertion
Ref Expression
funfocofob ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → ((𝐺𝐹):(𝐹𝐴)–onto𝐵𝐺:𝐴onto𝐵))

Proof of Theorem funfocofob
StepHypRef Expression
1 fdmrn 6779 . . . . . . . 8 (Fun 𝐹𝐹:dom 𝐹⟶ran 𝐹)
21biimpi 216 . . . . . . 7 (Fun 𝐹𝐹:dom 𝐹⟶ran 𝐹)
323ad2ant1 1133 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → 𝐹:dom 𝐹⟶ran 𝐹)
43adantr 480 . . . . 5 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → 𝐹:dom 𝐹⟶ran 𝐹)
5 eqid 2740 . . . . 5 (ran 𝐹𝐴) = (ran 𝐹𝐴)
6 eqid 2740 . . . . 5 (𝐹𝐴) = (𝐹𝐴)
7 eqid 2740 . . . . 5 (𝐹 ↾ (𝐹𝐴)) = (𝐹 ↾ (𝐹𝐴))
8 simp2 1137 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → 𝐺:𝐴𝐵)
98adantr 480 . . . . 5 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → 𝐺:𝐴𝐵)
10 eqid 2740 . . . . 5 (𝐺 ↾ (ran 𝐹𝐴)) = (𝐺 ↾ (ran 𝐹𝐴))
11 simpr 484 . . . . 5 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → (𝐺𝐹):(𝐹𝐴)–onto𝐵)
124, 5, 6, 7, 9, 10, 11fcoresfo 46986 . . . 4 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → (𝐺 ↾ (ran 𝐹𝐴)):(ran 𝐹𝐴)–onto𝐵)
1312ex 412 . . 3 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → ((𝐺𝐹):(𝐹𝐴)–onto𝐵 → (𝐺 ↾ (ran 𝐹𝐴)):(ran 𝐹𝐴)–onto𝐵))
14 sseqin2 4244 . . . . . . . . 9 (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹𝐴) = 𝐴)
1514biimpi 216 . . . . . . . 8 (𝐴 ⊆ ran 𝐹 → (ran 𝐹𝐴) = 𝐴)
16153ad2ant3 1135 . . . . . . 7 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (ran 𝐹𝐴) = 𝐴)
178fdmd 6757 . . . . . . 7 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → dom 𝐺 = 𝐴)
1816, 17eqtr4d 2783 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (ran 𝐹𝐴) = dom 𝐺)
1918reseq2d 6009 . . . . 5 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹𝐴)) = (𝐺 ↾ dom 𝐺))
208freld 6753 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → Rel 𝐺)
21 resdm 6055 . . . . . 6 (Rel 𝐺 → (𝐺 ↾ dom 𝐺) = 𝐺)
2220, 21syl 17 . . . . 5 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺 ↾ dom 𝐺) = 𝐺)
2319, 22eqtrd 2780 . . . 4 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹𝐴)) = 𝐺)
24 eqidd 2741 . . . 4 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → 𝐵 = 𝐵)
2523, 16, 24foeq123d 6855 . . 3 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → ((𝐺 ↾ (ran 𝐹𝐴)):(ran 𝐹𝐴)–onto𝐵𝐺:𝐴onto𝐵))
2613, 25sylibd 239 . 2 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → ((𝐺𝐹):(𝐹𝐴)–onto𝐵𝐺:𝐴onto𝐵))
27 simpr 484 . . . 4 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴onto𝐵) → 𝐺:𝐴onto𝐵)
28 simpl1 1191 . . . 4 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴onto𝐵) → Fun 𝐹)
29 simpl3 1193 . . . 4 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴onto𝐵) → 𝐴 ⊆ ran 𝐹)
30 focofo 6847 . . . 4 ((𝐺:𝐴onto𝐵 ∧ Fun 𝐹𝐴 ⊆ ran 𝐹) → (𝐺𝐹):(𝐹𝐴)–onto𝐵)
3127, 28, 29, 30syl3anc 1371 . . 3 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ 𝐺:𝐴onto𝐵) → (𝐺𝐹):(𝐹𝐴)–onto𝐵)
3231ex 412 . 2 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺:𝐴onto𝐵 → (𝐺𝐹):(𝐹𝐴)–onto𝐵))
3326, 32impbid 212 1 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → ((𝐺𝐹):(𝐹𝐴)–onto𝐵𝐺:𝐴onto𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  cin 3975  wss 3976  ccnv 5699  dom cdm 5700  ran crn 5701  cres 5702  cima 5703  ccom 5704  Rel wrel 5705  Fun wfun 6567  wf 6569  ontowfo 6571
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fo 6579  df-fv 6581
This theorem is referenced by:  fnfocofob  46994
  Copyright terms: Public domain W3C validator