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 7938 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} = (1st ↾ (V × V)) | |
2 | 1 | reseq1i 5887 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) |
3 | resoprab 7392 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} | |
4 | resres 5904 | . . . 4 ⊢ ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) | |
5 | incom 4135 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵)) | |
6 | xpss 5605 | . . . . . . 7 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
7 | df-ss 3904 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)) | |
8 | 6, 7 | mpbi 229 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵) |
9 | 5, 8 | eqtr3i 2768 | . . . . 5 ⊢ ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵) |
10 | 9 | reseq2i 5888 | . . . 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 7280 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} | |
14 | 12, 13 | eqtr4i 2769 | 1 ⊢ (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∩ cin 3886 ⊆ wss 3887 × cxp 5587 ↾ cres 5591 {coprab 7276 ∈ cmpo 7277 1st c1st 7829 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-fo 6439 df-fv 6441 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 |
This theorem is referenced by: cnre2csqima 31861 |
Copyright terms: Public domain | W3C validator |