| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > op2nda | Structured version Visualization version GIF version | ||
| Description: Extract the second member of an ordered pair. (See op1sta 6221 to extract the first member, op2ndb 6223 for an alternate version, and op2nd 7995 for the preferred version.) (Contributed by NM, 17-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
| Ref | Expression |
|---|---|
| cnvsn.1 | ⊢ 𝐴 ∈ V |
| cnvsn.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| op2nda | ⊢ ∪ ran {〈𝐴, 𝐵〉} = 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvsn.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | 1 | rnsnop 6220 | . . 3 ⊢ ran {〈𝐴, 𝐵〉} = {𝐵} |
| 3 | 2 | unieqi 4879 | . 2 ⊢ ∪ ran {〈𝐴, 𝐵〉} = ∪ {𝐵} |
| 4 | cnvsn.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 5 | 4 | unisn 4886 | . 2 ⊢ ∪ {𝐵} = 𝐵 |
| 6 | 3, 5 | eqtri 2783 | 1 ⊢ ∪ ran {〈𝐴, 𝐵〉} = 𝐵 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 Vcvv 3450 {csn 4584 〈cop 4590 ∪ cuni 4867 ran crn 5656 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-xp 5661 df-rel 5662 df-cnv 5663 df-dm 5665 df-rn 5666 |
| This theorem is used by: elxp4 7919 elxp5 7920 op2nd 7995 fo2nd 8007 f2ndres 8011 ixpsnf1o 8945 xpassen 9069 xpdom2 9070 |
| Copyright terms: Public domain | W3C validator |