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

Theorem rnco 2571
Description: Range of a composition.
Assertion
Ref Expression
rnco |- ran (A o. B) (_ ran A

Proof of Theorem rnco
StepHypRef Expression
1 dmco 2570 . 2 |- dom (`'B o. `'A) (_ dom `'A
2 df-rn 2429 . . 3 |- ran (A o. B) = dom `'(A o. B)
3 cnvco 2520 . . . 4 |- `'(A o. B) = (`'B o. `'A)
43dmeqi 2532 . . 3 |- dom `'(A o. B) = dom (`'B o. `'A)
52, 4eqtr 1119 . 2 |- ran (A o. B) = dom (`'B o. `'A)
6 df-rn 2429 . 2 |- ran A = dom `'A
71, 5, 63sstr4 1539 1 |- ran (A o. B) (_ ran A
Colors of variables: wff set class
Syntax hints:   (_ wss 1487  `'ccnv 2409  dom cdm 2410  ran crn 2411   o. ccom 2414
This theorem is referenced by:  coexg 2671  fco 2760  pjss1co 5633  pj3 5660
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-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-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429
metamath.org