![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > suppss | Structured version Visualization version GIF version |
Description: Show that the support of a function is contained in a set. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by AV, 28-May-2019.) (Proof shortened by SN, 5-Aug-2024.) |
Ref | Expression |
---|---|
suppss.f | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
suppss.n | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
Ref | Expression |
---|---|
suppss | ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | suppss.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
2 | 1 | ffnd 6719 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
3 | 2 | adantl 483 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝐹 Fn 𝐴) |
4 | simpll 766 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝐹 ∈ V) | |
5 | simplr 768 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝑍 ∈ V) | |
6 | elsuppfng 8155 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍))) | |
7 | 3, 4, 5, 6 | syl3anc 1372 | . . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍))) |
8 | eldif 3959 | . . . . . . . . 9 ⊢ (𝑘 ∈ (𝐴 ∖ 𝑊) ↔ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ 𝑊)) | |
9 | suppss.n | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) | |
10 | 9 | adantll 713 | . . . . . . . . 9 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
11 | 8, 10 | sylan2br 596 | . . . . . . . 8 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
12 | 11 | expr 458 | . . . . . . 7 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ 𝐴) → (¬ 𝑘 ∈ 𝑊 → (𝐹‘𝑘) = 𝑍)) |
13 | 12 | necon1ad 2958 | . . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ 𝐴) → ((𝐹‘𝑘) ≠ 𝑍 → 𝑘 ∈ 𝑊)) |
14 | 13 | expimpd 455 | . . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → ((𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) → 𝑘 ∈ 𝑊)) |
15 | 7, 14 | sylbid 239 | . . . 4 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝑘 ∈ (𝐹 supp 𝑍) → 𝑘 ∈ 𝑊)) |
16 | 15 | ssrdv 3989 | . . 3 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) ⊆ 𝑊) |
17 | 16 | ex 414 | . 2 ⊢ ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)) |
18 | supp0prc 8149 | . . . 4 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅) | |
19 | 0ss 4397 | . . . 4 ⊢ ∅ ⊆ 𝑊 | |
20 | 18, 19 | eqsstrdi 4037 | . . 3 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) ⊆ 𝑊) |
21 | 20 | a1d 25 | . 2 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)) |
22 | 17, 21 | pm2.61i 182 | 1 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 Vcvv 3475 ∖ cdif 3946 ⊆ wss 3949 ∅c0 4323 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 supp csupp 8146 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5428 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-sbc 3779 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-supp 8147 |
This theorem is referenced by: suppofssd 8188 suppcoss 8192 fsuppco2 9398 fsuppcor 9399 cantnfp1lem1 9673 cantnfp1lem3 9675 gsumzaddlem 19789 gsumzmhm 19805 gsum2d2lem 19841 lcomfsupp 20512 frlmssuvc1 21349 frlmsslsp 21351 frlmup2 21354 psrbaglesupp 21477 psrbaglesuppOLD 21478 mvrcl 21551 mplsubglem 21558 mpllsslem 21559 mplsubrglem 21563 evlslem3 21643 mhpvscacl 21697 deg1mul3le 25634 jensen 26493 suppovss 31937 fsuppcurry1 31981 fsuppcurry2 31982 resf1o 31986 suppssnn0 32048 fedgmullem1 32745 cantnfub 42119 cantnfresb 42122 |
Copyright terms: Public domain | W3C validator |