| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1rn | Structured version Visualization version GIF version | ||
| Description: The range of a singleton word. (Contributed by Mario Carneiro, 18-Jul-2016.) |
| Ref | Expression |
|---|---|
| s1rn | ⊢ (𝐴 ∈ 𝑉 → ran 〈“𝐴”〉 = {𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s1val 14748 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) | |
| 2 | 1 | rneqd 5919 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 〈“𝐴”〉 = ran {〈0, 𝐴〉}) |
| 3 | c0ex 11303 | . . 3 ⊢ 0 ∈ V | |
| 4 | 3 | rnsnop 6225 | . 2 ⊢ ran {〈0, 𝐴〉} = {𝐴} |
| 5 | 2, 4 | eqtrdi 2811 | 1 ⊢ (𝐴 ∈ 𝑉 → ran 〈“𝐴”〉 = {𝐴}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 {csn 4584 〈cop 4834 ran crn 5651 0cc0 11203 〈“cs1 14745 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-mulcl 11265 ax-i2m1 11271 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-iota 6494 df-fun 6540 df-fv 6546 df-s1 14746 |
| This theorem is used by: s2rn 15121 s3rn 15122 s7rn 15123 cycpmco2f1 33731 cycpmco2rn 33732 unitprodclb 33990 mrsubvrs 36373 |
| Copyright terms: Public domain | W3C validator |