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 6082 to extract the first member, op2ndb 6084 for an alternate version, and op2nd 7698 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 6081 | . . 3 ⊢ ran {〈𝐴, 𝐵〉} = {𝐵} |
3 | 2 | unieqi 4851 | . 2 ⊢ ∪ ran {〈𝐴, 𝐵〉} = ∪ {𝐵} |
4 | cnvsn.2 | . . 3 ⊢ 𝐵 ∈ V | |
5 | 4 | unisn 4858 | . 2 ⊢ ∪ {𝐵} = 𝐵 |
6 | 3, 5 | eqtri 2844 | 1 ⊢ ∪ ran {〈𝐴, 𝐵〉} = 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2114 Vcvv 3494 {csn 4567 〈cop 4573 ∪ cuni 4838 ran crn 5556 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 df-cnv 5563 df-dm 5565 df-rn 5566 |
This theorem is referenced by: elxp4 7627 elxp5 7628 op2nd 7698 fo2nd 7710 f2ndres 7714 ixpsnf1o 8502 xpassen 8611 xpdom2 8612 |
Copyright terms: Public domain | W3C validator |