Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rnsnopg | Structured version Visualization version GIF version |
Description: The range of a singleton of an ordered pair is the singleton of the second member. (Contributed by NM, 24-Jul-2004.) (Revised by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
rnsnopg | ⊢ (𝐴 ∈ 𝑉 → ran {〈𝐴, 𝐵〉} = {𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rn 5561 | . . 3 ⊢ ran {〈𝐴, 𝐵〉} = dom ◡{〈𝐴, 𝐵〉} | |
2 | dfdm4 5759 | . . . 4 ⊢ dom {〈𝐵, 𝐴〉} = ran ◡{〈𝐵, 𝐴〉} | |
3 | df-rn 5561 | . . . 4 ⊢ ran ◡{〈𝐵, 𝐴〉} = dom ◡◡{〈𝐵, 𝐴〉} | |
4 | cnvcnvsn 6071 | . . . . 5 ⊢ ◡◡{〈𝐵, 𝐴〉} = ◡{〈𝐴, 𝐵〉} | |
5 | 4 | dmeqi 5768 | . . . 4 ⊢ dom ◡◡{〈𝐵, 𝐴〉} = dom ◡{〈𝐴, 𝐵〉} |
6 | 2, 3, 5 | 3eqtri 2848 | . . 3 ⊢ dom {〈𝐵, 𝐴〉} = dom ◡{〈𝐴, 𝐵〉} |
7 | 1, 6 | eqtr4i 2847 | . 2 ⊢ ran {〈𝐴, 𝐵〉} = dom {〈𝐵, 𝐴〉} |
8 | dmsnopg 6065 | . 2 ⊢ (𝐴 ∈ 𝑉 → dom {〈𝐵, 𝐴〉} = {𝐵}) | |
9 | 7, 8 | syl5eq 2868 | 1 ⊢ (𝐴 ∈ 𝑉 → ran {〈𝐴, 𝐵〉} = {𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 {csn 4561 〈cop 4567 ◡ccnv 5549 dom cdm 5550 ran crn 5551 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pr 5322 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-br 5060 df-opab 5122 df-xp 5556 df-rel 5557 df-cnv 5558 df-dm 5560 df-rn 5561 |
This theorem is referenced by: rnpropg 6074 rnsnop 6076 funcnvpr 6411 funcnvtp 6412 dprdsn 19152 usgr1e 27021 1loopgredg 27277 1egrvtxdg0 27287 uspgrloopedg 27294 cosnopne 30424 noextend 33168 rnsnf 41436 |
Copyright terms: Public domain | W3C validator |