| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mgpvalg | GIF version | ||
| Description: Value of the multiplication group operation. (Contributed by Mario Carneiro, 21-Dec-2014.) |
| Ref | Expression |
|---|---|
| mgpval.1 | ⊢ 𝑀 = (mulGrp‘𝑅) |
| mgpval.2 | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| mgpvalg | ⊢ (𝑅 ∈ 𝑉 → 𝑀 = (𝑅 sSet 〈(+g‘ndx), · 〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mgpval.1 | . 2 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 2 | df-mgp 14218 | . . 3 ⊢ mulGrp = (𝑟 ∈ V ↦ (𝑟 sSet 〈(+g‘ndx), (.r‘𝑟)〉)) | |
| 3 | id 19 | . . . 4 ⊢ (𝑟 = 𝑅 → 𝑟 = 𝑅) | |
| 4 | fveq2 5695 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅)) | |
| 5 | mgpval.2 | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 6 | 4, 5 | eqtr4di 2289 | . . . . 5 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · ) |
| 7 | 6 | opeq2d 3911 | . . . 4 ⊢ (𝑟 = 𝑅 → 〈(+g‘ndx), (.r‘𝑟)〉 = 〈(+g‘ndx), · 〉) |
| 8 | 3, 7 | oveq12d 6103 | . . 3 ⊢ (𝑟 = 𝑅 → (𝑟 sSet 〈(+g‘ndx), (.r‘𝑟)〉) = (𝑅 sSet 〈(+g‘ndx), · 〉)) |
| 9 | elex 2833 | . . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
| 10 | plusgslid 13466 | . . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 11 | 10 | simpri 113 | . . . . 5 ⊢ (+g‘ndx) ∈ ℕ |
| 12 | 11 | a1i 9 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → (+g‘ndx) ∈ ℕ) |
| 13 | mulrslid 13486 | . . . . . 6 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ) | |
| 14 | 13 | slotex 13379 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (.r‘𝑅) ∈ V) |
| 15 | 5, 14 | eqeltrid 2325 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → · ∈ V) |
| 16 | setsex 13384 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (+g‘ndx) ∈ ℕ ∧ · ∈ V) → (𝑅 sSet 〈(+g‘ndx), · 〉) ∈ V) | |
| 17 | 12, 15, 16 | mpd3an23 1380 | . . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑅 sSet 〈(+g‘ndx), · 〉) ∈ V) |
| 18 | 2, 8, 9, 17 | fvmptd3 5799 | . 2 ⊢ (𝑅 ∈ 𝑉 → (mulGrp‘𝑅) = (𝑅 sSet 〈(+g‘ndx), · 〉)) |
| 19 | 1, 18 | eqtrid 2283 | 1 ⊢ (𝑅 ∈ 𝑉 → 𝑀 = (𝑅 sSet 〈(+g‘ndx), · 〉)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 Vcvv 2821 〈cop 3712 ‘cfv 5377 (class class class)co 6085 ℕcn 9304 ndxcnx 13349 sSet csts 13350 Slot cslot 13351 +gcplusg 13431 .rcmulr 13432 mulGrpcmgp 14217 |
| This proof depends on 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-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| This proof depends on definitions: df-bi 117 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-ral 2533 df-rex 2534 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-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-iota 5337 df-fun 5379 df-fn 5380 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-inn 9305 df-2 9363 df-3 9364 df-ndx 13355 df-slot 13356 df-sets 13359 df-plusg 13444 df-mulr 13445 df-mgp 14218 |
| This theorem is used by: mgpplusgg 14221 mgpex 14223 mgpbasg 14224 mgpscag 14226 mgptsetg 14227 mgpdsg 14229 mgpress 14230 |
| Copyright terms: Public domain | W3C validator |