Theorem funsssuppss 8141

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 6540	. . . . . . . . . 10 ⊢ (𝐹 ⊆ 𝐺 → (Fun 𝐺 → Fun 𝐹))
2	1	impcom 408	. . . . . . . . 9 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → Fun 𝐹)
3	2	funfnd 6552	. . . . . . . 8 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → 𝐹 Fn dom 𝐹)
4		funfn 6551	. . . . . . . . . 10 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺)
5	4	biimpi 215	. . . . . . . . 9 ⊢ (Fun 𝐺 → 𝐺 Fn dom 𝐺)
6	5	adantr 481	. . . . . . . 8 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → 𝐺 Fn dom 𝐺)
7	3, 6	jca 512	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → (𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺))
8	7	3adant3 1132	. . . . . 6 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺))
9	8	adantr 481	. . . . 5 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → (𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺))
10		dmss 5878	. . . . . . . 8 ⊢ (𝐹 ⊆ 𝐺 → dom 𝐹 ⊆ dom 𝐺)
11	10	3ad2ant2 1134	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → dom 𝐹 ⊆ dom 𝐺)
12	11	adantr 481	. . . . . 6 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → dom 𝐹 ⊆ dom 𝐺)
13		dmexg 7860	. . . . . . . 8 ⊢ (𝐺 ∈ 𝑉 → dom 𝐺 ∈ V)
14	13	3ad2ant3 1135	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → dom 𝐺 ∈ V)
15	14	adantr 481	. . . . . 6 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → dom 𝐺 ∈ V)
16		simpr 485	. . . . . 6 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
17	12, 15, 16	3jca 1128	. . . . 5 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → (dom 𝐹 ⊆ dom 𝐺 ∧ dom 𝐺 ∈ V ∧ 𝑍 ∈ V))
18	9, 17	jca 512	. . . 4 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → ((𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺) ∧ (dom 𝐹 ⊆ dom 𝐺 ∧ dom 𝐺 ∈ V ∧ 𝑍 ∈ V)))
19		funssfv 6883	. . . . . . . . 9 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝑥 ∈ dom 𝐹) → (𝐺‘𝑥) = (𝐹‘𝑥))
20	19	3expa 1118	. . . . . . . 8 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) ∧ 𝑥 ∈ dom 𝐹) → (𝐺‘𝑥) = (𝐹‘𝑥))
21		eqeq1 2735	. . . . . . . . 9 ⊢ ((𝐺‘𝑥) = (𝐹‘𝑥) → ((𝐺‘𝑥) = 𝑍 ↔ (𝐹‘𝑥) = 𝑍))
22	21	biimpd 228	. . . . . . . 8 ⊢ ((𝐺‘𝑥) = (𝐹‘𝑥) → ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
23	20, 22	syl 17	. . . . . . 7 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) ∧ 𝑥 ∈ dom 𝐹) → ((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
24	23	ralrimiva 3145	. . . . . 6 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺) → ∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
25	24	3adant3 1132	. . . . 5 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → ∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
26	25	adantr 481	. . . 4 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → ∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍))
27		suppfnss 8140	. . . 4 ⊢ (((𝐹 Fn dom 𝐹 ∧ 𝐺 Fn dom 𝐺) ∧ (dom 𝐹 ⊆ dom 𝐺 ∧ dom 𝐺 ∈ V ∧ 𝑍 ∈ V)) → (∀𝑥 ∈ dom 𝐹((𝐺‘𝑥) = 𝑍 → (𝐹‘𝑥) = 𝑍) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))
28	18, 26, 27	sylc 65	. . 3 ⊢ (((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))
29	28	expcom 414	. 2 ⊢ (𝑍 ∈ V → ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))
30		ssid 3984	. . . 4 ⊢ ∅ ⊆ ∅
31		simpr 485	. . . . . 6 ⊢ ((𝐹 ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
32		supp0prc 8115	. . . . . 6 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅)
33	31, 32	nsyl5 159	. . . . 5 ⊢ (¬ 𝑍 ∈ V → (𝐹 supp 𝑍) = ∅)
34		simpr 485	. . . . . 6 ⊢ ((𝐺 ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
35		supp0prc 8115	. . . . . 6 ⊢ (¬ (𝐺 ∈ V ∧ 𝑍 ∈ V) → (𝐺 supp 𝑍) = ∅)
36	34, 35	nsyl5 159	. . . . 5 ⊢ (¬ 𝑍 ∈ V → (𝐺 supp 𝑍) = ∅)
37	33, 36	sseq12d 3995	. . . 4 ⊢ (¬ 𝑍 ∈ V → ((𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍) ↔ ∅ ⊆ ∅))
38	30, 37	mpbiri 257	. . 3 ⊢ (¬ 𝑍 ∈ V → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))
39	38	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍)))
40	29, 39	pm2.61i 182	1 ⊢ ((Fun 𝐺 ∧ 𝐹 ⊆ 𝐺 ∧ 𝐺 ∈ 𝑉) → (𝐹 supp 𝑍) ⊆ (𝐺 supp 𝑍))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3060  Vcvv 3459   ⊆ wss 3928  ∅c0 4302  dom cdm 5653  Fun wfun 6510   Fn wfn 6511  ‘cfv 6516  (class class class)co 7377   supp csupp 8112

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5262  ax-sep 5276  ax-nul 5283  ax-pr 5404  ax-un 7692

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3365  df-rab 3419  df-v 3461  df-sbc 3758  df-csb 3874  df-dif 3931  df-un 3933  df-in 3935  df-ss 3945  df-nul 4303  df-if 4507  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4886  df-iun 4976  df-br 5126  df-opab 5188  df-mpt 5209  df-id 5551  df-xp 5659  df-rel 5660  df-cnv 5661  df-co 5662  df-dm 5663  df-rn 5664  df-res 5665  df-ima 5666  df-iota 6468  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7380  df-oprab 7381  df-mpo 7382  df-supp 8113

This theorem is referenced by:  tdeglem4  25476  tdeglem4OLD  25477