| 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 8095 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} = (1st ↾ (V × V)) | |
| 2 | 1 | reseq1i 5968 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) |
| 3 | resoprab 7531 | . . 3 ⊢ ({〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} | |
| 4 | resres 5985 | . . . 4 ⊢ ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) | |
| 5 | incom 4155 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵)) | |
| 6 | xpss 5671 | . . . . . . 7 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
| 7 | dfss2 3917 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)) | |
| 8 | 6, 7 | mpbi 233 | . . . . . 6 ⊢ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵) |
| 9 | 5, 8 | eqtr3i 2785 | . . . . 5 ⊢ ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵) |
| 10 | 9 | reseq2i 5969 | . . . 4 ⊢ (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (1st ↾ (𝐴 × 𝐵)) |
| 11 | 4, 10 | eqtri 2783 | . . 3 ⊢ ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ (𝐴 × 𝐵)) |
| 12 | 2, 3, 11 | 3eqtr3ri 2792 | . 2 ⊢ (1st ↾ (𝐴 × 𝐵)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} |
| 13 | df-mpo 7418 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)} | |
| 14 | 12, 13 | eqtr4i 2786 | 1 ⊢ (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∩ cin 3898 ⊆ wss 3899 × cxp 5653 ↾ cres 5657 {coprab 7414 ∈ cmpo 7415 1st c1st 7984 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| 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 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 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 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fo 6539 df-fv 6541 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 |
| This theorem is used by: cnre2csqima 34421 |
| Copyright terms: Public domain | W3C validator |