| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > imasvalstrd | GIF version | ||
| Description: An image structure value is a structure. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 30-Apr-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) |
| Ref | Expression |
|---|---|
| imasvalstr.u | ⊢ 𝑈 = (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) |
| imasvalstrd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| imasvalstrd.p | ⊢ (𝜑 → + ∈ 𝑊) |
| imasvalstrd.m | ⊢ (𝜑 → × ∈ 𝑋) |
| imasvalstrd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑌) |
| imasvalstrd.c | ⊢ (𝜑 → · ∈ 𝑍) |
| imasvalstrd.i | ⊢ (𝜑 → , ∈ 𝑃) |
| imasvalstrd.t | ⊢ (𝜑 → 𝑂 ∈ 𝑄) |
| imasvalstrd.l | ⊢ (𝜑 → 𝐿 ∈ 𝑅) |
| imasvalstrd.d | ⊢ (𝜑 → 𝐷 ∈ 𝐴) |
| Ref | Expression |
|---|---|
| imasvalstrd | ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imasvalstr.u | . 2 ⊢ 𝑈 = (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) | |
| 2 | eqid 2229 | . . . 4 ⊢ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) | |
| 3 | imasvalstrd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 4 | imasvalstrd.p | . . . 4 ⊢ (𝜑 → + ∈ 𝑊) | |
| 5 | imasvalstrd.m | . . . 4 ⊢ (𝜑 → × ∈ 𝑋) | |
| 6 | imasvalstrd.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑌) | |
| 7 | imasvalstrd.c | . . . 4 ⊢ (𝜑 → · ∈ 𝑍) | |
| 8 | imasvalstrd.i | . . . 4 ⊢ (𝜑 → , ∈ 𝑃) | |
| 9 | 2, 3, 4, 5, 6, 7, 8 | ipsstrd 13252 | . . 3 ⊢ (𝜑 → ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) Struct 〈1, 8〉) |
| 10 | imasvalstrd.t | . . . 4 ⊢ (𝜑 → 𝑂 ∈ 𝑄) | |
| 11 | imasvalstrd.l | . . . 4 ⊢ (𝜑 → 𝐿 ∈ 𝑅) | |
| 12 | imasvalstrd.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝐴) | |
| 13 | 9nn 9305 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 14 | tsetndx 13262 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
| 15 | 9lt10 9734 | . . . . 5 ⊢ 9 < ;10 | |
| 16 | 10nn 9619 | . . . . 5 ⊢ ;10 ∈ ℕ | |
| 17 | plendx 13276 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 18 | 1nn0 9411 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 19 | 0nn0 9410 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 20 | 2nn 9298 | . . . . . 6 ⊢ 2 ∈ ℕ | |
| 21 | 2pos 9227 | . . . . . 6 ⊢ 0 < 2 | |
| 22 | 18, 19, 20, 21 | declt 9631 | . . . . 5 ⊢ ;10 < ;12 |
| 23 | 18, 20 | decnncl 9623 | . . . . 5 ⊢ ;12 ∈ ℕ |
| 24 | dsndx 13291 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 25 | 13, 14, 15, 16, 17, 22, 23, 24 | strle3g 13184 | . . . 4 ⊢ ((𝑂 ∈ 𝑄 ∧ 𝐿 ∈ 𝑅 ∧ 𝐷 ∈ 𝐴) → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 26 | 10, 11, 12, 25 | syl3anc 1271 | . . 3 ⊢ (𝜑 → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 27 | 8lt9 9334 | . . . 4 ⊢ 8 < 9 | |
| 28 | 27 | a1i 9 | . . 3 ⊢ (𝜑 → 8 < 9) |
| 29 | 9, 26, 28 | strleund 13179 | . 2 ⊢ (𝜑 → (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) Struct 〈1, ;12〉) |
| 30 | 1, 29 | eqbrtrid 4121 | 1 ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ∪ cun 3196 {ctp 3669 〈cop 3670 class class class wbr 4086 ‘cfv 5324 0cc0 8025 1c1 8026 < clt 8207 2c2 9187 8c8 9193 9c9 9194 ;cdc 9604 Struct cstr 13071 ndxcnx 13072 Basecbs 13075 +gcplusg 13153 .rcmulr 13154 Scalarcsca 13156 ·𝑠 cvsca 13157 ·𝑖cip 13158 TopSetcts 13159 lecple 13160 distcds 13162 |
| 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 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-addcom 8125 ax-mulcom 8126 ax-addass 8127 ax-mulass 8128 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-1rid 8132 ax-0id 8133 ax-rnegex 8134 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-apti 8140 ax-pre-ltadd 8141 |
| 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 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-inn 9137 df-2 9195 df-3 9196 df-4 9197 df-5 9198 df-6 9199 df-7 9200 df-8 9201 df-9 9202 df-n0 9396 df-z 9473 df-dec 9605 df-uz 9749 df-fz 10237 df-struct 13077 df-ndx 13078 df-slot 13079 df-base 13081 df-plusg 13166 df-mulr 13167 df-sca 13169 df-vsca 13170 df-ip 13171 df-tset 13172 df-ple 13173 df-ds 13175 |
| This theorem is referenced by: prdsvalstrd 13347 |
| Copyright terms: Public domain | W3C validator |