| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > srngmulrd | GIF version | ||
| Description: The multiplication operation of a constructed star ring. (Contributed by Mario Carneiro, 20-Jun-2015.) |
| Ref | Expression |
|---|---|
| srngstr.r | ⊢ 𝑅 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉}) |
| srngstrd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| srngstrd.p | ⊢ (𝜑 → + ∈ 𝑊) |
| srngstrd.m | ⊢ (𝜑 → · ∈ 𝑋) |
| srngstrd.s | ⊢ (𝜑 → ∗ ∈ 𝑌) |
| Ref | Expression |
|---|---|
| srngmulrd | ⊢ (𝜑 → · = (.r‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mulrslid 13205 | . 2 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ) | |
| 2 | srngstr.r | . . 3 ⊢ 𝑅 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉}) | |
| 3 | srngstrd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 4 | srngstrd.p | . . 3 ⊢ (𝜑 → + ∈ 𝑊) | |
| 5 | srngstrd.m | . . 3 ⊢ (𝜑 → · ∈ 𝑋) | |
| 6 | srngstrd.s | . . 3 ⊢ (𝜑 → ∗ ∈ 𝑌) | |
| 7 | 2, 3, 4, 5, 6 | srngstrd 13219 | . 2 ⊢ (𝜑 → 𝑅 Struct 〈1, 4〉) |
| 8 | 1 | simpri 113 | . . . . 5 ⊢ (.r‘ndx) ∈ ℕ |
| 9 | opexg 4318 | . . . . 5 ⊢ (((.r‘ndx) ∈ ℕ ∧ · ∈ 𝑋) → 〈(.r‘ndx), · 〉 ∈ V) | |
| 10 | 8, 5, 9 | sylancr 414 | . . . 4 ⊢ (𝜑 → 〈(.r‘ndx), · 〉 ∈ V) |
| 11 | tpid3g 3785 | . . . 4 ⊢ (〈(.r‘ndx), · 〉 ∈ V → 〈(.r‘ndx), · 〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉}) | |
| 12 | elun1 3372 | . . . 4 ⊢ (〈(.r‘ndx), · 〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} → 〈(.r‘ndx), · 〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉})) | |
| 13 | 10, 11, 12 | 3syl 17 | . . 3 ⊢ (𝜑 → 〈(.r‘ndx), · 〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉})) |
| 14 | 13, 2 | eleqtrrdi 2323 | . 2 ⊢ (𝜑 → 〈(.r‘ndx), · 〉 ∈ 𝑅) |
| 15 | 1, 7, 5, 14 | opelstrsl 13187 | 1 ⊢ (𝜑 → · = (.r‘𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 Vcvv 2800 ∪ cun 3196 {csn 3667 {ctp 3669 〈cop 3670 ‘cfv 5324 1c1 8023 ℕcn 9133 4c4 9186 ndxcnx 13069 Slot cslot 13071 Basecbs 13072 +gcplusg 13150 .rcmulr 13151 *𝑟cstv 13152 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-tp 3675 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-n0 9393 df-z 9470 df-uz 9746 df-fz 10234 df-struct 13074 df-ndx 13075 df-slot 13076 df-base 13078 df-plusg 13163 df-mulr 13164 df-starv 13165 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |