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

Theorem df1stres 28864
 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 7150 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑥} = (1st ↾ (V × V))
21reseq1i 5313 . . 3 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵))
3 resoprab 6654 . . 3 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑧 = 𝑥} ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝑥)}
4 resres 5329 . . . 4 ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ ((V × V) ∩ (𝐴 × 𝐵)))
5 incom 3767 . . . . . 6 ((𝐴 × 𝐵) ∩ (V × V)) = ((V × V) ∩ (𝐴 × 𝐵))
6 xpss 5149 . . . . . . 7 (𝐴 × 𝐵) ⊆ (V × V)
7 df-ss 3554 . . . . . . 7 ((𝐴 × 𝐵) ⊆ (V × V) ↔ ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵))
86, 7mpbi 219 . . . . . 6 ((𝐴 × 𝐵) ∩ (V × V)) = (𝐴 × 𝐵)
95, 8eqtr3i 2634 . . . . 5 ((V × V) ∩ (𝐴 × 𝐵)) = (𝐴 × 𝐵)
109reseq2i 5314 . . . 4 (1st ↾ ((V × V) ∩ (𝐴 × 𝐵))) = (1st ↾ (𝐴 × 𝐵))
114, 10eqtri 2632 . . 3 ((1st ↾ (V × V)) ↾ (𝐴 × 𝐵)) = (1st ↾ (𝐴 × 𝐵))
122, 3, 113eqtr3ri 2641 . 2 (1st ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝑥)}
13 df-mpt2 6554 . 2 (𝑥𝐴, 𝑦𝐵𝑥) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝑥)}
1412, 13eqtr4i 2635 1 (1st ↾ (𝐴 × 𝐵)) = (𝑥𝐴, 𝑦𝐵𝑥)
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173   ∩ cin 3539   ⊆ wss 3540   × cxp 5036   ↾ cres 5040  {coprab 6550   ↦ cmpt2 6551  1st c1st 7057 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fo 5810  df-fv 5812  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060 This theorem is referenced by:  cnre2csqima  29285
 Copyright terms: Public domain W3C validator