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 19613 | . . . 4 ⊢ (𝜑 → (𝐹 ∈ 𝑊 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 ))) |
6 | 1, 5 | mpbid 231 | . . 3 ⊢ (𝜑 → (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) ∧ 𝐹 finSupp 0 )) |
7 | 6 | simp1d 1141 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝐼) |
8 | 6 | simp2d 1142 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥)) |
9 | 3, 4 | dprdf2 19610 | . . . . . . 7 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺)) |
10 | 9 | ffvelrnda 6961 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ∈ (SubGrp‘𝐺)) |
11 | dprdff.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
12 | 11 | subgss 18756 | . . . . . 6 ⊢ ((𝑆‘𝑥) ∈ (SubGrp‘𝐺) → (𝑆‘𝑥) ⊆ 𝐵) |
13 | 10, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆‘𝑥) ⊆ 𝐵) |
14 | 13 | sseld 3920 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) ∈ (𝑆‘𝑥) → (𝐹‘𝑥) ∈ 𝐵)) |
15 | 14 | ralimdva 3108 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ (𝑆‘𝑥) → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) |
16 | 8, 15 | mpd 15 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵) |
17 | ffnfv 6992 | . 2 ⊢ (𝐹:𝐼⟶𝐵 ↔ (𝐹 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥) ∈ 𝐵)) | |
18 | 7, 16, 17 | sylanbrc 583 | 1 ⊢ (𝜑 → 𝐹:𝐼⟶𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∀wral 3064 {crab 3068 ⊆ wss 3887 class class class wbr 5074 dom cdm 5589 Fn wfn 6428 ⟶wf 6429 ‘cfv 6433 Xcixp 8685 finSupp cfsupp 9128 Basecbs 16912 SubGrpcsubg 18749 DProd cdprd 19596 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 df-ixp 8686 df-subg 18752 df-dprd 19598 |
This theorem is referenced by: dprdfcntz 19618 dprdssv 19619 dprdfid 19620 dprdfinv 19622 dprdfadd 19623 dprdfsub 19624 dprdfeq0 19625 dprdf11 19626 dprdlub 19629 dmdprdsplitlem 19640 dprddisj2 19642 dpjidcl 19661 |
Copyright terms: Public domain | W3C validator |