| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > srngbased | GIF version | ||
| Description: The base set of a constructed star ring. (Contributed by Mario Carneiro, 18-Nov-2013.) (Revised by Jim Kingdon, 5-Feb-2023.) |
| Ref | Expression |
|---|---|
| srngstr.r | ⊢ 𝑅 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉}) |
| srngstrd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| srngstrd.p | ⊢ (𝜑 → + ∈ 𝑊) |
| srngstrd.m | ⊢ (𝜑 → · ∈ 𝑋) |
| srngstrd.s | ⊢ (𝜑 → ∗ ∈ 𝑌) |
| Ref | Expression |
|---|---|
| srngbased | ⊢ (𝜑 → 𝐵 = (Base‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | srngstr.r | . . 3 ⊢ 𝑅 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉}) | |
| 2 | srngstrd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 3 | srngstrd.p | . . 3 ⊢ (𝜑 → + ∈ 𝑊) | |
| 4 | srngstrd.m | . . 3 ⊢ (𝜑 → · ∈ 𝑋) | |
| 5 | srngstrd.s | . . 3 ⊢ (𝜑 → ∗ ∈ 𝑌) | |
| 6 | 1, 2, 3, 4, 5 | srngstrd 13560 | . 2 ⊢ (𝜑 → 𝑅 Struct 〈1, 4〉) |
| 7 | basendxnn 13467 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
| 8 | opexg 4370 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝐵 ∈ 𝑉) → 〈(Base‘ndx), 𝐵〉 ∈ V) | |
| 9 | 7, 2, 8 | sylancr 418 | . . . 4 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ V) |
| 10 | tpid1g 3825 | . . . 4 ⊢ (〈(Base‘ndx), 𝐵〉 ∈ V → 〈(Base‘ndx), 𝐵〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉}) | |
| 11 | elun1 3396 | . . . 4 ⊢ (〈(Base‘ndx), 𝐵〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} → 〈(Base‘ndx), 𝐵〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉})) | |
| 12 | 9, 10, 11 | 3syl 17 | . . 3 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), · 〉} ∪ {〈(*𝑟‘ndx), ∗ 〉})) |
| 13 | 12, 1 | eleqtrrdi 2332 | . 2 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ 𝑅) |
| 14 | 6, 2, 13 | opelstrbas 13529 | 1 ⊢ (𝜑 → 𝐵 = (Base‘𝑅)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∪ cun 3218 {csn 3709 {ctp 3711 〈cop 3712 ‘cfv 5380 1c1 8187 ℕcn 9314 4c4 9367 ndxcnx 13408 Basecbs 13411 +gcplusg 13491 .rcmulr 13492 *𝑟cstv 13493 |
| 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 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-addcom 8286 ax-addass 8288 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-0id 8294 ax-rnegex 8295 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-apti 8301 ax-pre-ltadd 8302 |
| This proof 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-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-inn 9315 df-2 9373 df-3 9374 df-4 9375 df-n0 9576 df-z 9657 df-uz 9939 df-fz 10430 df-struct 13413 df-ndx 13414 df-slot 13415 df-base 13417 df-plusg 13504 df-mulr 13505 df-starv 13506 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |