Theorem suppfnss 8213

Description: The support of a function which has the same zero values (in its domain) as another function is a subset of the support of this other function. (Contributed by AV, 30-Apr-2019.) (Proof shortened by AV, 6-Jun-2022.)

Assertion

Ref	Expression
suppfnss	⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝑥,𝑍

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem suppfnss

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr1 1193	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → 𝐴 ⊆ 𝐵)
2		fndm 6672	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
3	2	ad2antrr 726	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → dom 𝐹 = 𝐴)
4		fndm 6672	. . . . . . 7 ⊢ (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
5	4	ad2antlr 727	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → dom 𝐺 = 𝐵)
6	1, 3, 5	3sstr4d 4043	. . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → dom 𝐹 ⊆ dom 𝐺)
7	6	adantr 480	. . . 4 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) → dom 𝐹 ⊆ dom 𝐺)
8	2	eleq2d 2825	. . . . . . . . . . . 12 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ dom 𝐹 ↔ 𝑦 ∈ 𝐴))
9	8	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (𝑦 ∈ dom 𝐹 ↔ 𝑦 ∈ 𝐴))
10		fveqeq2 6916	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝐺‘𝑥) = 𝑍 ↔ (𝐺‘𝑦) = 𝑍))
11		fveqeq2 6916	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) = 𝑍 ↔ (𝐹‘𝑦) = 𝑍))
12	10, 11	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → (((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) ↔ ((𝐺‘𝑦) = 𝑍 → (𝐹‘𝑦) = 𝑍)))
13	12	rspcv 3618	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → ((𝐺‘𝑦) = 𝑍 → (𝐹‘𝑦) = 𝑍)))
14	9, 13	biimtrdi 253	. . . . . . . . . 10 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (𝑦 ∈ dom 𝐹 → (∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → ((𝐺‘𝑦) = 𝑍 → (𝐹‘𝑦) = 𝑍))))
15	14	com23 86	. . . . . . . . 9 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → (𝑦 ∈ dom 𝐹 → ((𝐺‘𝑦) = 𝑍 → (𝐹‘𝑦) = 𝑍))))
16	15	imp31 417	. . . . . . . 8 ⊢ (((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) ∧ 𝑦 ∈ dom 𝐹) → ((𝐺‘𝑦) = 𝑍 → (𝐹‘𝑦) = 𝑍))
17	16	necon3d 2959	. . . . . . 7 ⊢ (((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) ∧ 𝑦 ∈ dom 𝐹) → ((𝐹‘𝑦) ≠ 𝑍 → (𝐺‘𝑦) ≠ 𝑍))
18	17	ex 412	. . . . . 6 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) → (𝑦 ∈ dom 𝐹 → ((𝐹‘𝑦) ≠ 𝑍 → (𝐺‘𝑦) ≠ 𝑍)))
19	18	com23 86	. . . . 5 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) → ((𝐹‘𝑦) ≠ 𝑍 → (𝑦 ∈ dom 𝐹 → (𝐺‘𝑦) ≠ 𝑍)))
20	19	3imp 1110	. . . 4 ⊢ (((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) ∧ (𝐹‘𝑦) ≠ 𝑍 ∧ 𝑦 ∈ dom 𝐹) → (𝐺‘𝑦) ≠ 𝑍)
21	7, 20	rabssrabd 4093	. . 3 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) → {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ≠ 𝑍} ⊆ {𝑦 ∈ dom 𝐺 ∣ (𝐺‘𝑦) ≠ 𝑍})
22		fnfun 6669	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
23	22	ad2antrr 726	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → Fun 𝐹)
24		simpl 482	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → 𝐹 Fn 𝐴)
25		ssexg 5329	. . . . . . . 8 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V)
26	25	3adant3 1131	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → 𝐴 ∈ V)
27		fnex 7237	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ V) → 𝐹 ∈ V)
28	24, 26, 27	syl2an 596	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → 𝐹 ∈ V)
29		simpr3 1195	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → 𝑍 ∈ 𝑊)
30		suppval1 8190	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ V ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) = {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ≠ 𝑍})
31	23, 28, 29, 30	syl3anc 1370	. . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (𝐹 supp 𝑍) = {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ≠ 𝑍})
32		fnfun 6669	. . . . . . 7 ⊢ (𝐺 Fn 𝐵 → Fun 𝐺)
33	32	ad2antlr 727	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → Fun 𝐺)
34		simpr 484	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → 𝐺 Fn 𝐵)
35		simp2 1136	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → 𝐵 ∈ 𝑉)
36		fnex 7237	. . . . . . 7 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐺 ∈ V)
37	34, 35, 36	syl2an 596	. . . . . 6 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → 𝐺 ∈ V)
38		suppval1 8190	. . . . . 6 ⊢ ((Fun 𝐺 ∧ 𝐺 ∈ V ∧ 𝑍 ∈ 𝑊) → (𝐺 supp 𝑍) = {𝑦 ∈ dom 𝐺 ∣ (𝐺‘𝑦) ≠ 𝑍})
39	33, 37, 29, 38	syl3anc 1370	. . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (𝐺 supp 𝑍) = {𝑦 ∈ dom 𝐺 ∣ (𝐺‘𝑦) ≠ 𝑍})
40	31, 39	sseq12d 4029	. . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → ((𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍) ↔ {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ≠ 𝑍} ⊆ {𝑦 ∈ dom 𝐺 ∣ (𝐺‘𝑦) ≠ 𝑍}))
41	40	adantr 480	. . 3 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) → ((𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍) ↔ {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ≠ 𝑍} ⊆ {𝑦 ∈ dom 𝐺 ∣ (𝐺‘𝑦) ≠ 𝑍}))
42	21, 41	mpbird 257	. 2 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) ∧ ∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍)) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))
43	42	ex 412	1 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊)) → (∀𝑥 ∈ 𝐴 ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106   ≠ wne 2938  ∀wral 3059  {crab 3433  Vcvv 3478   ⊆ wss 3963  dom cdm 5689  Fun wfun 6557   Fn wfn 6558  ‘cfv 6563  (class class class)co 7431   supp csupp 8184

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-supp 8185

This theorem is referenced by:  funsssuppss  8214  suppofss1d  8228  suppofss2d  8229  lincresunit2  48324