| 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 14534 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 〈“𝐴”〉 = {〈0, 𝐴〉}) | |
| 2 | 1 | rneqd 5895 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 〈“𝐴”〉 = ran {〈0, 𝐴〉}) |
| 3 | c0ex 11138 | . . 3 ⊢ 0 ∈ V | |
| 4 | 3 | rnsnop 6190 | . 2 ⊢ ran {〈0, 𝐴〉} = {𝐴} |
| 5 | 2, 4 | eqtrdi 2788 | 1 ⊢ (𝐴 ∈ 𝑉 → ran 〈“𝐴”〉 = {𝐴}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {csn 4582 〈cop 4588 ran crn 5633 0cc0 11038 〈“cs1 14531 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-pr 5379 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-mulcl 11100 ax-i2m1 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-iota 6456 df-fun 6502 df-fv 6508 df-s1 14532 |
| This theorem is referenced by: s2rn 14898 s3rn 14899 s7rn 14900 cycpmco2f1 33217 cycpmco2rn 33218 unitprodclb 33481 mrsubvrs 35735 |
| Copyright terms: Public domain | W3C validator |