Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dprdff | Structured version Visualization version GIF version |
Description: A finitely supported function in 𝑆 is a function into the base. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 11-Jul-2019.) |
Ref | Expression |
---|---|
dprdff.w | ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } |
dprdff.1 | ⊢ (𝜑 → 𝐺dom DProd 𝑆) |
dprdff.2 | ⊢ (𝜑 → dom 𝑆 = 𝐼) |
dprdff.3 | ⊢ (𝜑 → 𝐹 ∈ 𝑊) |
dprdff.b | ⊢ 𝐵 = (Base‘𝐺) |
Ref | Expression |
---|---|
dprdff | ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dprdff.3 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑊) | |
2 | dprdff.w | . . . . 5 ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 } | |
3 | dprdff.1 | . . . . 5 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
4 | dprdff.2 | . . . . 5 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
5 | 2, 3, 4 | dprdw 18232 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ 𝑊 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 ))) |
6 | 1, 5 | mpbid 221 | . . 3 ⊢ (𝜑 → (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 )) |
7 | 6 | simp1d 1066 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝐼) |
8 | 6 | simp2d 1067 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥)) |
9 | 3, 4 | dprdf2 18229 | . . . . . . 7 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺)) |
10 | 9 | ffvelrnda 6267 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ∈ (SubGrp‘𝐺)) |
11 | dprdff.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
12 | 11 | subgss 17418 | . . . . . 6 ⊢ ((𝑆‘𝑥) ∈ (SubGrp‘𝐺) → (𝑆‘𝑥) ⊆ 𝐵) |
13 | 10, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ 𝐵) |
14 | 13 | sseld 3567 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) ∈ (𝑆‘𝑥) → (𝐹‘𝑥) ∈ 𝐵)) |
15 | 14 | ralimdva 2945 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) |
16 | 8, 15 | mpd 15 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵) |
17 | ffnfv 6295 | . 2 ⊢ (𝐹:𝐼⟶𝐵 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) | |
18 | 7, 16, 17 | sylanbrc 695 | 1 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∀wral 2896 {crab 2900 ⊆ wss 3540 class class class wbr 4583 dom cdm 5038 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 Xcixp 7794 finSupp cfsupp 8158 Basecbs 15695 SubGrpcsubg 17411 DProd cdprd 18215 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-ixp 7795 df-subg 17414 df-dprd 18217 |
This theorem is referenced by: dprdfcntz 18237 dprdssv 18238 dprdfid 18239 dprdfinv 18241 dprdfadd 18242 dprdfsub 18243 dprdfeq0 18244 dprdf11 18245 dprdlub 18248 dmdprdsplitlem 18259 dprddisj2 18261 dpjidcl 18280 |
Copyright terms: Public domain | W3C validator |