| 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 8112 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} = (2nd ↾ (V × V)) | |
| 2 | 1 | reseq1i 5965 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} ↾ (𝐴 × 𝐵)) = ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) |
| 3 | resoprab 7538 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} | |
| 4 | resres 5982 | . . . 4 ⊢ ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (2nd ↾ ((V × V) ∩ (𝐴 × 𝐵))) | |
| 5 | incom 4106 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵)) | |
| 6 | xpss 5666 | . . . . . . 7 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
| 7 | dfss2 4094 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)) | |
| 8 | 6, 7 | mpbi 233 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵) |
| 9 | 5, 8 | eqtr3i 2785 | . . . . 5 ⊢ ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵) |
| 10 | 9 | reseq2i 5966 | . . . 4 ⊢ (2nd ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (2nd ↾ (𝐴 × 𝐵)) |
| 11 | 4, 10 | eqtri 2783 | . . 3 ⊢ ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (2nd ↾ (𝐴 × 𝐵)) |
| 12 | 2, 3, 11 | 3eqtr3ri 2792 | . 2 ⊢ (2nd ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} |
| 13 | df-mpo 7425 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} | |
| 14 | 12, 13 | eqtr4i 2786 | 1 ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3895 ∩ cin 4089 × cxp 5648 ↾ cres 5652 {coprab 7421 ∈ cmpo 7422 2nd c2nd 8000 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 |
| This theorem is used by: cnre2csqima 34589 |
| Copyright terms: Public domain | W3C validator |