| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fcobijfs | Structured version Visualization version GIF version | ||
| Description: Composing finitely supported functions with a bijection yields a bijection between sets of finitely supported functions. See also mapfien 9369. (Contributed by Thierry Arnoux, 25-Aug-2017.) (Revised by Thierry Arnoux, 1-Sep-2019.) |
| Ref | Expression |
|---|---|
| fcobij.1 | ⊢ (𝜑 → 𝐺:𝑆–1-1-onto→𝑇) |
| fcobij.2 | ⊢ (𝜑 → 𝑅 ∈ 𝑈) |
| fcobij.3 | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| fcobij.4 | ⊢ (𝜑 → 𝑇 ∈ 𝑊) |
| fcobijfs.5 | ⊢ (𝜑 → 𝑂 ∈ 𝑆) |
| fcobijfs.6 | ⊢ 𝑄 = (𝐺‘𝑂) |
| fcobijfs.7 | ⊢ 𝑋 = {𝑔 ∈ (𝑆 ↑m 𝑅) ∣ 𝑔 finSupp 𝑂} |
| fcobijfs.8 | ⊢ 𝑌 = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp 𝑄} |
| Ref | Expression |
|---|---|
| fcobijfs | ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)):𝑋–1-1-onto→𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fcobijfs.7 | . . . 4 ⊢ 𝑋 = {𝑔 ∈ (𝑆 ↑m 𝑅) ∣ 𝑔 finSupp 𝑂} | |
| 2 | breq1 5113 | . . . . 5 ⊢ (ℎ = 𝑔 → (ℎ finSupp 𝑂 ↔ 𝑔 finSupp 𝑂)) | |
| 3 | 2 | cbvrabv 3426 | . . . 4 ⊢ {ℎ ∈ (𝑆 ↑m 𝑅) ∣ ℎ finSupp 𝑂} = {𝑔 ∈ (𝑆 ↑m 𝑅) ∣ 𝑔 finSupp 𝑂} |
| 4 | 1, 3 | eqtr4i 2789 | . . 3 ⊢ 𝑋 = {ℎ ∈ (𝑆 ↑m 𝑅) ∣ ℎ finSupp 𝑂} |
| 5 | fcobijfs.8 | . . 3 ⊢ 𝑌 = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp 𝑄} | |
| 6 | fcobijfs.6 | . . 3 ⊢ 𝑄 = (𝐺‘𝑂) | |
| 7 | f1oi 6861 | . . . 4 ⊢ ( I ↾ 𝑅):𝑅–1-1-onto→𝑅 | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝜑 → ( I ↾ 𝑅):𝑅–1-1-onto→𝑅) |
| 9 | fcobij.1 | . . 3 ⊢ (𝜑 → 𝐺:𝑆–1-1-onto→𝑇) | |
| 10 | fcobij.2 | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑈) | |
| 11 | fcobij.3 | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 12 | fcobij.4 | . . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑊) | |
| 13 | fcobijfs.5 | . . 3 ⊢ (𝜑 → 𝑂 ∈ 𝑆) | |
| 14 | 4, 5, 6, 8, 9, 10, 11, 10, 12, 13 | mapfien 9369 | . 2 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))):𝑋–1-1-onto→𝑌) |
| 15 | 1 | ssrab3 4037 | . . . . . 6 ⊢ 𝑋 ⊆ (𝑆 ↑m 𝑅) |
| 16 | 15 | sseli 3934 | . . . . 5 ⊢ (𝑓 ∈ 𝑋 → 𝑓 ∈ (𝑆 ↑m 𝑅)) |
| 17 | coass 6269 | . . . . . 6 ⊢ ((𝐺 ∘ 𝑓) ∘ ( I ↾ 𝑅)) = (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅))) | |
| 18 | f1of 6822 | . . . . . . . . 9 ⊢ (𝐺:𝑆–1-1-onto→𝑇 → 𝐺:𝑆⟶𝑇) | |
| 19 | 9, 18 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝐺:𝑆⟶𝑇) |
| 20 | elmapi 8847 | . . . . . . . 8 ⊢ (𝑓 ∈ (𝑆 ↑m 𝑅) → 𝑓:𝑅⟶𝑆) | |
| 21 | fco 6732 | . . . . . . . 8 ⊢ ((𝐺:𝑆⟶𝑇 ∧ 𝑓:𝑅⟶𝑆) → (𝐺 ∘ 𝑓):𝑅⟶𝑇) | |
| 22 | 19, 20, 21 | syl2an 607 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑆 ↑m 𝑅)) → (𝐺 ∘ 𝑓):𝑅⟶𝑇) |
| 23 | fcoi1 6754 | . . . . . . 7 ⊢ ((𝐺 ∘ 𝑓):𝑅⟶𝑇 → ((𝐺 ∘ 𝑓) ∘ ( I ↾ 𝑅)) = (𝐺 ∘ 𝑓)) | |
| 24 | 22, 23 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑆 ↑m 𝑅)) → ((𝐺 ∘ 𝑓) ∘ ( I ↾ 𝑅)) = (𝐺 ∘ 𝑓)) |
| 25 | 17, 24 | eqtr3id 2812 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑆 ↑m 𝑅)) → (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅))) = (𝐺 ∘ 𝑓)) |
| 26 | 16, 25 | sylan2 604 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑋) → (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅))) = (𝐺 ∘ 𝑓)) |
| 27 | 26 | mpteq2dva 5205 | . . 3 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))) = (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓))) |
| 28 | 27 | f1oeq1d 6817 | . 2 ⊢ (𝜑 → ((𝑓 ∈ 𝑋 ↦ (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))):𝑋–1-1-onto→𝑌 ↔ (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)):𝑋–1-1-onto→𝑌)) |
| 29 | 14, 28 | mpbid 235 | 1 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)):𝑋–1-1-onto→𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 {crab 3416 class class class wbr 5110 ↦ cmpt 5193 I cid 5557 ↾ cres 5665 ∘ ccom 5667 ⟶wf 6534 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7412 ↑m cmap 8825 finSupp cfsupp 9322 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-supp 8158 df-1o 8454 df-map 8827 df-en 8945 df-dom 8946 df-fin 8948 df-fsupp 9323 |
| This theorem is referenced by: eulerpartgbij 34743 |
| Copyright terms: Public domain | W3C validator |