| 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 20232 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ 𝑊 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 ))) |
| 6 | 1, 5 | mpbid 235 | . . 3 ⊢ (𝜑 → (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 )) |
| 7 | 6 | simp1d 1160 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝐼) |
| 8 | 6 | simp2d 1161 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥)) |
| 9 | 3, 4 | dprdf2 20229 | . . . . . . 7 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺)) |
| 10 | 9 | ffvelcdmda 7085 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ∈ (SubGrp‘𝐺)) |
| 11 | dprdff.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 12 | 11 | subgss 19343 | . . . . . 6 ⊢ ((𝑆‘𝑥) ∈ (SubGrp‘𝐺) → (𝑆‘𝑥) ⊆ 𝐵) |
| 13 | 10, 12 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ 𝐵) |
| 14 | 13 | sseld 3907 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) ∈ (𝑆‘𝑥) → (𝐹‘𝑥) ∈ 𝐵)) |
| 15 | 14 | ralimdva 3174 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) |
| 16 | 8, 15 | mpd 16 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵) |
| 17 | ffnfv 7120 | . 2 ⊢ (𝐹:𝐼⟶𝐵 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) | |
| 18 | 7, 16, 17 | sylanbrc 595 | 1 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∀wral 3076 {crab 3412 ⊆ wss 3895 class class class wbr 5102 dom cdm 5650 Fn wfn 6534 ⟶wf 6535 ‘cfv 6539 Xcixp 8929 finSupp cfsupp 9357 Basecbs 17393 SubGrpcsubg 19336 DProd cdprd 20215 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-ixp 8930 df-subg 19339 df-dprd 20217 |
| This theorem is used by: dprdfcntz 20237 dprdssv 20238 dprdfid 20239 dprdfinv 20241 dprdfadd 20242 dprdfsub 20243 dprdfeq0 20244 dprdf11 20245 dprdlub 20248 dmdprdsplitlem 20259 dprddisj2 20261 dpjidcl 20280 |
| Copyright terms: Public domain | W3C validator |