mapfienlem1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mapfienlem1		Structured version Visualization version GIF version

Theorem mapfienlem1 8871

Description: Lemma 1 for mapfien 8874. (Contributed by AV, 3-Jul-2019.)

**Hypotheses**
Ref	Expression
mapfien.s	⊢ 𝑆 = {𝑥 ∈ (𝐵 ↑_m 𝐴) ∣ 𝑥 finSupp 𝑍}
mapfien.t	⊢ 𝑇 = {𝑥 ∈ (𝐷 ↑_m 𝐶) ∣ 𝑥 finSupp 𝑊}
mapfien.w	⊢ 𝑊 = (𝐺‘𝑍)
mapfien.f	⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
mapfien.g	⊢ (𝜑 → 𝐺:𝐵–1-1-onto→𝐷)
mapfien.a	⊢ (𝜑 → 𝐴 ∈ V)
mapfien.b	⊢ (𝜑 → 𝐵 ∈ V)
mapfien.c	⊢ (𝜑 → 𝐶 ∈ V)
mapfien.d	⊢ (𝜑 → 𝐷 ∈ V)
mapfien.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)

**Assertion**
Ref	Expression
mapfienlem1	⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺 ∘ (𝑓 ∘ 𝐹)) finSupp 𝑊)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝐶 𝑥,𝑓,𝐹 𝑓,𝐺,𝑥 𝜑,𝑓 𝑥,𝐷 𝑆,𝑓 𝑇,𝑓 𝑥,𝑊 𝑥,𝑍 Allowed substitution hints: 𝜑(𝑥) 𝐴(𝑓) 𝐵(𝑓) 𝐶(𝑓) 𝐷(𝑓) 𝑆(𝑥) 𝑇(𝑥) 𝑊(𝑓) 𝑍(𝑓)

**Proof of Theorem mapfienlem1**
Step	Hyp	Ref	Expression
1		mapfien.w	. . . 4 ⊢ 𝑊 = (𝐺‘𝑍)
2	1	fvexi 6687	. . 3 ⊢ 𝑊 ∈ V
3	2	a1i 11	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑊 ∈ V)
4		mapfien.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
5	4	adantr 483	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑍 ∈ 𝐵)
6		elrabi 3678	. . . . 5 ⊢ (𝑓 ∈ {𝑥 ∈ (𝐵 ↑_m 𝐴) ∣ 𝑥 finSupp 𝑍} → 𝑓 ∈ (𝐵 ↑_m 𝐴))
7		elmapi 8431	. . . . 5 ⊢ (𝑓 ∈ (𝐵 ↑_m 𝐴) → 𝑓:𝐴⟶𝐵)
8	6, 7	syl 17	. . . 4 ⊢ (𝑓 ∈ {𝑥 ∈ (𝐵 ↑_m 𝐴) ∣ 𝑥 finSupp 𝑍} → 𝑓:𝐴⟶𝐵)
9		mapfien.s	. . . 4 ⊢ 𝑆 = {𝑥 ∈ (𝐵 ↑_m 𝐴) ∣ 𝑥 finSupp 𝑍}
10	8, 9	eleq2s 2934	. . 3 ⊢ (𝑓 ∈ 𝑆 → 𝑓:𝐴⟶𝐵)
11		mapfien.f	. . . 4 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
12		f1of 6618	. . . 4 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶⟶𝐴)
13	11, 12	syl 17	. . 3 ⊢ (𝜑 → 𝐹:𝐶⟶𝐴)
14		fco 6534	. . 3 ⊢ ((𝑓:𝐴⟶𝐵 ∧ 𝐹:𝐶⟶𝐴) → (𝑓 ∘ 𝐹):𝐶⟶𝐵)
15	10, 13, 14	syl2anr 598	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝑓 ∘ 𝐹):𝐶⟶𝐵)
16		mapfien.g	. . . 4 ⊢ (𝜑 → 𝐺:𝐵–1-1-onto→𝐷)
17		f1of 6618	. . . 4 ⊢ (𝐺:𝐵–1-1-onto→𝐷 → 𝐺:𝐵⟶𝐷)
18	16, 17	syl 17	. . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐷)
19	18	adantr 483	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐺:𝐵⟶𝐷)
20		ssidd 3993	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐵 ⊆ 𝐵)
21		mapfien.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
22	21	adantr 483	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐶 ∈ V)
23		mapfien.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
24	23	adantr 483	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐵 ∈ V)
25		breq1 5072	. . . . . 6 ⊢ (𝑥 = 𝑓 → (𝑥 finSupp 𝑍 ↔ 𝑓 finSupp 𝑍))
26	25, 9	elrab2 3686	. . . . 5 ⊢ (𝑓 ∈ 𝑆 ↔ (𝑓 ∈ (𝐵 ↑_m 𝐴) ∧ 𝑓 finSupp 𝑍))
27	26	simprbi 499	. . . 4 ⊢ (𝑓 ∈ 𝑆 → 𝑓 finSupp 𝑍)
28	27	adantl 484	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑓 finSupp 𝑍)
29		f1of1 6617	. . . . 5 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶–1-1→𝐴)
30	11, 29	syl 17	. . . 4 ⊢ (𝜑 → 𝐹:𝐶–1-1→𝐴)
31	30	adantr 483	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝐹:𝐶–1-1→𝐴)
32		simpr 487	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → 𝑓 ∈ 𝑆)
33	28, 31, 5, 32	fsuppco 8868	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝑓 ∘ 𝐹) finSupp 𝑍)
34	1	eqcomi 2833	. . 3 ⊢ (𝐺‘𝑍) = 𝑊
35	34	a1i 11	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺‘𝑍) = 𝑊)
36	3, 5, 15, 19, 20, 22, 24, 33, 35	fsuppcor 8870	1 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑆) → (𝐺 ∘ (𝑓 ∘ 𝐹)) finSupp 𝑊)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {crab 3145 Vcvv 3497 class class class wbr 5069 ∘ ccom 5562 ⟶wf 6354 –1-1→wf1 6355 –1-1-onto→wf1o 6357 ‘cfv 6358 (class class class)co 7159 ↑_m cmap 8409 finSupp cfsupp 8836

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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-supp 7834 df-1o 8105 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-fin 8516 df-fsupp 8837

This theorem is referenced by: mapfien 8874

W3C validator