Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  df1stres Structured version   Visualization version   GIF version

Theorem df1stres 33394
Description: Definition for a restriction of the 1st (first member of an ordered pair) function. (Contributed by Thierry Arnoux, 27-Sep-2017.)
Assertion
Ref Expression
df1stres (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem df1stres
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df1st2 8146 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑥} = (1st ↾ (V × V))
21reseq1i 5982 . . 3 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵))
3 resoprab 7569 . . 3 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)}
4 resres 5999 . . . 4 ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ ((V × V) ∩ (𝐴 × 𝐵)))
5 incom 4109 . . . . . 6 ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵))
6 xpss 5674 . . . . . . 7 (𝐴 × 𝐵) ⊆ (V × V)
7 dfss2 4097 . . . . . . 7 ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵))
86, 7mpbi 233 . . . . . 6 ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)
95, 8eqtr3i 2788 . . . . 5 ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵)
109reseq2i 5983 . . . 4 (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (1st ↾ (𝐴 × 𝐵))
114, 10eqtri 2786 . . 3 ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ (𝐴 × 𝐵))
122, 3, 113eqtr3ri 2795 . 2 (1st ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)}
13 df-mpo 7456 . 2 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝑥)}
1412, 13eqtr4i 2789 1 (1st ↾ (𝐴 × 𝐵)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   × cxp 5656   ↾ cres 5660  {coprab 7452   ∈ cmpo 7453  1st c1st 8033
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fo 6572  df-fv 6574  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036
This theorem is used by:  cnre2csqima  34654
  Copyright terms: Public domain W3C validator