| 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 8099 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} = (2nd ↾ (V × V)) | |
| 2 | 1 | reseq1i 5966 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} ↾ (𝐴 × 𝐵)) = ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) |
| 3 | resoprab 7530 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑦} ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} | |
| 4 | resres 5983 | . . . 4 ⊢ ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (2nd ↾ ((V × V) ∩ (𝐴 × 𝐵))) | |
| 5 | incom 4155 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵)) | |
| 6 | xpss 5667 | . . . . . . 7 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
| 7 | dfss2 3917 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)) | |
| 8 | 6, 7 | mpbi 233 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵) |
| 9 | 5, 8 | eqtr3i 2786 | . . . . 5 ⊢ ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵) |
| 10 | 9 | reseq2i 5967 | . . . 4 ⊢ (2nd ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (2nd ↾ (𝐴 × 𝐵)) |
| 11 | 4, 10 | eqtri 2784 | . . 3 ⊢ ((2nd ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (2nd ↾ (𝐴 × 𝐵)) |
| 12 | 2, 3, 11 | 3eqtr3ri 2793 | . 2 ⊢ (2nd ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} |
| 13 | df-mpo 7417 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑦)} | |
| 14 | 12, 13 | eqtr4i 2787 | 1 ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 × cxp 5649 ↾ cres 5653 {coprab 7413 ∈ cmpo 7414 2nd c2nd 7989 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fo 6537 df-fv 6539 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 |
| This theorem is used by: cnre2csqima 34525 |
| Copyright terms: Public domain | W3C validator |