![]() |
Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > finnzfsuppd | Structured version Visualization version GIF version |
Description: If a function is zero outside of a finite set, it has finite support. (Contributed by Rohan Ridenour, 13-May-2024.) |
Ref | Expression |
---|---|
finnzfsuppd.1 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
finnzfsuppd.2 | ⊢ (𝜑 → 𝐹 Fn 𝐷) |
finnzfsuppd.3 | ⊢ (𝜑 → 𝑍 ∈ 𝑈) |
finnzfsuppd.4 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
finnzfsuppd.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑥 ∈ 𝐴 ∨ (𝐹‘𝑥) = 𝑍)) |
Ref | Expression |
---|---|
finnzfsuppd | ⊢ (𝜑 → 𝐹 finSupp 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | finnzfsuppd.4 | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
2 | finnzfsuppd.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐹 Fn 𝐷) | |
3 | finnzfsuppd.1 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
4 | 3, 2 | fndmexd 7597 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ V) |
5 | finnzfsuppd.3 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ 𝑈) | |
6 | elsuppfn 7821 | . . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐷 ∈ V ∧ 𝑍 ∈ 𝑈) → (𝑥 ∈ (𝐹 supp 𝑍) ↔ (𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) ≠ 𝑍))) | |
7 | 2, 4, 5, 6 | syl3anc 1368 | . . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (𝐹 supp 𝑍) ↔ (𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) ≠ 𝑍))) |
8 | 7 | biimpa 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → (𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) ≠ 𝑍)) |
9 | 8 | simpld 498 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → 𝑥 ∈ 𝐷) |
10 | finnzfsuppd.5 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑥 ∈ 𝐴 ∨ (𝐹‘𝑥) = 𝑍)) | |
11 | 9, 10 | syldan 594 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → (𝑥 ∈ 𝐴 ∨ (𝐹‘𝑥) = 𝑍)) |
12 | 8 | simprd 499 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → (𝐹‘𝑥) ≠ 𝑍) |
13 | 12 | neneqd 2992 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → ¬ (𝐹‘𝑥) = 𝑍) |
14 | 11, 13 | olcnd 874 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → 𝑥 ∈ 𝐴) |
15 | 14 | ex 416 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐹 supp 𝑍) → 𝑥 ∈ 𝐴)) |
16 | 15 | ssrdv 3921 | . . 3 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝐴) |
17 | 1, 16 | ssfid 8725 | . 2 ⊢ (𝜑 → (𝐹 supp 𝑍) ∈ Fin) |
18 | fnfun 6423 | . . . 4 ⊢ (𝐹 Fn 𝐷 → Fun 𝐹) | |
19 | 2, 18 | syl 17 | . . 3 ⊢ (𝜑 → Fun 𝐹) |
20 | funisfsupp 8822 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑈) → (𝐹 finSupp 𝑍 ↔ (𝐹 supp 𝑍) ∈ Fin)) | |
21 | 19, 3, 5, 20 | syl3anc 1368 | . 2 ⊢ (𝜑 → (𝐹 finSupp 𝑍 ↔ (𝐹 supp 𝑍) ∈ Fin)) |
22 | 17, 21 | mpbird 260 | 1 ⊢ (𝜑 → 𝐹 finSupp 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 Vcvv 3441 class class class wbr 5030 Fun wfun 6318 Fn wfn 6319 ‘cfv 6324 (class class class)co 7135 supp csupp 7813 Fincfn 8492 finSupp cfsupp 8817 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-supp 7814 df-er 8272 df-en 8493 df-fin 8496 df-fsupp 8818 |
This theorem is referenced by: mnringmulrcld 40936 |
Copyright terms: Public domain | W3C validator |