| 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 3461 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 2 | vex 3461 | . . . . . . 7 ⊢ 𝑧 ∈ V | |
| 3 | 1, 2 | op2nda 6219 | . . . . . 6 ⊢ ∪ ran {〈𝑦, 𝑧〉} = 𝑧 |
| 4 | 3 | eleq1i 2856 | . . . . 5 ⊢ (∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵 ↔ 𝑧 ∈ 𝐵) |
| 5 | 4 | bilanri 511 | . . . 4 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) → ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 6 | 5 | rgen2 3205 | . . 3 ⊢ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵 |
| 7 | sneq 4595 | . . . . . . 7 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → {𝑥} = {〈𝑦, 𝑧〉}) | |
| 8 | 7 | rneqd 5919 | . . . . . 6 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ran {𝑥} = ran {〈𝑦, 𝑧〉}) |
| 9 | 8 | unieqd 4881 | . . . . 5 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ∪ ran {𝑥} = ∪ ran {〈𝑦, 𝑧〉}) |
| 10 | 9 | eleq1d 2850 | . . . 4 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → (∪ ran {𝑥} ∈ 𝐵 ↔ ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵)) |
| 11 | 10 | ralxp 5818 | . . 3 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 12 | 6, 11 | mpbir 234 | . 2 ⊢ ∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 |
| 13 | df-2nd 7975 | . . . . 5 ⊢ 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥}) | |
| 14 | 13 | reseq1i 5965 | . . . 4 ⊢ (2nd ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) |
| 15 | ssv 3963 | . . . . 5 ⊢ (𝐴 × 𝐵) ⊆ V | |
| 16 | resmpt 6030 | . . . . 5 ⊢ ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥})) | |
| 17 | 15, 16 | ax-mp 5 | . . . 4 ⊢ ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}) |
| 18 | 14, 17 | eqtri 2788 | . . 3 ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}) |
| 19 | 18 | fmpt 7095 | . 2 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵) |
| 20 | 12, 19 | mpbi 233 | 1 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1563 ∈ wcel 2145 ∀wral 3079 Vcvv 3457 ⊆ wss 3907 {csn 4585 〈cop 4591 ∪ cuni 4868 ↦ cmpt 5186 × cxp 5650 ran crn 5653 ↾ cres 5654 ⟶wf 6521 2nd c2nd 7973 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-fun 6527 df-fn 6528 df-f 6529 df-2nd 7975 |
| This theorem is referenced by: fo2ndres 8001 2ndcof 8005 fparlem2 8096 f2ndf 8103 eucalgcvga 16634 2ndfcl 18244 gaid 19360 tx2cn 23728 txkgen 23770 xpinpreima 34213 xpinpreima2 34214 2ndmbfm 34568 filnetlem4 36754 hausgraph 43794 |
| Copyright terms: Public domain | W3C validator |