| 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 13230 | . . 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 9295 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 14 | tsetndx 13240 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
| 15 | 9lt10 9724 | . . . . 5 ⊢ 9 < ;10 | |
| 16 | 10nn 9609 | . . . . 5 ⊢ ;10 ∈ ℕ | |
| 17 | plendx 13254 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 18 | 1nn0 9401 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 19 | 0nn0 9400 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 20 | 2nn 9288 | . . . . . 6 ⊢ 2 ∈ ℕ | |
| 21 | 2pos 9217 | . . . . . 6 ⊢ 0 < 2 | |
| 22 | 18, 19, 20, 21 | declt 9621 | . . . . 5 ⊢ ;10 < ;12 |
| 23 | 18, 20 | decnncl 9613 | . . . . 5 ⊢ ;12 ∈ ℕ |
| 24 | dsndx 13269 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 25 | 13, 14, 15, 16, 17, 22, 23, 24 | strle3g 13162 | . . . 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 9324 | . . . 4 ⊢ 8 < 9 | |
| 28 | 27 | a1i 9 | . . 3 ⊢ (𝜑 → 8 < 9) |
| 29 | 9, 26, 28 | strleund 13157 | . 2 ⊢ (𝜑 → (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) Struct 〈1, ;12〉) |
| 30 | 1, 29 | eqbrtrid 4118 | 1 ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ∪ cun 3195 {ctp 3668 〈cop 3669 class class class wbr 4083 ‘cfv 5321 0cc0 8015 1c1 8016 < clt 8197 2c2 9177 8c8 9183 9c9 9184 ;cdc 9594 Struct cstr 13049 ndxcnx 13050 Basecbs 13053 +gcplusg 13131 .rcmulr 13132 Scalarcsca 13134 ·𝑠 cvsca 13135 ·𝑖cip 13136 TopSetcts 13137 lecple 13138 distcds 13140 |
| 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 4202 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-addcom 8115 ax-mulcom 8116 ax-addass 8117 ax-mulass 8118 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-1rid 8122 ax-0id 8123 ax-rnegex 8124 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-apti 8130 ax-pre-ltadd 8131 |
| 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 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-tp 3674 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4385 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-inn 9127 df-2 9185 df-3 9186 df-4 9187 df-5 9188 df-6 9189 df-7 9190 df-8 9191 df-9 9192 df-n0 9386 df-z 9463 df-dec 9595 df-uz 9739 df-fz 10222 df-struct 13055 df-ndx 13056 df-slot 13057 df-base 13059 df-plusg 13144 df-mulr 13145 df-sca 13147 df-vsca 13148 df-ip 13149 df-tset 13150 df-ple 13151 df-ds 13153 |
| This theorem is referenced by: prdsvalstrd 13325 |
| Copyright terms: Public domain | W3C validator |