Theorem suppco 8212

Description: The support of the composition of two functions is the inverse image by the inner function of the support of the outer function. (Contributed by AV, 30-May-2019.) Extract this statement from the proof of supp0cosupp0 8214. (Revised by SN, 15-Sep-2023.)

Assertion

Ref	Expression
suppco	⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍)))

Proof of Theorem suppco

Step	Hyp	Ref	Expression
1		coexg 7937	. . . . 5 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘ 𝐺) ∈ V)
2		simpl 482	. . . . 5 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → 𝑍 ∈ V)
3		suppimacnv 8179	. . . . 5 ⊢ (((𝐹 ∘ 𝐺) ∈ V ∧ 𝑍 ∈ V) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})))
4	1, 2, 3	syl2an2 685	. . . 4 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})))
5		cnvco 5888	. . . . . 6 ⊢ ◡(𝐹 ∘ 𝐺) = (◡𝐺 ∘ ◡𝐹)
6	5	imaeq1i 6060	. . . . 5 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍}))
7	6	a1i 11	. . . 4 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})))
8		imaco 6255	. . . . 5 ⊢ ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍})))
9		simprl 770	. . . . . . 7 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → 𝐹 ∈ 𝑉)
10		suppimacnv 8179	. . . . . . 7 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
11	9, 2, 10	syl2anc 583	. . . . . 6 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
12	11	imaeq2d 6063	. . . . 5 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → (◡𝐺 “ (𝐹 supp 𝑍)) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))))
13	8, 12	eqtr4id 2787	. . . 4 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) = (◡𝐺 “ (𝐹 supp 𝑍)))
14	4, 7, 13	3eqtrd 2772	. . 3 ⊢ ((𝑍 ∈ V ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍)))
15	14	ex 412	. 2 ⊢ (𝑍 ∈ V → ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍))))
16		prcnel 3495	. . . . . 6 ⊢ (¬ 𝑍 ∈ V → ¬ 𝑍 ∈ V)
17	16	intnand 488	. . . . 5 ⊢ (¬ 𝑍 ∈ V → ¬ ((𝐹 ∘ 𝐺) ∈ V ∧ 𝑍 ∈ V))
18		supp0prc 8168	. . . . 5 ⊢ (¬ ((𝐹 ∘ 𝐺) ∈ V ∧ 𝑍 ∈ V) → ((𝐹 ∘ 𝐺) supp 𝑍) = ∅)
19	17, 18	syl 17	. . . 4 ⊢ (¬ 𝑍 ∈ V → ((𝐹 ∘ 𝐺) supp 𝑍) = ∅)
20	16	intnand 488	. . . . . . 7 ⊢ (¬ 𝑍 ∈ V → ¬ (𝐹 ∈ V ∧ 𝑍 ∈ V))
21		supp0prc 8168	. . . . . . 7 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅)
22	20, 21	syl 17	. . . . . 6 ⊢ (¬ 𝑍 ∈ V → (𝐹 supp 𝑍) = ∅)
23	22	imaeq2d 6063	. . . . 5 ⊢ (¬ 𝑍 ∈ V → (◡𝐺 “ (𝐹 supp 𝑍)) = (◡𝐺 “ ∅))
24		ima0 6080	. . . . 5 ⊢ (◡𝐺 “ ∅) = ∅
25	23, 24	eqtrdi 2784	. . . 4 ⊢ (¬ 𝑍 ∈ V → (◡𝐺 “ (𝐹 supp 𝑍)) = ∅)
26	19, 25	eqtr4d 2771	. . 3 ⊢ (¬ 𝑍 ∈ V → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍)))
27	26	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍))))
28	15, 27	pm2.61i 182	1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → ((𝐹 ∘ 𝐺) supp 𝑍) = (◡𝐺 “ (𝐹 supp 𝑍)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1534   ∈ wcel 2099  Vcvv 3471   ∖ cdif 3944  ∅c0 4323  {csn 4629  ^◡ccnv 5677   “ cima 5681   ∘ ccom 5682  (class class class)co 7420   supp csupp 8165

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6500  df-fun 6550  df-fv 6556  df-ov 7423  df-oprab 7424  df-mpo 7425  df-supp 8166

This theorem is referenced by:  supp0cosupp0  8214  imacosupp  8215