| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prdsplusgcl | GIF version | ||
| Description: Structure product pointwise sums are closed when the factors are monoids. (Contributed by Stefan O'Rear, 10-Jan-2015.) |
| Ref | Expression |
|---|---|
| prdsplusgcl.y | ⊢ 𝑌 = (𝑆Xs𝑅) |
| prdsplusgcl.b | ⊢ 𝐵 = (Base‘𝑌) |
| prdsplusgcl.p | ⊢ + = (+g‘𝑌) |
| prdsplusgcl.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| prdsplusgcl.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| prdsplusgcl.r | ⊢ (𝜑 → 𝑅:𝐼⟶Mnd) |
| prdsplusgcl.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
| prdsplusgcl.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| prdsplusgcl | ⊢ (𝜑 → (𝐹 + 𝐺) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prdsplusgcl.y | . . 3 ⊢ 𝑌 = (𝑆Xs𝑅) | |
| 2 | prdsplusgcl.b | . . 3 ⊢ 𝐵 = (Base‘𝑌) | |
| 3 | prdsplusgcl.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 4 | prdsplusgcl.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 5 | prdsplusgcl.r | . . . 4 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd) | |
| 6 | 5 | ffnd 5532 | . . 3 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 7 | prdsplusgcl.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 8 | prdsplusgcl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 9 | prdsplusgcl.p | . . 3 ⊢ + = (+g‘𝑌) | |
| 10 | 1, 2, 3, 4, 6, 7, 8, 9 | prdsplusgval 14166 | . 2 ⊢ (𝜑 → (𝐹 + 𝐺) = (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥)))) |
| 11 | 5 | ffvelcdmda 5837 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ Mnd) |
| 12 | 3 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑉) |
| 13 | 4 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ 𝑊) |
| 14 | 6 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 Fn 𝐼) |
| 15 | 7 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝐵) |
| 16 | simpr 110 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼) | |
| 17 | 1, 2, 12, 13, 14, 15, 16 | prdsbasprj 14165 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (Base‘(𝑅‘𝑥))) |
| 18 | 8 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ 𝐵) |
| 19 | 1, 2, 12, 13, 14, 18, 16 | prdsbasprj 14165 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) |
| 20 | eqid 2238 | . . . . . 6 ⊢ (Base‘(𝑅‘𝑥)) = (Base‘(𝑅‘𝑥)) | |
| 21 | eqid 2238 | . . . . . 6 ⊢ (+g‘(𝑅‘𝑥)) = (+g‘(𝑅‘𝑥)) | |
| 22 | 20, 21 | mndcl 13719 | . . . . 5 ⊢ (((𝑅‘𝑥) ∈ Mnd ∧ (𝐹‘𝑥) ∈ (Base‘(𝑅‘𝑥)) ∧ (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) → ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 23 | 11, 17, 19, 22 | syl3anc 1278 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 24 | 23 | ralrimiva 2623 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 25 | 1, 2, 3, 4, 6 | prdsbasmpt 14163 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐼 ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥)))) |
| 26 | 24, 25 | mpbird 167 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ ((𝐹‘𝑥)(+g‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵) |
| 27 | 10, 26 | eqeltrd 2315 | 1 ⊢ (𝜑 → (𝐹 + 𝐺) ∈ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ↦ cmpt 4190 Fn wfn 5370 ⟶wf 5371 ‘cfv 5375 (class class class)co 6079 Basecbs 13335 +gcplusg 13414 Mndcmnd 13712 Xscprds 14152 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-tp 3716 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-map 6918 df-ixp 6975 df-sup 7318 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-7 9351 df-8 9352 df-9 9353 df-n0 9547 df-z 9628 df-dec 9761 df-uz 9905 df-fz 10395 df-struct 13337 df-ndx 13338 df-slot 13339 df-base 13341 df-plusg 13427 df-mulr 13428 df-sca 13430 df-vsca 13431 df-ip 13432 df-tset 13433 df-ple 13434 df-ds 13436 df-hom 13438 df-cco 13439 df-rest 13578 df-topn 13579 df-topgen 13597 df-pt 13598 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-prds 14153 |
| This theorem is referenced by: prdsmndd 14177 |
| Copyright terms: Public domain | W3C validator |