Theorem suppofss1d 8214

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

Hypotheses

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

Assertion

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

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

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem suppofss1d

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppofssd.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2	1	ffnd 6726	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴)
3		suppofssd.4	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
4	3	ffnd 6726	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴)
5		suppofssd.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		inidm 4219	. . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7		eqidd 2728	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦))
8		eqidd 2728	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦))
9	2, 4, 5, 5, 6, 7, 8	ofval 7700	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = ((𝐹‘𝑦)𝑋(𝐺‘𝑦)))
10	9	adantr 479	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = ((𝐹‘𝑦)𝑋(𝐺‘𝑦)))
11		simpr 483	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → (𝐹‘𝑦) = 𝑍)
12	11	oveq1d 7439	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → ((𝐹‘𝑦)𝑋(𝐺‘𝑦)) = (𝑍𝑋(𝐺‘𝑦)))
13		suppofss1d.5	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑍𝑋𝑥) = 𝑍)
14	13	ralrimiva 3142	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍𝑋𝑥) = 𝑍)
15	14	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∀𝑥 ∈ 𝐵 (𝑍𝑋𝑥) = 𝑍)
16	3	ffvelcdmda 7097	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) ∈ 𝐵)
17		simpr 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐺‘𝑦)) → 𝑥 = (𝐺‘𝑦))
18	17	oveq2d 7440	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐺‘𝑦)) → (𝑍𝑋𝑥) = (𝑍𝑋(𝐺‘𝑦)))
19	18	eqeq1d 2729	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐺‘𝑦)) → ((𝑍𝑋𝑥) = 𝑍 ↔ (𝑍𝑋(𝐺‘𝑦)) = 𝑍))
20	16, 19	rspcdv 3601	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐵 (𝑍𝑋𝑥) = 𝑍 → (𝑍𝑋(𝐺‘𝑦)) = 𝑍))
21	15, 20	mpd 15	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝑍𝑋(𝐺‘𝑦)) = 𝑍)
22	21	adantr 479	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → (𝑍𝑋(𝐺‘𝑦)) = 𝑍)
23	10, 12, 22	3eqtrd 2771	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍)
24	23	ex 411	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍))
25	24	ralrimiva 3142	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍))
26	2, 4, 5, 5, 6	offn 7702	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑋𝐺) Fn 𝐴)
27		ssidd 4003	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐴)
28		suppofssd.2	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
29		suppfnss 8198	. . 3 ⊢ ((((𝐹 ∘f 𝑋𝐺) Fn 𝐴 ∧ 𝐹 Fn 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑍 ∈ 𝐵)) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
30	26, 2, 27, 5, 28, 29	syl23anc 1374	. 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
31	25, 30	mpd 15	1 ⊢ (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍))

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1533   ∈ wcel 2098  ∀wral 3057   ⊆ wss 3947   Fn wfn 6546  ⟶wf 6547  ‘cfv 6551  (class class class)co 7424   ∘_f cof 7687   supp csupp 8169

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-rep 5287  ax-sep 5301  ax-nul 5308  ax-pr 5431  ax-un 7744

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-ral 3058  df-rex 3067  df-reu 3373  df-rab 3429  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4325  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4911  df-iun 5000  df-br 5151  df-opab 5213  df-mpt 5234  df-id 5578  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-rn 5691  df-res 5692  df-ima 5693  df-iota 6503  df-fun 6553  df-fn 6554  df-f 6555  df-f1 6556  df-fo 6557  df-f1o 6558  df-fv 6559  df-ov 7427  df-oprab 7428  df-mpo 7429  df-of 7689  df-supp 8170

This theorem is referenced by:  frlmphllem  21719  rrxcph  25338