Theorem suppcoss 8143

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 8138, 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 6686	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
3	1, 2	sylib 217	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ran 𝐹)
4		suppcoss.g	. . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
5	3, 4	fcod 6699	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺):𝐵⟶ran 𝐹)
6		eldif 3923	. . . . 5 ⊢ (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)))
7	4	ffnd 6674	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 Fn 𝐵)
8		suppcoss.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
9		suppcoss.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
10		elsuppfn 8107	. . . . . . . . 9 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑊 ∧ 𝑌 ∈ 𝑉) → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
11	7, 8, 9, 10	syl3anc 1371	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
12	11	notbid 317	. . . . . . 7 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑌) ↔ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
13	12	anbi2d 629	. . . . . 6 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌))))
14		annotanannot 833	. . . . . 6 ⊢ ((𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌))
15	13, 14	bitrdi 286	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
16	6, 15	bitrid 282	. . . 4 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
17		nne 2943	. . . . . 6 ⊢ (¬ (𝐺‘𝑘) ≠ 𝑌 ↔ (𝐺‘𝑘) = 𝑌)
18	17	anbi2i 623	. . . . 5 ⊢ ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌))
19	4	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝐺:𝐵⟶𝐴)
20		simprl 769	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝑘 ∈ 𝐵)
21	19, 20	fvco3d 6946	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘)))
22		simprr 771	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐺‘𝑘) = 𝑌)
23	22	fveq2d 6851	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘(𝐺‘𝑘)) = (𝐹‘𝑌))
24		suppcoss.1	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝑌) = 𝑍)
25	24	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘𝑌) = 𝑍)
26	21, 23, 25	3eqtrd 2775	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
27	26	ex 413	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
28	18, 27	biimtrid 241	. . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
29	16, 28	sylbid 239	. . 3 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
30	29	imp 407	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌))) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
31	5, 30	suppss 8130	1 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106   ≠ wne 2939   ∖ cdif 3910   ⊆ wss 3913  ran crn 5639   ∘ ccom 5642   Fn wfn 6496  ⟶wf 6497  ‘cfv 6501  (class class class)co 7362   supp csupp 8097

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5247  ax-sep 5261  ax-nul 5268  ax-pr 5389  ax-un 7677

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-ov 7365  df-oprab 7366  df-mpo 7367  df-supp 8098

This theorem is referenced by:  mplsubglem  21442  mhpinvcl  21579