| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fcobijfs2 | 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 fcobijfs 32696 and mapfien 9287. (Contributed by Thierry Arnoux, 10-Jan-2026.) |
| Ref | Expression |
|---|---|
| fcobijfs2.1 | ⊢ (𝜑 → 𝐺:𝑅–1-1-onto→𝑆) |
| fcobijfs2.2 | ⊢ (𝜑 → 𝑅 ∈ 𝑈) |
| fcobijfs2.3 | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| fcobijfs2.4 | ⊢ (𝜑 → 𝑇 ∈ 𝑊) |
| fcobijfs2.5 | ⊢ (𝜑 → 𝑂 ∈ 𝑇) |
| fcobijfs2.7 | ⊢ 𝑋 = {𝑔 ∈ (𝑇 ↑m 𝑆) ∣ 𝑔 finSupp 𝑂} |
| fcobijfs2.8 | ⊢ 𝑌 = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp 𝑂} |
| Ref | Expression |
|---|---|
| fcobijfs2 | ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝑓 ∘ 𝐺)):𝑋–1-1-onto→𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fcobijfs2.7 | . . . . 5 ⊢ 𝑋 = {𝑔 ∈ (𝑇 ↑m 𝑆) ∣ 𝑔 finSupp 𝑂} | |
| 2 | breq1 5089 | . . . . . 6 ⊢ (ℎ = 𝑔 → (ℎ finSupp 𝑂 ↔ 𝑔 finSupp 𝑂)) | |
| 3 | 2 | cbvrabv 3405 | . . . . 5 ⊢ {ℎ ∈ (𝑇 ↑m 𝑆) ∣ ℎ finSupp 𝑂} = {𝑔 ∈ (𝑇 ↑m 𝑆) ∣ 𝑔 finSupp 𝑂} |
| 4 | 1, 3 | eqtr4i 2757 | . . . 4 ⊢ 𝑋 = {ℎ ∈ (𝑇 ↑m 𝑆) ∣ ℎ finSupp 𝑂} |
| 5 | eqid 2731 | . . . 4 ⊢ {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp (( I ↾ 𝑇)‘𝑂)} = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp (( I ↾ 𝑇)‘𝑂)} | |
| 6 | eqid 2731 | . . . 4 ⊢ (( I ↾ 𝑇)‘𝑂) = (( I ↾ 𝑇)‘𝑂) | |
| 7 | fcobijfs2.1 | . . . 4 ⊢ (𝜑 → 𝐺:𝑅–1-1-onto→𝑆) | |
| 8 | f1oi 6796 | . . . . 5 ⊢ ( I ↾ 𝑇):𝑇–1-1-onto→𝑇 | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝜑 → ( I ↾ 𝑇):𝑇–1-1-onto→𝑇) |
| 10 | fcobijfs2.3 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 11 | fcobijfs2.4 | . . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝑊) | |
| 12 | fcobijfs2.2 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑈) | |
| 13 | fcobijfs2.5 | . . . 4 ⊢ (𝜑 → 𝑂 ∈ 𝑇) | |
| 14 | 4, 5, 6, 7, 9, 10, 11, 12, 11, 13 | mapfien 9287 | . . 3 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺))):𝑋–1-1-onto→{ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp (( I ↾ 𝑇)‘𝑂)}) |
| 15 | fvresi 7102 | . . . . . . 7 ⊢ (𝑂 ∈ 𝑇 → (( I ↾ 𝑇)‘𝑂) = 𝑂) | |
| 16 | 13, 15 | syl 17 | . . . . . 6 ⊢ (𝜑 → (( I ↾ 𝑇)‘𝑂) = 𝑂) |
| 17 | 16 | breq2d 5098 | . . . . 5 ⊢ (𝜑 → (ℎ finSupp (( I ↾ 𝑇)‘𝑂) ↔ ℎ finSupp 𝑂)) |
| 18 | 17 | rabbidv 3402 | . . . 4 ⊢ (𝜑 → {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp (( I ↾ 𝑇)‘𝑂)} = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp 𝑂}) |
| 19 | fcobijfs2.8 | . . . 4 ⊢ 𝑌 = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp 𝑂} | |
| 20 | 18, 19 | eqtr4di 2784 | . . 3 ⊢ (𝜑 → {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp (( I ↾ 𝑇)‘𝑂)} = 𝑌) |
| 21 | 14, 20 | f1oeq3dd 32603 | . 2 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺))):𝑋–1-1-onto→𝑌) |
| 22 | 1 | ssrab3 4027 | . . . . . 6 ⊢ 𝑋 ⊆ (𝑇 ↑m 𝑆) |
| 23 | 22 | sseli 3925 | . . . . 5 ⊢ (𝑓 ∈ 𝑋 → 𝑓 ∈ (𝑇 ↑m 𝑆)) |
| 24 | elmapi 8768 | . . . . . . 7 ⊢ (𝑓 ∈ (𝑇 ↑m 𝑆) → 𝑓:𝑆⟶𝑇) | |
| 25 | f1of 6758 | . . . . . . . 8 ⊢ (𝐺:𝑅–1-1-onto→𝑆 → 𝐺:𝑅⟶𝑆) | |
| 26 | 7, 25 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐺:𝑅⟶𝑆) |
| 27 | fco 6670 | . . . . . . 7 ⊢ ((𝑓:𝑆⟶𝑇 ∧ 𝐺:𝑅⟶𝑆) → (𝑓 ∘ 𝐺):𝑅⟶𝑇) | |
| 28 | 24, 26, 27 | syl2anr 597 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑇 ↑m 𝑆)) → (𝑓 ∘ 𝐺):𝑅⟶𝑇) |
| 29 | fcoi2 6693 | . . . . . 6 ⊢ ((𝑓 ∘ 𝐺):𝑅⟶𝑇 → (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺)) = (𝑓 ∘ 𝐺)) | |
| 30 | 28, 29 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑇 ↑m 𝑆)) → (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺)) = (𝑓 ∘ 𝐺)) |
| 31 | 23, 30 | sylan2 593 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑋) → (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺)) = (𝑓 ∘ 𝐺)) |
| 32 | 31 | mpteq2dva 5179 | . . 3 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺))) = (𝑓 ∈ 𝑋 ↦ (𝑓 ∘ 𝐺))) |
| 33 | 32 | f1oeq1d 6753 | . 2 ⊢ (𝜑 → ((𝑓 ∈ 𝑋 ↦ (( I ↾ 𝑇) ∘ (𝑓 ∘ 𝐺))):𝑋–1-1-onto→𝑌 ↔ (𝑓 ∈ 𝑋 ↦ (𝑓 ∘ 𝐺)):𝑋–1-1-onto→𝑌)) |
| 34 | 21, 33 | mpbid 232 | 1 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝑓 ∘ 𝐺)):𝑋–1-1-onto→𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 {crab 3395 class class class wbr 5086 ↦ cmpt 5167 I cid 5505 ↾ cres 5613 ∘ ccom 5615 ⟶wf 6472 –1-1-onto→wf1o 6475 ‘cfv 6476 (class class class)co 7341 ↑m cmap 8745 finSupp cfsupp 9240 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5212 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-iun 4938 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-supp 8086 df-1o 8380 df-map 8747 df-en 8865 df-dom 8866 df-fin 8868 df-fsupp 9241 |
| This theorem is referenced by: mplvrpmfgalem 33566 |
| Copyright terms: Public domain | W3C validator |