| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f2ndres | 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 2824 | . . . . . . . 8 ⊢ 𝑦 ∈ V | |
| 2 | vex 2824 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 3 | 1, 2 | op2nda 5270 | . . . . . . 7 ⊢ ∪ ran {〈𝑦, 𝑧〉} = 𝑧 |
| 4 | 3 | eleq1i 2304 | . . . . . 6 ⊢ (∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵 ↔ 𝑧 ∈ 𝐵) |
| 5 | 4 | biimpri 133 | . . . . 5 ⊢ (𝑧 ∈ 𝐵 → ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 6 | 5 | adantl 277 | . . . 4 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) → ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 7 | 6 | rgen2 2636 | . . 3 ⊢ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵 |
| 8 | sneq 3719 | . . . . . . 7 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → {𝑥} = {〈𝑦, 𝑧〉}) | |
| 9 | 8 | rneqd 5009 | . . . . . 6 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ran {𝑥} = ran {〈𝑦, 𝑧〉}) |
| 10 | 9 | unieqd 3944 | . . . . 5 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → ∪ ran {𝑥} = ∪ ran {〈𝑦, 𝑧〉}) |
| 11 | 10 | eleq1d 2307 | . . . 4 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → (∪ ran {𝑥} ∈ 𝐵 ↔ ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵)) |
| 12 | 11 | ralxp 4921 | . . 3 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ∪ ran {〈𝑦, 𝑧〉} ∈ 𝐵) |
| 13 | 7, 12 | mpbir 146 | . 2 ⊢ ∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 |
| 14 | df-2nd 6369 | . . . . 5 ⊢ 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥}) | |
| 15 | 14 | reseq1i 5057 | . . . 4 ⊢ (2nd ↾ (𝐴 × 𝐵)) = ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) |
| 16 | ssv 3270 | . . . . 5 ⊢ (𝐴 × 𝐵) ⊆ V | |
| 17 | resmpt 5109 | . . . . 5 ⊢ ((𝐴 × 𝐵) ⊆ V → ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥})) | |
| 18 | 16, 17 | ax-mp 5 | . . . 4 ⊢ ((𝑥 ∈ V ↦ ∪ ran {𝑥}) ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}) |
| 19 | 15, 18 | eqtri 2259 | . . 3 ⊢ (2nd ↾ (𝐴 × 𝐵)) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ran {𝑥}) |
| 20 | 19 | fmpt 5852 | . 2 ⊢ (∀𝑥 ∈ (𝐴 × 𝐵)∪ ran {𝑥} ∈ 𝐵 ↔ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵) |
| 21 | 13, 20 | mpbi 145 | 1 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1402 ∈ wcel 2209 ∀wral 2528 Vcvv 2821 ⊆ wss 3220 {csn 3708 〈cop 3711 ∪ cuni 3933 ↦ cmpt 4190 × cxp 4770 ran crn 4773 ↾ cres 4774 ⟶wf 5371 2nd c2nd 6367 |
| This theorem was proved from 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 4247 ax-pow 4309 ax-pr 4344 |
| This theorem 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 3714 df-pr 3715 df-op 3717 df-uni 3934 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-fv 5383 df-2nd 6369 |
| This theorem is referenced by: fo2ndresm 6390 2ndcof 6392 f2ndf 6456 eucalgcvga 12819 tx2cn 15354 |
| Copyright terms: Public domain | W3C validator |