![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > df2ndres | Structured version Visualization version GIF version |
Description: Definition for a restriction of the 2nd (second member of an ordered pair) function. (Contributed by Thierry Arnoux, 27-Sep-2017.) |
Ref | Expression |
---|---|
df2ndres | ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df2nd2 7595 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} = (2nd ↾ (V × V)) | |
2 | 1 | reseq1i 5684 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} ↾ (𝐴 × 𝐵)) = ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) |
3 | resoprab 7080 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} | |
4 | resres 5705 | . . . 4 ⊢ ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (2nd ↾ ((V × V) ∩ (𝐴 × 𝐵))) | |
5 | incom 4062 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵)) | |
6 | xpss 5416 | . . . . . . 7 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
7 | df-ss 3839 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)) | |
8 | 6, 7 | mpbi 222 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵) |
9 | 5, 8 | eqtr3i 2798 | . . . . 5 ⊢ ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵) |
10 | 9 | reseq2i 5685 | . . . 4 ⊢ (2nd ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (2nd ↾ (𝐴 × 𝐵)) |
11 | 4, 10 | eqtri 2796 | . . 3 ⊢ ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (2nd ↾ (𝐴 × 𝐵)) |
12 | 2, 3, 11 | 3eqtr3ri 2805 | . 2 ⊢ (2nd ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} |
13 | df-mpo 6975 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} | |
14 | 12, 13 | eqtr4i 2799 | 1 ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 387 = wceq 1507 ∈ wcel 2048 Vcvv 3409 ∩ cin 3824 ⊆ wss 3825 × cxp 5398 ↾ cres 5402 {coprab 6971 ∈ cmpo 6972 2nd c2nd 7493 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1964 ax-8 2050 ax-9 2057 ax-10 2077 ax-11 2091 ax-12 2104 ax-13 2299 ax-ext 2745 ax-sep 5054 ax-nul 5061 ax-pow 5113 ax-pr 5180 ax-un 7273 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2014 df-mo 2544 df-eu 2580 df-clab 2754 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ral 3087 df-rex 3088 df-rab 3091 df-v 3411 df-sbc 3678 df-dif 3828 df-un 3830 df-in 3832 df-ss 3839 df-nul 4174 df-if 4345 df-sn 4436 df-pr 4438 df-op 4442 df-uni 4707 df-br 4924 df-opab 4986 df-mpt 5003 df-id 5305 df-xp 5406 df-rel 5407 df-cnv 5408 df-co 5409 df-dm 5410 df-rn 5411 df-res 5412 df-iota 6146 df-fun 6184 df-fn 6185 df-f 6186 df-fo 6188 df-fv 6190 df-oprab 6974 df-mpo 6975 df-1st 7494 df-2nd 7495 |
This theorem is referenced by: cnre2csqima 30755 |
Copyright terms: Public domain | W3C validator |