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 47095
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 6766 . . . . . . . 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 2736 . . . . 5 (ran 𝐹𝐴) = (ran 𝐹𝐴)
6 eqid 2736 . . . . 5 (𝐹𝐴) = (𝐹𝐴)
7 eqid 2736 . . . . 5 (𝐹 ↾ (𝐹𝐴)) = (𝐹 ↾ (𝐹𝐴))
8 simp2 1137 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → 𝐺:𝐴𝐵)
98adantr 480 . . . . 5 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → 𝐺:𝐴𝐵)
10 eqid 2736 . . . . 5 (𝐺 ↾ (ran 𝐹𝐴)) = (𝐺 ↾ (ran 𝐹𝐴))
11 simpr 484 . . . . 5 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → (𝐺𝐹):(𝐹𝐴)–onto𝐵)
124, 5, 6, 7, 9, 10, 11fcoresfo 47088 . . . 4 (((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) ∧ (𝐺𝐹):(𝐹𝐴)–onto𝐵) → (𝐺 ↾ (ran 𝐹𝐴)):(ran 𝐹𝐴)–onto𝐵)
1312ex 412 . . 3 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → ((𝐺𝐹):(𝐹𝐴)–onto𝐵 → (𝐺 ↾ (ran 𝐹𝐴)):(ran 𝐹𝐴)–onto𝐵))
14 sseqin2 4222 . . . . . . . . 9 (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹𝐴) = 𝐴)
1514biimpi 216 . . . . . . . 8 (𝐴 ⊆ ran 𝐹 → (ran 𝐹𝐴) = 𝐴)
16153ad2ant3 1135 . . . . . . 7 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (ran 𝐹𝐴) = 𝐴)
178fdmd 6745 . . . . . . 7 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → dom 𝐺 = 𝐴)
1816, 17eqtr4d 2779 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (ran 𝐹𝐴) = dom 𝐺)
1918reseq2d 5996 . . . . 5 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹𝐴)) = (𝐺 ↾ dom 𝐺))
208freld 6741 . . . . . 6 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → Rel 𝐺)
21 resdm 6043 . . . . . 6 (Rel 𝐺 → (𝐺 ↾ dom 𝐺) = 𝐺)
2220, 21syl 17 . . . . 5 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺 ↾ dom 𝐺) = 𝐺)
2319, 22eqtrd 2776 . . . 4 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → (𝐺 ↾ (ran 𝐹𝐴)) = 𝐺)
24 eqidd 2737 . . . 4 ((Fun 𝐹𝐺:𝐴𝐵𝐴 ⊆ ran 𝐹) → 𝐵 = 𝐵)
2523, 16, 24foeq123d 6840 . . 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 6832 . . . 4 ((𝐺:𝐴onto𝐵 ∧ Fun 𝐹𝐴 ⊆ ran 𝐹) → (𝐺𝐹):(𝐹𝐴)–onto𝐵)
3127, 28, 29, 30syl3anc 1372 . . 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 1086   = wceq 1539  cin 3949  wss 3950  ccnv 5683  dom cdm 5684  ran crn 5685  cres 5686  cima 5687  ccom 5688  Rel wrel 5689  Fun wfun 6554  wf 6556  ontowfo 6558
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-fo 6566  df-fv 6568
This theorem is referenced by:  fnfocofob  47096
  Copyright terms: Public domain W3C validator