HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem fco 2760
Description: Composition of two mappings.
Assertion
Ref Expression
fco |- ((F:B-->C /\ G:A-->B) -> (F o. G):A-->C)

Proof of Theorem fco
StepHypRef Expression
1 funco 2696 . . . . . 6 |- ((Fun F /\ Fun G) -> Fun (F o. G))
2 ffun 2754 . . . . . 6 |- (F:B-->C -> Fun F)
3 ffun 2754 . . . . . 6 |- (G:A-->B -> Fun G)
41, 2, 3syl2an 349 . . . . 5 |- ((F:B-->C /\ G:A-->B) -> Fun (F o. G))
5 fdm 2756 . . . . . . . . . 10 |- (F:B-->C -> dom F = B)
65sseq2d 1528 . . . . . . . . 9 |- (F:B-->C -> (ran G (_ dom F <-> ran G (_ B))
7 frn 2757 . . . . . . . . 9 |- (G:A-->B -> ran G (_ B)
86, 7syl5bir 184 . . . . . . . 8 |- (F:B-->C -> (G:A-->B -> ran G (_ dom F))
98imp 277 . . . . . . 7 |- ((F:B-->C /\ G:A-->B) -> ran G (_ dom F)
10 dmcosseq 2572 . . . . . . 7 |- (ran G (_ dom F -> dom (F o. G) = dom G)
119, 10syl 12 . . . . . 6 |- ((F:B-->C /\ G:A-->B) -> dom (F o. G) = dom G)
12 fdm 2756 . . . . . . 7 |- (G:A-->B -> dom G = A)
1312adantl 305 . . . . . 6 |- ((F:B-->C /\ G:A-->B) -> dom G = A)
1411, 13eqtrd 1128 . . . . 5 |- ((F:B-->C /\ G:A-->B) -> dom (F o. G) = A)
154, 14jca 236 . . . 4 |- ((F:B-->C /\ G:A-->B) -> (Fun (F o. G) /\ dom (F o. G) = A))
16 df-fn 2433 . . . 4 |- ((F o. G) Fn A <-> (Fun (F o. G) /\ dom (F o. G) = A))
1715, 16sylibr 175 . . 3 |- ((F:B-->C /\ G:A-->B) -> (F o. G) Fn A)
18 rnco 2571 . . . . 5 |- ran (F o. G) (_ ran F
19 sstr2 1510 . . . . . 6 |- (ran (F o. G) (_ ran F -> (ran F (_ C -> ran (F o. G) (_ C))
20 frn 2757 . . . . . 6 |- (F:B-->C -> ran F (_ C)
2119, 20syl5 22 . . . . 5 |- (ran (F o. G) (_ ran F -> (F:B-->C -> ran (F o. G) (_ C))
2218, 21ax-mp 6 . . . 4 |- (F:B-->C -> ran (F o. G) (_ C)
2322adantr 306 . . 3 |- ((F:B-->C /\ G:A-->B) -> ran (F o. G) (_ C)
2417, 23jca 236 . 2 |- ((F:B-->C /\ G:A-->B) -> ((F o. G) Fn A /\ ran (F o. G) (_ C))
25 df-f 2434 . 2 |- ((F o. G):A-->C <-> ((F o. G) Fn A /\ ran (F o. G) (_ C))
2624, 25sylibr 175 1 |- ((F:B-->C /\ G:A-->B) -> (F o. G):A-->C)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196   = wceq 1091   (_ wss 1487  dom cdm 2410  ran crn 2411   o. ccom 2414  Fun wfun 2416   Fn wfn 2417  -->wf 2418
This theorem is referenced by:  f1co 2783  mapenlem1 3384  mapenlem2 3385  ac6lem 3575  ruclem17 4901  hocof 5600
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-fun 2432  df-fn 2433  df-f 2434
metamath.org