Theorem suppcoss 8023

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 8018, 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 6613	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
3	1, 2	sylib 217	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ran 𝐹)
4		suppcoss.g	. . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
5	3, 4	fcod 6626	. 2 ⊢ (𝜑 → (𝐹 ∘ 𝐺):𝐵⟶ran 𝐹)
6		eldif 3897	. . . . 5 ⊢ (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)))
7	4	ffnd 6601	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 Fn 𝐵)
8		suppcoss.b	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
9		suppcoss.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
10		elsuppfn 7987	. . . . . . . . 9 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑊 ∧ 𝑌 ∈ 𝑉) → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
11	7, 8, 9, 10	syl3anc 1370	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
12	11	notbid 318	. . . . . . 7 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑌) ↔ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
13	12	anbi2d 629	. . . . . 6 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌))))
14		annotanannot 832	. . . . . 6 ⊢ ((𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌))
15	13, 14	bitrdi 287	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
16	6, 15	bitrid 282	. . . 4 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
17		nne 2947	. . . . . 6 ⊢ (¬ (𝐺‘𝑘) ≠ 𝑌 ↔ (𝐺‘𝑘) = 𝑌)
18	17	anbi2i 623	. . . . 5 ⊢ ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌))
19	4	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝐺:𝐵⟶𝐴)
20		simprl 768	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝑘 ∈ 𝐵)
21	19, 20	fvco3d 6868	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘)))
22		simprr 770	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐺‘𝑘) = 𝑌)
23	22	fveq2d 6778	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘(𝐺‘𝑘)) = (𝐹‘𝑌))
24		suppcoss.1	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝑌) = 𝑍)
25	24	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘𝑌) = 𝑍)
26	21, 23, 25	3eqtrd 2782	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
27	26	ex 413	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
28	18, 27	syl5bi 241	. . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
29	16, 28	sylbid 239	. . 3 ⊢ (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
30	29	imp 407	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌))) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
31	5, 30	suppss 8010	1 ⊢ (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106   ≠ wne 2943   ∖ cdif 3884   ⊆ wss 3887  ran crn 5590   ∘ ccom 5593   Fn wfn 6428  ⟶wf 6429  ‘cfv 6433  (class class class)co 7275   supp csupp 7977

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-supp 7978

This theorem is referenced by:  mplsubglem  21205  mhpinvcl  21342