![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rnin | Structured version Visualization version GIF version |
Description: The range of an intersection belongs the intersection of ranges. Theorem 9 of [Suppes] p. 60. (Contributed by NM, 15-Sep-2004.) |
Ref | Expression |
---|---|
rnin | ⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnvin 6144 | . . . 4 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵) | |
2 | 1 | dmeqi 5904 | . . 3 ⊢ dom ◡(𝐴 ∩ 𝐵) = dom (◡𝐴 ∩ ◡𝐵) |
3 | dmin 5911 | . . 3 ⊢ dom (◡𝐴 ∩ ◡𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵) | |
4 | 2, 3 | eqsstri 4016 | . 2 ⊢ dom ◡(𝐴 ∩ 𝐵) ⊆ (dom ◡𝐴 ∩ dom ◡𝐵) |
5 | df-rn 5687 | . 2 ⊢ ran (𝐴 ∩ 𝐵) = dom ◡(𝐴 ∩ 𝐵) | |
6 | df-rn 5687 | . . 3 ⊢ ran 𝐴 = dom ◡𝐴 | |
7 | df-rn 5687 | . . 3 ⊢ ran 𝐵 = dom ◡𝐵 | |
8 | 6, 7 | ineq12i 4210 | . 2 ⊢ (ran 𝐴 ∩ ran 𝐵) = (dom ◡𝐴 ∩ dom ◡𝐵) |
9 | 4, 5, 8 | 3sstr4i 4025 | 1 ⊢ ran (𝐴 ∩ 𝐵) ⊆ (ran 𝐴 ∩ ran 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ∩ cin 3947 ⊆ wss 3948 ◡ccnv 5675 dom cdm 5676 ran crn 5677 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-xp 5682 df-rel 5683 df-cnv 5684 df-dm 5686 df-rn 5687 |
This theorem is referenced by: inimass 6154 restutop 23741 |
Copyright terms: Public domain | W3C validator |