Theorem suppofss2d 8141

Description: Condition for the support of a function operation to be a subset of the support of the right function term. (Contributed by Thierry Arnoux, 21-Jun-2019.)

Hypotheses

Ref	Expression
suppofssd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
suppofssd.2	⊢ (𝜑 → 𝑍 ∈ 𝐵)
suppofssd.3	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
suppofssd.4	⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
suppofss2d.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥𝑋𝑍) = 𝑍)

Assertion

Ref	Expression
suppofss2d	⊢ (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑍))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝐺   𝑥,𝑋   𝑥,𝑍   𝜑,𝑥

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem suppofss2d

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppofssd.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2	1	ffnd 6658	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴)
3		suppofssd.4	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
4	3	ffnd 6658	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴)
5		suppofssd.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		inidm 4176	. . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7		eqidd 2732	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦))
8		eqidd 2732	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦))
9	2, 4, 5, 5, 6, 7, 8	ofval 7627	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = ((𝐹‘𝑦)𝑋(𝐺‘𝑦)))
10	9	adantr 480	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐺‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = ((𝐹‘𝑦)𝑋(𝐺‘𝑦)))
11		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐺‘𝑦) = 𝑍) → (𝐺‘𝑦) = 𝑍)
12	11	oveq2d 7368	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐺‘𝑦) = 𝑍) → ((𝐹‘𝑦)𝑋(𝐺‘𝑦)) = ((𝐹‘𝑦)𝑋𝑍))
13		suppofss2d.5	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥𝑋𝑍) = 𝑍)
14	13	ralrimiva 3124	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥𝑋𝑍) = 𝑍)
15	14	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∀𝑥 ∈ 𝐵 (𝑥𝑋𝑍) = 𝑍)
16	1	ffvelcdmda 7023	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ 𝐵)
17		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐹‘𝑦)) → 𝑥 = (𝐹‘𝑦))
18	17	oveq1d 7367	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐹‘𝑦)) → (𝑥𝑋𝑍) = ((𝐹‘𝑦)𝑋𝑍))
19	18	eqeq1d 2733	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐹‘𝑦)) → ((𝑥𝑋𝑍) = 𝑍 ↔ ((𝐹‘𝑦)𝑋𝑍) = 𝑍))
20	16, 19	rspcdv 3564	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐵 (𝑥𝑋𝑍) = 𝑍 → ((𝐹‘𝑦)𝑋𝑍) = 𝑍))
21	15, 20	mpd 15	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹‘𝑦)𝑋𝑍) = 𝑍)
22	21	adantr 480	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐺‘𝑦) = 𝑍) → ((𝐹‘𝑦)𝑋𝑍) = 𝑍)
23	10, 12, 22	3eqtrd 2770	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐺‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍)
24	23	ex 412	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐺‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍))
25	24	ralrimiva 3124	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ((𝐺‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍))
26	2, 4, 5, 5, 6	offn 7629	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑋𝐺) Fn 𝐴)
27		ssidd 3953	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐴)
28		suppofssd.2	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
29		suppfnss 8125	. . 3 ⊢ ((((𝐹 ∘f 𝑋𝐺) Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑍 ∈ 𝐵)) → (∀𝑦 ∈ 𝐴 ((𝐺‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑍)))
30	26, 4, 27, 5, 28, 29	syl23anc 1379	. 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ((𝐺‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑍)))
31	25, 30	mpd 15	1 ⊢ (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑍))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∀wral 3047   ⊆ wss 3897   Fn wfn 6482  ⟶wf 6483  ‘cfv 6487  (class class class)co 7352   ∘_f cof 7614   supp csupp 8096

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pr 5372  ax-un 7674

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-ov 7355  df-oprab 7356  df-mpo 7357  df-of 7616  df-supp 8097

This theorem is referenced by:  frlmphl  21724