| 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 5451 to extract the first member, op2nda 6222 for an alternate version, and op2nd 8002 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 6220 | . . . . . 6 ⊢ ◡{〈𝐴, 𝐵〉} = {〈𝐵, 𝐴〉} |
| 4 | 3 | inteqi 4931 | . . . . 5 ⊢ ∩ ◡{〈𝐴, 𝐵〉} = ∩ {〈𝐵, 𝐴〉} |
| 5 | opex 5444 | . . . . . 6 ⊢ 〈𝐵, 𝐴〉 ∈ V | |
| 6 | 5 | intsn 4965 | . . . . 5 ⊢ ∩ {〈𝐵, 𝐴〉} = 〈𝐵, 𝐴〉 |
| 7 | 4, 6 | eqtri 2759 | . . . 4 ⊢ ∩ ◡{〈𝐴, 𝐵〉} = 〈𝐵, 𝐴〉 |
| 8 | 7 | inteqi 4931 | . . 3 ⊢ ∩ ∩ ◡{〈𝐴, 𝐵〉} = ∩ 〈𝐵, 𝐴〉 |
| 9 | 8 | inteqi 4931 | . 2 ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = ∩ ∩ 〈𝐵, 𝐴〉 |
| 10 | 2, 1 | op1stb 5451 | . 2 ⊢ ∩ ∩ 〈𝐵, 𝐴〉 = 𝐵 |
| 11 | 9, 10 | eqtri 2759 | 1 ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 Vcvv 3464 {csn 4606 〈cop 4612 ∩ cint 4927 ◡ccnv 5658 |
| 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 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| 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 2715 df-cleq 2728 df-clel 2810 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-int 4928 df-br 5125 df-opab 5187 df-xp 5665 df-rel 5666 df-cnv 5667 |
| This theorem is referenced by: 2ndval2 8011 |
| Copyright terms: Public domain | W3C validator |