| 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 5455 to extract the first member, op2nda 6231 for an alternate version, and op2nd 7996 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 6229 | . . . . . 6 ⊢ ◡{〈𝐴, 𝐵〉} = {〈𝐵, 𝐴〉} |
| 4 | 3 | inteqi 4917 | . . . . 5 ⊢ ∩ ◡{〈𝐴, 𝐵〉} = ∩ {〈𝐵, 𝐴〉} |
| 5 | opex 5447 | . . . . . 6 ⊢ 〈𝐵, 𝐴〉 ∈ V | |
| 6 | 5 | intsn 4950 | . . . . 5 ⊢ ∩ {〈𝐵, 𝐴〉} = 〈𝐵, 𝐴〉 |
| 7 | 4, 6 | eqtri 2786 | . . . 4 ⊢ ∩ ◡{〈𝐴, 𝐵〉} = 〈𝐵, 𝐴〉 |
| 8 | 7 | inteqi 4917 | . . 3 ⊢ ∩ ∩ ◡{〈𝐴, 𝐵〉} = ∩ 〈𝐵, 𝐴〉 |
| 9 | 8 | inteqi 4917 | . 2 ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = ∩ ∩ 〈𝐵, 𝐴〉 |
| 10 | 2, 1 | op1stb 5455 | . 2 ⊢ ∩ ∩ 〈𝐵, 𝐴〉 = 𝐵 |
| 11 | 9, 10 | eqtri 2786 | 1 ⊢ ∩ ∩ ∩ ◡{〈𝐴, 𝐵〉} = 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 Vcvv 3455 {csn 4590 〈cop 4596 ∩ cint 4913 ◡ccnv 5662 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-int 4914 df-br 5111 df-opab 5175 df-xp 5669 df-rel 5670 df-cnv 5671 |
| This theorem is referenced by: 2ndval2 8005 |
| Copyright terms: Public domain | W3C validator |