| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f2ndres | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| f2ndres | ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3436 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 2 | vex 3436 | . . . . . . 7 ⊢ 𝑧 ∈ V | |
| 3 | 1, 2 | op2nda 6186 | . . . . . 6 ⊢ ∪ ran {〈𝑦, 𝑧〉} = 𝑧 |
| 4 | 3 | eleq1i 2831 | . . . . 5 ⊢ (∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵 ↔ 𝑧 ∈ 𝐵) |
| 5 | 4 | bilanri 507 | . . . 4 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) → ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 6 | 5 | rgen2 3180 | . . 3 ⊢ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵 |
| 7 | sneq 4572 | . . . . . . 7 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → {𝑥} = {〈𝑦, 𝑧〉}) | |
| 8 | 7 | rneqd 5887 | . . . . . 6 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ran {𝑥} = ran {〈𝑦, 𝑧〉}) |
| 9 | 8 | unieqd 4858 | . . . . 5 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ∪ ran {𝑥} = ∪ ran {〈𝑦, 𝑧〉}) |
| 10 | 9 | eleq1d 2825 | . . . 4 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → (∪ ran {𝑥} ∈ 𝐵 ↔ ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵)) |
| 11 | 10 | ralxp 5790 | . . 3 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 12 | 6, 11 | mpbir 232 | . 2 ⊢ ∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 |
| 13 | df-2nd 7939 | . . . . 5 ⊢ 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥}) | |
| 14 | 13 | reseq1i 5934 | . . . 4 ⊢ (2nd ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) |
| 15 | ssv 3946 | . . . . 5 ⊢ (𝐴 × 𝐵) ⊆ V | |
| 16 | resmpt 5996 | . . . . 5 ⊢ ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥})) | |
| 17 | 15, 16 | ax-mp 5 | . . . 4 ⊢ ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}) |
| 18 | 14, 17 | eqtri 2763 | . . 3 ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}) |
| 19 | 18 | fmpt 7058 | . 2 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵) |
| 20 | 12, 19 | mpbi 231 | 1 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∈ wcel 2119 ∀wral 3054 Vcvv 3432 ⊆ wss 3890 {csn 4562 〈cop 4568 ∪ cuni 4845 ↦ cmpt 5160 × cxp 5623 ran crn 5626 ↾ cres 5627 ⟶wf 6488 2nd c2nd 7937 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-fun 6494 df-fn 6495 df-f 6496 df-2nd 7939 |
| This theorem is referenced by: fo2ndres 7965 2ndcof 7969 fparlem2 8059 f2ndf 8066 eucalgcvga 16553 2ndfcl 18162 gaid 19272 tx2cn 23600 txkgen 23642 xpinpreima 34097 xpinpreima2 34098 2ndmbfm 34452 filnetlem4 36616 hausgraph 43657 |
| Copyright terms: Public domain | W3C validator |