Theorem funsssuppss 8165

Description: The support of a function which is a subset of another function is a subset of the support of this other function. (Contributed by AV, 27-Jul-2019.)

Assertion

Ref	Expression
funsssuppss	⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))

Proof of Theorem funsssuppss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funss 6536	. . . . . . . . . 10 ⊢ (𝐹 ⊆ 𝐺 → (Fun 𝐺 → Fun 𝐹))
2	1	impcom 411	. . . . . . . . 9 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → Fun 𝐹)
3	2	funfnd 6548	. . . . . . . 8 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → 𝐹 Fn dom 𝐹)
4		funfn 6547	. . . . . . . . 9 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺)
5	4	birani 507	. . . . . . . 8 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → 𝐺 Fn dom 𝐺)
6	3, 5	jca 519	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → (𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺))
7	6	3adant3 1144	. . . . . 6 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺))
8	7	adantr 484	. . . . 5 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → (𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺))
9		dmss 5876	. . . . . . . 8 ⊢ (𝐹 ⊆ 𝐺 → dom 𝐹 ⊆ dom 𝐺)
10	9	3ad2ant2 1146	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → dom 𝐹 ⊆ dom 𝐺)
11	10	adantr 484	. . . . . 6 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → dom 𝐹 ⊆ dom 𝐺)
12		dmexg 7878	. . . . . . . 8 ⊢ (𝐺 ∈ 𝑉 → dom 𝐺 ∈ V)
13	12	3ad2ant3 1147	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → dom 𝐺 ∈ V)
14	13	adantr 484	. . . . . 6 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → dom 𝐺 ∈ V)
15		simpr 488	. . . . . 6 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
16	11, 14, 15	3jca 1140	. . . . 5 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → (dom 𝐹 ⊆ dom 𝐺 ∧ dom 𝐺 ∈ V ∧ 𝑍 ∈ V))
17	8, 16	jca 519	. . . 4 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → ((𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺) ∧ (dom 𝐹 ⊆ dom 𝐺 ∧ dom 𝐺 ∈ V ∧ 𝑍 ∈ V)))
18		funssfv 6884	. . . . . . . . 9 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝑥 ∈ dom 𝐹) → (𝐺‘𝑥) = (𝐹‘𝑥))
19	18	3expa 1130	. . . . . . . 8 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) ∧ 𝑥 ∈ dom 𝐹) → (𝐺‘𝑥) = (𝐹‘𝑥))
20		eqeq1 2765	. . . . . . . . 9 ⊢ ((𝐺‘𝑥) = (𝐹‘𝑥) → ((𝐺‘𝑥) = 𝑍 ↔ (𝐹‘𝑥) = 𝑍))
21	20	biimpd 231	. . . . . . . 8 ⊢ ((𝐺‘𝑥) = (𝐹‘𝑥) → ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
22	19, 21	syl 17	. . . . . . 7 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) ∧ 𝑥 ∈ dom 𝐹) → ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
23	22	ralrimiva 3153	. . . . . 6 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → ∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
24	23	3adant3 1144	. . . . 5 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → ∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
25	24	adantr 484	. . . 4 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → ∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
26		suppfnss 8164	. . . 4 ⊢ (((𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺) ∧ (dom 𝐹 ⊆ dom 𝐺 ∧ dom 𝐺 ∈ V ∧ 𝑍 ∈ V)) → (∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))
27	17, 25, 26	sylc 65	. . 3 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))
28	27	expcom 417	. 2 ⊢ (𝑍 ∈ V → ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))
29		ssid 3958	. . . 4 ⊢ ∅ ⊆ ∅
30		simpr 488	. . . . . 6 ⊢ ((𝐹 ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
31		supp0prc 8138	. . . . . 6 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅)
32	30, 31	nsyl5 159	. . . . 5 ⊢ (¬ 𝑍 ∈ V → (𝐹 supp 𝑍) = ∅)
33		simpr 488	. . . . . 6 ⊢ ((𝐺 ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
34		supp0prc 8138	. . . . . 6 ⊢ (¬ (𝐺 ∈ V ∧ 𝑍 ∈ V) → (𝐺 supp 𝑍) = ∅)
35	33, 34	nsyl5 159	. . . . 5 ⊢ (¬ 𝑍 ∈ V → (𝐺 supp 𝑍) = ∅)
36	32, 35	sseq12d 3969	. . . 4 ⊢ (¬ 𝑍 ∈ V → ((𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍) ↔ ∅ ⊆ ∅))
37	29, 36	mpbiri 260	. . 3 ⊢ (¬ 𝑍 ∈ V → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))
38	37	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))
39	28, 38	pm2.61i 183	1 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  Vcvv 3453   ⊆ wss 3904  ∅c0 4285  dom cdm 5645  Fun wfun 6511   Fn wfn 6512  ‘cfv 6517  (class class class)co 7392   supp csupp 8135

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pr 5389  ax-un 7714

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-supp 8136

This theorem is referenced by:  fsuppss  9326  tdeglem4  26100