![]() |
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 6724 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
3 | 2 | adantl 480 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝐹 Fn 𝐴) |
4 | simpll 765 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝐹 ∈ V) | |
5 | simplr 767 | . . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝑍 ∈ V) | |
6 | elsuppfng 8174 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍))) | |
7 | 3, 4, 5, 6 | syl3anc 1368 | . . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍))) |
8 | eldif 3954 | . . . . . . . . 9 ⊢ (𝑘 ∈ (𝐴 ∖ 𝑊) ↔ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ 𝑊)) | |
9 | suppss.n | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) | |
10 | 9 | adantll 712 | . . . . . . . . 9 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
11 | 8, 10 | sylan2br 593 | . . . . . . . 8 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ 𝑊)) → (𝐹‘𝑘) = 𝑍) |
12 | 11 | expr 455 | . . . . . . 7 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ 𝐴) → (¬ 𝑘 ∈ 𝑊 → (𝐹‘𝑘) = 𝑍)) |
13 | 12 | necon1ad 2946 | . . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ 𝐴) → ((𝐹‘𝑘) ≠ 𝑍 → 𝑘 ∈ 𝑊)) |
14 | 13 | expimpd 452 | . . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → ((𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) → 𝑘 ∈ 𝑊)) |
15 | 7, 14 | sylbid 239 | . . . 4 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝑘 ∈ (𝐹 supp 𝑍) → 𝑘 ∈ 𝑊)) |
16 | 15 | ssrdv 3982 | . . 3 ⊢ (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) ⊆ 𝑊) |
17 | 16 | ex 411 | . 2 ⊢ ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)) |
18 | supp0prc 8168 | . . . 4 ⊢ (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅) | |
19 | 0ss 4398 | . . . 4 ⊢ ∅ ⊆ 𝑊 | |
20 | 18, 19 | eqsstrdi 4031 | . . 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 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2929 Vcvv 3461 ∖ cdif 3941 ⊆ wss 3944 ∅c0 4322 Fn wfn 6544 ⟶wf 6545 ‘cfv 6549 (class class class)co 7419 supp csupp 8165 |
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 2696 ax-sep 5300 ax-nul 5307 ax-pr 5429 ax-un 7741 |
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 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-sbc 3774 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-br 5150 df-opab 5212 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-fv 6557 df-ov 7422 df-oprab 7423 df-mpo 7424 df-supp 8166 |
This theorem is referenced by: suppofssd 8209 suppcoss 8213 fsuppco2 9428 fsuppcor 9429 cantnfp1lem1 9703 cantnfp1lem3 9705 gsumzaddlem 19888 gsumzmhm 19904 gsum2d2lem 19940 lcomfsupp 20797 frlmssuvc1 21745 frlmsslsp 21747 frlmup2 21750 psrbaglesupp 21874 psrbaglesuppOLD 21875 mvrcl 21954 mplsubglem 21961 mpllsslem 21962 mplsubrglem 21966 evlslem3 22048 mhpvscacl 22101 deg1mul3le 26097 jensen 26966 suppovss 32547 fsuppcurry1 32589 fsuppcurry2 32590 resf1o 32594 suppssnn0 32657 fedgmullem1 33455 cantnfub 42889 cantnfresb 42892 |
Copyright terms: Public domain | W3C validator |