| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > op2ndb | Structured version Visualization version GIF version | ||
| Description: Extract the second member of an ordered pair. Theorem 5.12(ii) of [Monk1] p. 52. (See op1stb 5419 to extract the first member, op2nda 6186 for an alternate version, and op2nd 7944 for the preferred version.) (Contributed by NM, 25-Nov-2003.) |
| Ref | Expression |
|---|---|
| cnvsn.1 | ⊢ 𝐴 ∈ V |
| cnvsn.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| op2ndb | ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvsn.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
| 2 | cnvsn.2 | . . . . . . 7 ⊢ 𝐵 ∈ V | |
| 3 | 1, 2 | cnvsn 6184 | . . . . . 6 ⊢ ◡{〈𝐴, 𝐵〉} = {〈𝐵, 𝐴〉} |
| 4 | 3 | inteqi 4894 | . . . . 5 ⊢ ∩ ◡{〈𝐴, 𝐵〉} = ∩ {〈𝐵, 𝐴〉} |
| 5 | opex 5411 | . . . . . 6 ⊢ 〈𝐵, 𝐴〉 ∈ V | |
| 6 | 5 | intsn 4927 | . . . . 5 ⊢ ∩ {〈𝐵, 𝐴〉} = 〈𝐵, 𝐴〉 |
| 7 | 4, 6 | eqtri 2760 | . . . 4 ⊢ ∩ ◡{〈𝐴, 𝐵〉} = 〈𝐵, 𝐴〉 |
| 8 | 7 | inteqi 4894 | . . 3 ⊢ ∩ ∩ ◡{〈𝐴, 𝐵〉} = ∩ 〈𝐵, 𝐴〉 |
| 9 | 8 | inteqi 4894 | . 2 ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = ∩ ∩ 〈𝐵, 𝐴〉 |
| 10 | 2, 1 | op1stb 5419 | . 2 ⊢ ∩ ∩ 〈𝐵, 𝐴〉 = 𝐵 |
| 11 | 9, 10 | eqtri 2760 | 1 ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 Vcvv 3430 {csn 4568 〈cop 4574 ∩ cint 4890 ◡ccnv 5623 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-int 4891 df-br 5087 df-opab 5149 df-xp 5630 df-rel 5631 df-cnv 5632 |
| This theorem is referenced by: 2ndval2 7953 |
| Copyright terms: Public domain | W3C validator |