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

Theorem f2ndres 8020
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 3462 . . . . . . 7 𝑦 ∈ V
2 vex 3462 . . . . . . 7 𝑧 ∈ V
31, 2op2nda 6234 . . . . . 6 ran {⟨𝑦, 𝑧⟩} = 𝑧
43eleq1i 2857 . . . . 5 ( ran {⟨𝑦, 𝑧⟩} ∈ 𝐵𝑧𝐵)
54bilanri 512 . . . 4 ((𝑦𝐴𝑧𝐵) → ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
65rgen2 3208 . . 3 𝑦𝐴𝑧𝐵 ran {⟨𝑦, 𝑧⟩} ∈ 𝐵
7 sneq 4604 . . . . . . 7 (𝑥 = ⟨𝑦, 𝑧⟩ → {𝑥} = {⟨𝑦, 𝑧⟩})
87rneqd 5933 . . . . . 6 (𝑥 = ⟨𝑦, 𝑧⟩ → ran {𝑥} = ran {⟨𝑦, 𝑧⟩})
98unieqd 4890 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → ran {𝑥} = ran {⟨𝑦, 𝑧⟩})
109eleq1d 2851 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → ( ran {𝑥} ∈ 𝐵 ran {⟨𝑦, 𝑧⟩} ∈ 𝐵))
1110ralxp 5832 . . 3 (∀𝑥 ∈ (𝐴 × 𝐵) ran {𝑥} ∈ 𝐵 ↔ ∀𝑦𝐴𝑧𝐵 ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
126, 11mpbir 234 . 2 𝑥 ∈ (𝐴 × 𝐵) ran {𝑥} ∈ 𝐵
13 df-2nd 7996 . . . . 5 2nd = (𝑥 ∈ V ↦ ran {𝑥})
1413reseq1i 5979 . . . 4 (2nd ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ran {𝑥}) ↾ (𝐴 × 𝐵))
15 ssv 3964 . . . . 5 (𝐴 × 𝐵) ⊆ V
16 resmpt 6044 . . . . 5 ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ran {𝑥}))
1715, 16ax-mp 5 . . . 4 ((𝑥 ∈ V ↦ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ran {𝑥})
1814, 17eqtri 2789 . . 3 (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ran {𝑥})
1918fmpt 7112 . 2 (∀𝑥 ∈ (𝐴 × 𝐵) ran {𝑥} ∈ 𝐵 ↔ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵)
2012, 19mpbi 233 1 (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2146  wral 3082  Vcvv 3458  wss 3908  {csn 4594  cop 4600   cuni 4877  cmpt 5197   × cxp 5664  ran crn 5667  cres 5668  wf 6539  2nd c2nd 7994
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-fun 6545  df-fn 6546  df-f 6547  df-2nd 7996
This theorem is used by:  fo2ndres  8022  2ndcof  8026  fparlem2  8117  f2ndf  8124  eucalgcvga  16669  2ndfcl  18279  gaid  19400  tx2cn  23804  txkgen  23846  xpinpreima  34327  xpinpreima2  34328  2ndmbfm  34682  filnetlem4  36932  hausgraph  43972
  Copyright terms: Public domain W3C validator