![]() |
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 7904 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ V) |
5 | finnzfsuppd.3 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ 𝑈) | |
6 | elsuppfn 8167 | . . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐷 ∈ V ∧ 𝑍 ∈ 𝑈) → (𝑥 ∈ (𝐹 supp 𝑍) ↔ (𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) ≠ 𝑍))) | |
7 | 2, 4, 5, 6 | syl3anc 1369 | . . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (𝐹 supp 𝑍) ↔ (𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) ≠ 𝑍))) |
8 | 7 | biimpa 476 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → (𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) ≠ 𝑍)) |
9 | 8 | simpld 494 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → 𝑥 ∈ 𝐷) |
10 | finnzfsuppd.5 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝑥 ∈ 𝐴 ∨ (𝐹‘𝑥) = 𝑍)) | |
11 | 9, 10 | syldan 590 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → (𝑥 ∈ 𝐴 ∨ (𝐹‘𝑥) = 𝑍)) |
12 | 8 | simprd 495 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → (𝐹‘𝑥) ≠ 𝑍) |
13 | 12 | neneqd 2940 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → ¬ (𝐹‘𝑥) = 𝑍) |
14 | 11, 13 | olcnd 876 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐹 supp 𝑍)) → 𝑥 ∈ 𝐴) |
15 | 14 | ex 412 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐹 supp 𝑍) → 𝑥 ∈ 𝐴)) |
16 | 15 | ssrdv 3984 | . . 3 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝐴) |
17 | 1, 16 | ssfid 9281 | . 2 ⊢ (𝜑 → (𝐹 supp 𝑍) ∈ Fin) |
18 | fnfun 6648 | . . . 4 ⊢ (𝐹 Fn 𝐷 → Fun 𝐹) | |
19 | 2, 18 | syl 17 | . . 3 ⊢ (𝜑 → Fun 𝐹) |
20 | funisfsupp 9381 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑈) → (𝐹 finSupp 𝑍 ↔ (𝐹 supp 𝑍) ∈ Fin)) | |
21 | 19, 3, 5, 20 | syl3anc 1369 | . 2 ⊢ (𝜑 → (𝐹 finSupp 𝑍 ↔ (𝐹 supp 𝑍) ∈ Fin)) |
22 | 17, 21 | mpbird 257 | 1 ⊢ (𝜑 → 𝐹 finSupp 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 846 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 Vcvv 3469 class class class wbr 5142 Fun wfun 6536 Fn wfn 6537 ‘cfv 6542 (class class class)co 7414 supp csupp 8157 Fincfn 8953 finSupp cfsupp 9375 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pr 5423 ax-un 7732 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-ral 3057 df-rex 3066 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7863 df-supp 8158 df-1o 8478 df-en 8954 df-fin 8957 df-fsupp 9376 |
This theorem is referenced by: mnringmulrcld 43578 |
Copyright terms: Public domain | W3C validator |