| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pws0g | GIF version | ||
| Description: The identity in a structure power of a monoid. (Contributed by Mario Carneiro, 11-Jan-2015.) |
| Ref | Expression |
|---|---|
| pwsmnd.y | ⊢ 𝑌 = (𝑅 ↑s 𝐼) |
| pws0g.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| pws0g | ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (𝐼 × { 0 }) = (0g‘𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2206 | . . 3 ⊢ ((Scalar‘𝑅)Xs(𝐼 × {𝑅})) = ((Scalar‘𝑅)Xs(𝐼 × {𝑅})) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 𝐼 ∈ 𝑉) | |
| 3 | scaslid 13060 | . . . . 5 ⊢ (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ) | |
| 4 | 3 | slotex 12934 | . . . 4 ⊢ (𝑅 ∈ Mnd → (Scalar‘𝑅) ∈ V) |
| 5 | 4 | adantr 276 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (Scalar‘𝑅) ∈ V) |
| 6 | fconst6g 5486 | . . . 4 ⊢ (𝑅 ∈ Mnd → (𝐼 × {𝑅}):𝐼⟶Mnd) | |
| 7 | 6 | adantr 276 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (𝐼 × {𝑅}):𝐼⟶Mnd) |
| 8 | 1, 2, 5, 7 | prds0g 13356 | . 2 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (0g ∘ (𝐼 × {𝑅})) = (0g‘((Scalar‘𝑅)Xs(𝐼 × {𝑅})))) |
| 9 | fconstmpt 4730 | . . 3 ⊢ (𝐼 × { 0 }) = (𝑥 ∈ 𝐼 ↦ 0 ) | |
| 10 | elex 2785 | . . . . 5 ⊢ (𝑅 ∈ Mnd → 𝑅 ∈ V) | |
| 11 | 10 | ad2antrr 488 | . . . 4 ⊢ (((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ V) |
| 12 | fconstmpt 4730 | . . . . 5 ⊢ (𝐼 × {𝑅}) = (𝑥 ∈ 𝐼 ↦ 𝑅) | |
| 13 | 12 | a1i 9 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (𝐼 × {𝑅}) = (𝑥 ∈ 𝐼 ↦ 𝑅)) |
| 14 | fn0g 13282 | . . . . 5 ⊢ 0g Fn V | |
| 15 | dffn5im 5637 | . . . . 5 ⊢ (0g Fn V → 0g = (𝑟 ∈ V ↦ (0g‘𝑟))) | |
| 16 | 14, 15 | mp1i 10 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 0g = (𝑟 ∈ V ↦ (0g‘𝑟))) |
| 17 | fveq2 5589 | . . . . 5 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅)) | |
| 18 | pws0g.z | . . . . 5 ⊢ 0 = (0g‘𝑅) | |
| 19 | 17, 18 | eqtr4di 2257 | . . . 4 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 ) |
| 20 | 11, 13, 16, 19 | fmptco 5759 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (0g ∘ (𝐼 × {𝑅})) = (𝑥 ∈ 𝐼 ↦ 0 )) |
| 21 | 9, 20 | eqtr4id 2258 | . 2 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (𝐼 × { 0 }) = (0g ∘ (𝐼 × {𝑅}))) |
| 22 | pwsmnd.y | . . . 4 ⊢ 𝑌 = (𝑅 ↑s 𝐼) | |
| 23 | eqid 2206 | . . . 4 ⊢ (Scalar‘𝑅) = (Scalar‘𝑅) | |
| 24 | 22, 23 | pwsval 13198 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 𝑌 = ((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) |
| 25 | 24 | fveq2d 5593 | . 2 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (0g‘𝑌) = (0g‘((Scalar‘𝑅)Xs(𝐼 × {𝑅})))) |
| 26 | 8, 21, 25 | 3eqtr4d 2249 | 1 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → (𝐼 × { 0 }) = (0g‘𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2177 Vcvv 2773 {csn 3638 ↦ cmpt 4113 × cxp 4681 ∘ ccom 4687 Fn wfn 5275 ⟶wf 5276 ‘cfv 5280 (class class class)co 5957 Scalarcsca 12987 0gc0g 13163 Xscprds 13172 ↑s cpws 13173 Mndcmnd 13323 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4167 ax-sep 4170 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-addcom 8045 ax-mulcom 8046 ax-addass 8047 ax-mulass 8048 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-1rid 8052 ax-0id 8053 ax-rnegex 8054 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-apti 8060 ax-pre-ltadd 8061 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-tp 3646 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-id 4348 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-1st 6239 df-2nd 6240 df-map 6750 df-ixp 6799 df-sup 7101 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-inn 9057 df-2 9115 df-3 9116 df-4 9117 df-5 9118 df-6 9119 df-7 9120 df-8 9121 df-9 9122 df-n0 9316 df-z 9393 df-dec 9525 df-uz 9669 df-fz 10151 df-struct 12909 df-ndx 12910 df-slot 12911 df-base 12913 df-plusg 12997 df-mulr 12998 df-sca 13000 df-vsca 13001 df-ip 13002 df-tset 13003 df-ple 13004 df-ds 13006 df-hom 13008 df-cco 13009 df-rest 13148 df-topn 13149 df-0g 13165 df-topgen 13167 df-pt 13168 df-prds 13174 df-pws 13197 df-mgm 13263 df-sgrp 13309 df-mnd 13324 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |