Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fsuppsssupp | Structured version Visualization version GIF version |
Description: If the support of a function is a subset of the support of a finitely supported function, the function is finitely supported. (Contributed by AV, 2-Jul-2019.) (Proof shortened by AV, 15-Jul-2019.) |
Ref | Expression |
---|---|
fsuppsssupp | ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺) ∧ (𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → 𝐺 finSupp 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 763 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺) ∧ (𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → 𝐺 ∈ 𝑉) | |
2 | simplr 765 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺) ∧ (𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → Fun 𝐺) | |
3 | relfsupp 8823 | . . . 4 ⊢ Rel finSupp | |
4 | 3 | brrelex2i 5602 | . . 3 ⊢ (𝐹 finSupp 𝑍 → 𝑍 ∈ V) |
5 | 4 | ad2antrl 724 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺) ∧ (𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → 𝑍 ∈ V) |
6 | id 22 | . . . . 5 ⊢ (𝐹 finSupp 𝑍 → 𝐹 finSupp 𝑍) | |
7 | 6 | fsuppimpd 8828 | . . . 4 ⊢ (𝐹 finSupp 𝑍 → (𝐹 supp 𝑍) ∈ Fin) |
8 | 7 | anim1i 614 | . . 3 ⊢ ((𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍)) → ((𝐹 supp 𝑍) ∈ Fin ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) |
9 | 8 | adantl 482 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺) ∧ (𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → ((𝐹 supp 𝑍) ∈ Fin ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) |
10 | suppssfifsupp 8836 | . 2 ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺 ∧ 𝑍 ∈ V) ∧ ((𝐹 supp 𝑍) ∈ Fin ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → 𝐺 finSupp 𝑍) | |
11 | 1, 2, 5, 9, 10 | syl31anc 1365 | 1 ⊢ (((𝐺 ∈ 𝑉 ∧ Fun 𝐺) ∧ (𝐹 finSupp 𝑍 ∧ (𝐺 supp 𝑍) ⊆ (𝐹 supp 𝑍))) → 𝐺 finSupp 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2105 Vcvv 3492 ⊆ wss 3933 class class class wbr 5057 Fun wfun 6342 (class class class)co 7145 supp csupp 7819 Fincfn 8497 finSupp cfsupp 8821 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7148 df-om 7570 df-er 8278 df-en 8498 df-fin 8501 df-fsupp 8822 |
This theorem is referenced by: cantnflem1 9140 dprdfinv 19070 dmdprdsplitlem 19088 dpjidcl 19109 frlmphllem 20852 frlmphl 20853 rrxcph 23922 tdeglem4 24581 |
Copyright terms: Public domain | W3C validator |