Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > df1stres | Structured version Visualization version GIF version |
Description: Definition for a restriction of the 1st (first member of an ordered pair) function. (Contributed by Thierry Arnoux, 27-Sep-2017.) |
Ref | Expression |
---|---|
df1stres | ⊢ (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df1st2 7909 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} = (1st ↾ (V × V)) | |
2 | 1 | reseq1i 5876 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) |
3 | resoprab 7370 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} | |
4 | resres 5893 | . . . 4 ⊢ ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) | |
5 | incom 4131 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵)) | |
6 | xpss 5596 | . . . . . . 7 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
7 | df-ss 3900 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)) | |
8 | 6, 7 | mpbi 229 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵) |
9 | 5, 8 | eqtr3i 2768 | . . . . 5 ⊢ ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵) |
10 | 9 | reseq2i 5877 | . . . 4 ⊢ (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (1st ↾ (𝐴 × 𝐵)) |
11 | 4, 10 | eqtri 2766 | . . 3 ⊢ ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ (𝐴 × 𝐵)) |
12 | 2, 3, 11 | 3eqtr3ri 2775 | . 2 ⊢ (1st ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} |
13 | df-mpo 7260 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} | |
14 | 12, 13 | eqtr4i 2769 | 1 ⊢ (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∩ cin 3882 ⊆ wss 3883 × cxp 5578 ↾ cres 5582 {coprab 7256 ∈ cmpo 7257 1st c1st 7802 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fo 6424 df-fv 6426 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 |
This theorem is referenced by: cnre2csqima 31763 |
Copyright terms: Public domain | W3C validator |