| 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 6214 to extract the first member, op2ndb 6216 for an alternate version, and op2nd 7997 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 6213 | . . 3 ⊢ ran {〈𝐴, 𝐵〉} = {𝐵} |
| 3 | 2 | unieqi 4895 | . 2 ⊢ ∪ ran {〈𝐴, 𝐵〉} = ∪ {𝐵} |
| 4 | cnvsn.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 5 | 4 | unisn 4902 | . 2 ⊢ ∪ {𝐵} = 𝐵 |
| 6 | 3, 5 | eqtri 2758 | 1 ⊢ ∪ ran {〈𝐴, 𝐵〉} = 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2108 Vcvv 3459 {csn 4601 〈cop 4607 ∪ cuni 4883 ran crn 5655 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-xp 5660 df-rel 5661 df-cnv 5662 df-dm 5664 df-rn 5665 |
| This theorem is referenced by: elxp4 7918 elxp5 7919 op2nd 7997 fo2nd 8009 f2ndres 8013 ixpsnf1o 8952 xpassen 9080 xpdom2 9081 |
| Copyright terms: Public domain | W3C validator |