| 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 6198 to extract the first member, op2ndb 6200 for an alternate version, and op2nd 7977 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 6197 | . . 3 ⊢ ran {〈𝐴, 𝐵〉} = {𝐵} |
| 3 | 2 | unieqi 4883 | . 2 ⊢ ∪ ran {〈𝐴, 𝐵〉} = ∪ {𝐵} |
| 4 | cnvsn.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 5 | 4 | unisn 4890 | . 2 ⊢ ∪ {𝐵} = 𝐵 |
| 6 | 3, 5 | eqtri 2752 | 1 ⊢ ∪ ran {〈𝐴, 𝐵〉} = 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 Vcvv 3447 {csn 4589 〈cop 4595 ∪ cuni 4871 ran crn 5639 |
| 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 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| 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 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-xp 5644 df-rel 5645 df-cnv 5646 df-dm 5648 df-rn 5649 |
| This theorem is referenced by: elxp4 7898 elxp5 7899 op2nd 7977 fo2nd 7989 f2ndres 7993 ixpsnf1o 8911 xpassen 9035 xpdom2 9036 |
| Copyright terms: Public domain | W3C validator |