Theorem fcobijfs 32734

Description: Composing finitely supported functions with a bijection yields a bijection between sets of finitely supported functions. See also mapfien 9448. (Contributed by Thierry Arnoux, 25-Aug-2017.) (Revised by Thierry Arnoux, 1-Sep-2019.)

Hypotheses

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 𝑄}

Assertion

Ref	Expression
fcobijfs	⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)):𝑋–1-1-onto→𝑌)

Distinct variable groups:   𝑓,ℎ,𝐺   𝑅,𝑓,ℎ   𝑆,𝑓,ℎ   𝑇,𝑓,ℎ   𝜑,𝑓,ℎ   𝑓,𝑂,ℎ   𝑄,𝑓,ℎ   𝑔,ℎ,𝑂   𝑅,𝑔   𝑆,𝑔   𝑓,𝑋   𝑓,𝑌

Allowed substitution hints:   𝜑(𝑔)   𝑄(𝑔)   𝑇(𝑔)   𝑈(𝑓,𝑔,ℎ)   𝐺(𝑔)   𝑉(𝑓,𝑔,ℎ)   𝑊(𝑓,𝑔,ℎ)   𝑋(𝑔,ℎ)   𝑌(𝑔,ℎ)

Proof of Theorem fcobijfs

Step	Hyp	Ref	Expression
1		fcobijfs.7	. . . 4 ⊢ 𝑋 = {𝑔 ∈ (𝑆 ↑m 𝑅) ∣ 𝑔 finSupp 𝑂}
2		breq1 5146	. . . . 5 ⊢ (ℎ = 𝑔 → (ℎ finSupp 𝑂 ↔ 𝑔 finSupp 𝑂))
3	2	cbvrabv 3447	. . . 4 ⊢ {ℎ ∈ (𝑆 ↑m 𝑅) ∣ ℎ finSupp 𝑂} = {𝑔 ∈ (𝑆 ↑m 𝑅) ∣ 𝑔 finSupp 𝑂}
4	1, 3	eqtr4i 2768	. . 3 ⊢ 𝑋 = {ℎ ∈ (𝑆 ↑m 𝑅) ∣ ℎ finSupp 𝑂}
5		fcobijfs.8	. . 3 ⊢ 𝑌 = {ℎ ∈ (𝑇 ↑m 𝑅) ∣ ℎ finSupp 𝑄}
6		fcobijfs.6	. . 3 ⊢ 𝑄 = (𝐺‘𝑂)
7		f1oi 6886	. . . 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 9448	. 2 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))):𝑋–1-1-onto→𝑌)
15	1	ssrab3 4082	. . . . . 6 ⊢ 𝑋 ⊆ (𝑆 ↑m 𝑅)
16	15	sseli 3979	. . . . 5 ⊢ (𝑓 ∈ 𝑋 → 𝑓 ∈ (𝑆 ↑m 𝑅))
17		coass 6285	. . . . . 6 ⊢ ((𝐺 ∘ 𝑓) ∘ ( I ↾ 𝑅)) = (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))
18		f1of 6848	. . . . . . . . 9 ⊢ (𝐺:𝑆–1-1-onto→𝑇 → 𝐺:𝑆⟶𝑇)
19	9, 18	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝑆⟶𝑇)
20		elmapi 8889	. . . . . . . 8 ⊢ (𝑓 ∈ (𝑆 ↑m 𝑅) → 𝑓:𝑅⟶𝑆)
21		fco 6760	. . . . . . . 8 ⊢ ((𝐺:𝑆⟶𝑇 ∧ 𝑓:𝑅⟶𝑆) → (𝐺 ∘ 𝑓):𝑅⟶𝑇)
22	19, 20, 21	syl2an 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑆 ↑m 𝑅)) → (𝐺 ∘ 𝑓):𝑅⟶𝑇)
23		fcoi1 6782	. . . . . . 7 ⊢ ((𝐺 ∘ 𝑓):𝑅⟶𝑇 → ((𝐺 ∘ 𝑓) ∘ ( I ↾ 𝑅)) = (𝐺 ∘ 𝑓))
24	22, 23	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑆 ↑m 𝑅)) → ((𝐺 ∘ 𝑓) ∘ ( I ↾ 𝑅)) = (𝐺 ∘ 𝑓))
25	17, 24	eqtr3id 2791	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑆 ↑m 𝑅)) → (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅))) = (𝐺 ∘ 𝑓))
26	16, 25	sylan2 593	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑋) → (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅))) = (𝐺 ∘ 𝑓))
27	26	mpteq2dva 5242	. . 3 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))) = (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)))
28	27	f1oeq1d 6843	. 2 ⊢ (𝜑 → ((𝑓 ∈ 𝑋 ↦ (𝐺 ∘ (𝑓 ∘ ( I ↾ 𝑅)))):𝑋–1-1-onto→𝑌 ↔ (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)):𝑋–1-1-onto→𝑌))
29	14, 28	mpbid 232	1 ⊢ (𝜑 → (𝑓 ∈ 𝑋 ↦ (𝐺 ∘ 𝑓)):𝑋–1-1-onto→𝑌)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2108  {crab 3436   class class class wbr 5143   ↦ cmpt 5225   I cid 5577   ↾ cres 5687   ∘ ccom 5689  ⟶wf 6557  –1-1-onto→wf1o 6560  ‘cfv 6561  (class class class)co 7431   ↑_m cmap 8866   finSupp cfsupp 9401

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-supp 8186  df-1o 8506  df-map 8868  df-en 8986  df-dom 8987  df-fin 8989  df-fsupp 9402

This theorem is referenced by:  eulerpartgbij  34374