ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f2ndres GIF version

Theorem f2ndres 6398
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 2824 . . . . . . . 8 𝑦 ∈ V
2 vex 2824 . . . . . . . 8 𝑧 ∈ V
31, 2op2nda 5275 . . . . . . 7 ∪ ran {⟨𝑦, 𝑧⟩} = 𝑧
43eleq1i 2304 . . . . . 6 (∪ ran {⟨𝑦, 𝑧⟩} ∈ 𝐵 ↔ 𝑧 ∈ 𝐵)
54biimpri 133 . . . . 5 (𝑧 ∈ 𝐵 → ∪ ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
65adantl 277 . . . 4 ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) → ∪ ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
76rgen2 2636 . . 3 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {⟨𝑦, 𝑧⟩} ∈ 𝐵
8 sneq 3720 . . . . . . 7 (𝑥 = ⟨𝑦, 𝑧⟩ → {𝑥} = {⟨𝑦, 𝑧⟩})
98rneqd 5013 . . . . . 6 (𝑥 = ⟨𝑦, 𝑧⟩ → ran {𝑥} = ran {⟨𝑦, 𝑧⟩})
109unieqd 3946 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → ∪ ran {𝑥} = ∪ ran {⟨𝑦, 𝑧⟩})
1110eleq1d 2307 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → (∪ ran {𝑥} ∈ 𝐵 ↔ ∪ ran {⟨𝑦, 𝑧⟩} ∈ 𝐵))
1211ralxp 4925 . . 3 (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {⟨𝑦, 𝑧⟩} ∈ 𝐵)
137, 12mpbir 146 . 2 ∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵
14 df-2nd 6379 . . . . 5 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥})
1514reseq1i 5061 . . . 4 (2nd ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵))
16 ssv 3270 . . . . 5 (𝐴 × 𝐵) ⊆ V
17 resmpt 5114 . . . . 5 ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}))
1816, 17ax-mp 5 . . . 4 ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥})
1915, 18eqtri 2259 . . 3 (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥})
2019fmpt 5861 . 2 (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵)
2113, 20mpbi 145 1 (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
Colors of variables:    wff set class
This proof depends on syntax axioms:   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  {csn 3709  ⟨cop 3712  ∪ cuni 3935   ↦ cmpt 4193   × cxp 4774  ran crn 4777   ↾ cres 4778  ⟶wf 5376  2nd c2nd 6377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-2nd 6379
This theorem is used by:  fo2ndresm  6400  2ndcof  6402  f2ndf  6466  eucalgcvga  12862  tx2cn  15508
  Copyright terms: Public domain W3C validator