![]() |
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 6049 to extract the first member, op2ndb 6051 for an alternate version, and op2nd 7680 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 6048 | . . 3 ⊢ ran {〈𝐴, 𝐵〉} = {𝐵} |
3 | 2 | unieqi 4813 | . 2 ⊢ ∪ ran {〈𝐴, 𝐵〉} = ∪ {𝐵} |
4 | cnvsn.2 | . . 3 ⊢ 𝐵 ∈ V | |
5 | 4 | unisn 4820 | . 2 ⊢ ∪ {𝐵} = 𝐵 |
6 | 3, 5 | eqtri 2821 | 1 ⊢ ∪ ran {〈𝐴, 𝐵〉} = 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 Vcvv 3441 {csn 4525 〈cop 4531 ∪ cuni 4800 ran crn 5520 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 df-dm 5529 df-rn 5530 |
This theorem is referenced by: elxp4 7609 elxp5 7610 op2nd 7680 fo2nd 7692 f2ndres 7696 ixpsnf1o 8485 xpassen 8594 xpdom2 8595 |
Copyright terms: Public domain | W3C validator |