MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f2ndres Structured version   Visualization version   GIF version

Theorem f2ndres 8015
Description: Mapping of a restriction of the 2nd (second member of an ordered pair) function. (Contributed by NM, 7-Aug-2006.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
f2ndres (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵

Proof of Theorem f2ndres
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3457 . . . . . . 7 𝑦 ∈ V
2 vex 3457 . . . . . . 7 𝑧 ∈ V
31, 2op2nda 6228 . . . . . 6 ran {⟨𝑦, 𝑧⟩} = 𝑧
43eleq1i 2853 . . . . 5 ( ran {⟨𝑦, 𝑧⟩} ∈ 𝐵𝑧𝐵)
54bilanri 512 . . . 4 ((𝑦𝐴𝑧𝐵) → ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
65rgen2 3204 . . 3 𝑦𝐴𝑧𝐵 ran {⟨𝑦, 𝑧⟩} ∈ 𝐵
7 sneq 4597 . . . . . . 7 (𝑥 = ⟨𝑦, 𝑧⟩ → {𝑥} = {⟨𝑦, 𝑧⟩})
87rneqd 5926 . . . . . 6 (𝑥 = ⟨𝑦, 𝑧⟩ → ran {𝑥} = ran {⟨𝑦, 𝑧⟩})
98unieqd 4883 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → ran {𝑥} = ran {⟨𝑦, 𝑧⟩})
109eleq1d 2847 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → ( ran {𝑥} ∈ 𝐵 ran {⟨𝑦, 𝑧⟩} ∈ 𝐵))
1110ralxp 5825 . . 3 (∀𝑥 ∈ (𝐴 × 𝐵) ran {𝑥} ∈ 𝐵 ↔ ∀𝑦𝐴𝑧𝐵 ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
126, 11mpbir 234 . 2 𝑥 ∈ (𝐴 × 𝐵) ran {𝑥} ∈ 𝐵
13 df-2nd 7991 . . . . 5 2nd = (𝑥 ∈ V ↦ ran {𝑥})
1413reseq1i 5972 . . . 4 (2nd ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ran {𝑥}) ↾ (𝐴 × 𝐵))
15 ssv 3958 . . . . 5 (𝐴 × 𝐵) ⊆ V
16 resmpt 6037 . . . . 5 ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ran {𝑥}))
1715, 16ax-mp 5 . . . 4 ((𝑥 ∈ V ↦ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ran {𝑥})
1814, 17eqtri 2785 . . 3 (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ran {𝑥})
1918fmpt 7107 . 2 (∀𝑥 ∈ (𝐴 × 𝐵) ran {𝑥} ∈ 𝐵 ↔ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵)
2012, 19mpbi 233 1 (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2145  wral 3078  Vcvv 3453  wss 3902  {csn 4587  cop 4593   cuni 4870  cmpt 5190   × cxp 5657  ran crn 5660  cres 5661  wf 6533  2nd c2nd 7989
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 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-fun 6539  df-fn 6540  df-f 6541  df-2nd 7991
This theorem is used by:  fo2ndres  8017  2ndcof  8021  fparlem2  8114  f2ndf  8121  eucalgcvga  16682  2ndfcl  18292  gaid  19432  tx2cn  23842  txkgen  23884  xpinpreima  34424  xpinpreima2  34425  2ndmbfm  34780  filnetlem4  37008  hausgraph  44054
  Copyright terms: Public domain W3C validator