| 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 19891 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ 𝑊 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 ))) |
| 6 | 1, 5 | mpbid 232 | . . 3 ⊢ (𝜑 → (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 )) |
| 7 | 6 | simp1d 1142 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝐼) |
| 8 | 6 | simp2d 1143 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥)) |
| 9 | 3, 4 | dprdf2 19888 | . . . . . . 7 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺)) |
| 10 | 9 | ffvelcdmda 7018 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ∈ (SubGrp‘𝐺)) |
| 11 | dprdff.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 12 | 11 | subgss 19006 | . . . . . 6 ⊢ ((𝑆‘𝑥) ∈ (SubGrp‘𝐺) → (𝑆‘𝑥) ⊆ 𝐵) |
| 13 | 10, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ 𝐵) |
| 14 | 13 | sseld 3934 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) ∈ (𝑆‘𝑥) → (𝐹‘𝑥) ∈ 𝐵)) |
| 15 | 14 | ralimdva 3141 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) |
| 16 | 8, 15 | mpd 15 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵) |
| 17 | ffnfv 7053 | . 2 ⊢ (𝐹:𝐼⟶𝐵 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) | |
| 18 | 7, 16, 17 | sylanbrc 583 | 1 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3044 {crab 3394 ⊆ wss 3903 class class class wbr 5092 dom cdm 5619 Fn wfn 6477 ⟶wf 6478 ‘cfv 6482 Xcixp 8824 finSupp cfsupp 9251 Basecbs 17120 SubGrpcsubg 18999 DProd cdprd 19874 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-1st 7924 df-2nd 7925 df-ixp 8825 df-subg 19002 df-dprd 19876 |
| This theorem is referenced by: dprdfcntz 19896 dprdssv 19897 dprdfid 19898 dprdfinv 19900 dprdfadd 19901 dprdfsub 19902 dprdfeq0 19903 dprdf11 19904 dprdlub 19907 dmdprdsplitlem 19918 dprddisj2 19920 dpjidcl 19939 |
| Copyright terms: Public domain | W3C validator |