![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dmco | Structured version Visualization version GIF version |
Description: The domain of a composition. Exercise 27 of [Enderton] p. 53. (Contributed by NM, 4-Feb-2004.) |
Ref | Expression |
---|---|
dmco | ⊢ dom (𝐴 ∘ 𝐵) = (◡𝐵 “ dom 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfdm4 5519 | . 2 ⊢ dom (𝐴 ∘ 𝐵) = ran ◡(𝐴 ∘ 𝐵) | |
2 | cnvco 5511 | . . 3 ⊢ ◡(𝐴 ∘ 𝐵) = (◡𝐵 ∘ ◡𝐴) | |
3 | 2 | rneqi 5555 | . 2 ⊢ ran ◡(𝐴 ∘ 𝐵) = ran (◡𝐵 ∘ ◡𝐴) |
4 | rnco2 5861 | . . 3 ⊢ ran (◡𝐵 ∘ ◡𝐴) = (◡𝐵 “ ran ◡𝐴) | |
5 | dfdm4 5519 | . . . 4 ⊢ dom 𝐴 = ran ◡𝐴 | |
6 | 5 | imaeq2i 5681 | . . 3 ⊢ (◡𝐵 “ dom 𝐴) = (◡𝐵 “ ran ◡𝐴) |
7 | 4, 6 | eqtr4i 2824 | . 2 ⊢ ran (◡𝐵 ∘ ◡𝐴) = (◡𝐵 “ dom 𝐴) |
8 | 1, 3, 7 | 3eqtri 2825 | 1 ⊢ dom (𝐴 ∘ 𝐵) = (◡𝐵 “ dom 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1653 ◡ccnv 5311 dom cdm 5312 ran crn 5313 “ cima 5315 ∘ ccom 5316 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-sep 4975 ax-nul 4983 ax-pr 5097 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ral 3094 df-rex 3095 df-rab 3098 df-v 3387 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-sn 4369 df-pr 4371 df-op 4375 df-br 4844 df-opab 4906 df-xp 5318 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 |
This theorem is referenced by: curry1 7506 curry2 7509 smobeth 9696 hashkf 13372 imasless 16515 ofco2 20583 fcoinver 29935 xppreima 29968 smatrcl 30378 fco3 40172 |
Copyright terms: Public domain | W3C validator |