Theorem fsuppcorn 7254

Description: The composition of a 1-1 function with a finitely supported function is finitely supported. The purpose of the (𝐹 supp 𝑍) ⊆ ran 𝐺 condition is to ensure we don't subset the support of the function in such a way as to fun afoul of exmidssfi 7199. (Other alternative conditions might also be sufficient). (Contributed by AV, 28-May-2019.) (Revised by Jim Kingdon, 15-May-2026.)

Hypotheses

Ref	Expression
fsuppco.f	⊢ (𝜑 → 𝐹 finSupp 𝑍)
fsuppco.g	⊢ (𝜑 → 𝐺:𝑋–1-1→𝑌)
fsuppco.z	⊢ (𝜑 → 𝑍 ∈ 𝑊)
fsuppco.v	⊢ (𝜑 → 𝐹 ∈ 𝑉)
fsuppcorn.g	⊢ (𝜑 → 𝐺 ∈ 𝑈)
fsuppcorn.rn	⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ ran 𝐺)

Assertion

Ref	Expression
fsuppcorn	⊢ (𝜑 → (𝐹 ∘ 𝐺) finSupp 𝑍)

Proof of Theorem fsuppcorn

Step	Hyp	Ref	Expression
1		fsuppco.v	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
2		fsuppco.g	. . . 4 ⊢ (𝜑 → 𝐺:𝑋–1-1→𝑌)
3		df-f1 5357	. . . . 5 ⊢ (𝐺:𝑋–1-1→𝑌 ↔ (𝐺:𝑋⟶𝑌 ∧ Fun ◡𝐺))
4	3	simprbi 275	. . . 4 ⊢ (𝐺:𝑋–1-1→𝑌 → Fun ◡𝐺)
5	2, 4	syl 14	. . 3 ⊢ (𝜑 → Fun ◡𝐺)
6		cofunex2g 6303	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ Fun ◡𝐺) → (𝐹 ∘ 𝐺) ∈ V)
7	1, 5, 6	syl2anc 411	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺) ∈ V)
8		fsuppco.z	. 2 ⊢ (𝜑 → 𝑍 ∈ 𝑊)
9		fsuppco.f	. . . 4 ⊢ (𝜑 → 𝐹 finSupp 𝑍)
10	9	fsuppfund 7247	. . 3 ⊢ (𝜑 → Fun 𝐹)
11		f1fun 5576	. . . 4 ⊢ (𝐺:𝑋–1-1→𝑌 → Fun 𝐺)
12	2, 11	syl 14	. . 3 ⊢ (𝜑 → Fun 𝐺)
13		funco 5392	. . 3 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺))
14	10, 12, 13	syl2anc 411	. 2 ⊢ (𝜑 → Fun (𝐹 ∘ 𝐺))
15		fsuppcorn.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑈)
16		suppcofn 6466	. . . 4 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑈) ∧ (Fun 𝐹 ∧ Fun 𝐺)) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍)))
17	1, 15, 10, 12, 16	syl22anc 1275	. . 3 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍)))
18	9	fsuppimpd 7246	. . . 4 ⊢ (𝜑 → (𝐹 supp 𝑍) ∈ Fin)
19		f1cnv 5638	. . . . . . 7 ⊢ (𝐺:𝑋–1-1→𝑌 → ◡𝐺:ran 𝐺–1-1-onto→𝑋)
20	2, 19	syl 14	. . . . . 6 ⊢ (𝜑 → ◡𝐺:ran 𝐺–1-1-onto→𝑋)
21		f1of1 5613	. . . . . 6 ⊢ (◡𝐺:ran 𝐺–1-1-onto→𝑋 → ◡𝐺:ran 𝐺–1-1→𝑋)
22	20, 21	syl 14	. . . . 5 ⊢ (𝜑 → ◡𝐺:ran 𝐺–1-1→𝑋)
23		fsuppcorn.rn	. . . . 5 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ ran 𝐺)
24		f1imaeng 7032	. . . . 5 ⊢ ((◡𝐺:ran 𝐺–1-1→𝑋 ∧ (𝐹 supp 𝑍) ⊆ ran 𝐺 ∧ (𝐹 supp 𝑍) ∈ Fin) → (◡𝐺 “ (𝐹 supp 𝑍)) ≈ (𝐹 supp 𝑍))
25	22, 23, 18, 24	syl3anc 1274	. . . 4 ⊢ (𝜑 → (◡𝐺 “ (𝐹 supp 𝑍)) ≈ (𝐹 supp 𝑍))
26		enfii 7129	. . . 4 ⊢ (((𝐹 supp 𝑍) ∈ Fin ∧ (◡𝐺 “ (𝐹 supp 𝑍)) ≈ (𝐹 supp 𝑍)) → (◡𝐺 “ (𝐹 supp 𝑍)) ∈ Fin)
27	18, 25, 26	syl2anc 411	. . 3 ⊢ (𝜑 → (◡𝐺 “ (𝐹 supp 𝑍)) ∈ Fin)
28	17, 27	eqeltrd 2309	. 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ∈ Fin)
29	7, 8, 14, 28	isfsuppd 7243	1 ⊢ (𝜑 → (𝐹 ∘ 𝐺) finSupp 𝑍)

Syntax hints:   → wi 4   = wceq 1398   ∈ wcel 2203  Vcvv 2813   ⊆ wss 3211   class class class wbr 4109  ^◡ccnv 4748  ran crn 4750   “ cima 4752   ∘ ccom 4753  Fun wfun 5346  ⟶wf 5348  –1-1→wf1 5349  –1-1-onto→wf1o 5351  (class class class)co 6050   supp csupp 6435   ≈ cen 6973  Fincfn 6975   finSupp cfsupp 7238

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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-supp 6436  df-er 6767  df-en 6976  df-fin 6978  df-fsupp 7239

This theorem is referenced by: (None)