| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dprdwd | Structured version Visualization version GIF version | ||
| Description: A mapping being a finitely supported function in the family 𝑆. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 11-Jul-2019.) (Proof shortened by OpenAI, 30-Mar-2020.) |
| Ref | Expression |
|---|---|
| dprdff.w | ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } |
| dprdff.1 | ⊢ (𝜑 → 𝐺dom DProd 𝑆) |
| dprdff.2 | ⊢ (𝜑 → dom 𝑆 = 𝐼) |
| dprdwd.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ (𝑆‘𝑥)) |
| dprdwd.4 | ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) finSupp 0 ) |
| Ref | Expression |
|---|---|
| dprdwd | ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) ∈ 𝑊) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5111 | . . 3 ⊢ (ℎ = (𝑥 ∈ 𝐼 ↦ 𝐴) → (ℎ finSupp 0 ↔ (𝑥 ∈ 𝐼 ↦ 𝐴) finSupp 0 )) | |
| 2 | dprdwd.3 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ (𝑆‘𝑥)) | |
| 3 | 2 | ralrimiva 3158 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝐴 ∈ (𝑆‘𝑥)) |
| 4 | dprdff.1 | . . . . . . 7 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
| 5 | dprdff.2 | . . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
| 6 | 4, 5 | dprddomcld 20268 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ V) |
| 7 | mptelixpg 9001 | . . . . . 6 ⊢ (𝐼 ∈ V → ((𝑥 ∈ 𝐼 ↦ 𝐴) ∈ X𝑥 ∈ 𝐼 (𝑆‘𝑥) ↔ ∀𝑥 ∈ 𝐼 𝐴 ∈ (𝑆‘𝑥))) | |
| 8 | 6, 7 | syl 18 | . . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ 𝐴) ∈ X𝑥 ∈ 𝐼 (𝑆‘𝑥) ↔ ∀𝑥 ∈ 𝐼 𝐴 ∈ (𝑆‘𝑥))) |
| 9 | 3, 8 | mpbird 260 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) ∈ X𝑥 ∈ 𝐼 (𝑆‘𝑥)) |
| 10 | fveq2 6916 | . . . . 5 ⊢ (𝑥 = 𝑖 → (𝑆‘𝑥) = (𝑆‘𝑖)) | |
| 11 | 10 | cbvixpv 8981 | . . . 4 ⊢ X𝑥 ∈ 𝐼 (𝑆‘𝑥) = X𝑖 ∈ 𝐼 (𝑆‘𝑖) |
| 12 | 9, 11 | eleqtrdi 2874 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖)) |
| 13 | dprdwd.4 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) finSupp 0 ) | |
| 14 | 1, 12, 13 | elrabd 3650 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) ∈ {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 }) |
| 15 | dprdff.w | . 2 ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } | |
| 16 | 14, 15 | eleqtrrdi 2875 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝐴) ∈ 𝑊) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 Vcvv 3454 class class class wbr 5108 ↦ cmpt 5192 dom cdm 5658 ‘cfv 6566 Xcixp 8963 finSupp cfsupp 9391 DProd cdprd 20260 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-oprab 7455 df-mpo 7456 df-ixp 8964 df-dprd 20262 |
| This theorem is used by: dprdfid 20284 dprdfinv 20286 dprdfadd 20287 dmdprdsplitlem 20304 dpjidcl 20325 dchrptlem3 27650 |
| Copyright terms: Public domain | W3C validator |