Theorem suppcoss 7994

Description: The support of the composition of two functions is a subset of the support of the inner function if the outer function preserves zero. Compare suppssfv 7989, which has a sethood condition on 𝐴 instead of 𝐵. (Contributed by SN, 25-May-2024.)

Hypotheses

Ref	Expression
suppcoss.f	⊢ (𝜑 → 𝐹 Fn 𝐴)
suppcoss.g	⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
suppcoss.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
suppcoss.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
suppcoss.1	⊢ (𝜑 → (𝐹‘𝑌) = 𝑍)

Assertion

Ref	Expression
suppcoss	⊢ (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))

Proof of Theorem suppcoss

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppcoss.f	. . . 4 ⊢ (𝜑 → 𝐹 Fn 𝐴)
2		dffn3 6597	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
3	1, 2	sylib 217	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ran 𝐹)
4		suppcoss.g	. . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
5	3, 4	fcod 6610	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺):𝐵⟶ran 𝐹)
6		eldif 3893	. . . . 5 ⊢ (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)))
7	4	ffnd 6585	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 Fn 𝐵)
8		suppcoss.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
9		suppcoss.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
10		elsuppfn 7958	. . . . . . . . 9 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑊 ∧ 𝑌 ∈ 𝑉) → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
11	7, 8, 9, 10	syl3anc 1369	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
12	11	notbid 317	. . . . . . 7 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑌) ↔ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
13	12	anbi2d 628	. . . . . 6 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌))))
14		annotanannot 831	. . . . . 6 ⊢ ((𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌))
15	13, 14	bitrdi 286	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
16	6, 15	syl5bb 282	. . . 4 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
17		nne 2946	. . . . . 6 ⊢ (¬ (𝐺‘𝑘) ≠ 𝑌 ↔ (𝐺‘𝑘) = 𝑌)
18	17	anbi2i 622	. . . . 5 ⊢ ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌))
19	4	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝐺:𝐵⟶𝐴)
20		simprl 767	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝑘 ∈ 𝐵)
21	19, 20	fvco3d 6850	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘)))
22		simprr 769	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐺‘𝑘) = 𝑌)
23	22	fveq2d 6760	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘(𝐺‘𝑘)) = (𝐹‘𝑌))
24		suppcoss.1	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝑌) = 𝑍)
25	24	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘𝑌) = 𝑍)
26	21, 23, 25	3eqtrd 2782	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
27	26	ex 412	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
28	18, 27	syl5bi 241	. . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
29	16, 28	sylbid 239	. . 3 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
30	29	imp 406	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌))) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
31	5, 30	suppss 7981	1 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942   ∖ cdif 3880   ⊆ wss 3883  ran crn 5581   ∘ ccom 5584   Fn wfn 6413  ⟶wf 6414  ‘cfv 6418  (class class class)co 7255   supp csupp 7948

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-supp 7949

This theorem is referenced by:  mplsubglem  21115  mhpinvcl  21252