| 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 2230 | . . . 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 13282 | . . 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 9317 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 14 | tsetndx 13292 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
| 15 | 9lt10 9746 | . . . . 5 ⊢ 9 < ;10 | |
| 16 | 10nn 9631 | . . . . 5 ⊢ ;10 ∈ ℕ | |
| 17 | plendx 13306 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 18 | 1nn0 9423 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 19 | 0nn0 9422 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 20 | 2nn 9310 | . . . . . 6 ⊢ 2 ∈ ℕ | |
| 21 | 2pos 9239 | . . . . . 6 ⊢ 0 < 2 | |
| 22 | 18, 19, 20, 21 | declt 9643 | . . . . 5 ⊢ ;10 < ;12 |
| 23 | 18, 20 | decnncl 9635 | . . . . 5 ⊢ ;12 ∈ ℕ |
| 24 | dsndx 13321 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 25 | 13, 14, 15, 16, 17, 22, 23, 24 | strle3g 13214 | . . . 4 ⊢ ((𝑂 ∈ 𝑄 ∧ 𝐿 ∈ 𝑅 ∧ 𝐷 ∈ 𝐴) → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 26 | 10, 11, 12, 25 | syl3anc 1273 | . . 3 ⊢ (𝜑 → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 27 | 8lt9 9346 | . . . 4 ⊢ 8 < 9 | |
| 28 | 27 | a1i 9 | . . 3 ⊢ (𝜑 → 8 < 9) |
| 29 | 9, 26, 28 | strleund 13209 | . 2 ⊢ (𝜑 → (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) Struct 〈1, ;12〉) |
| 30 | 1, 29 | eqbrtrid 4124 | 1 ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2201 ∪ cun 3197 {ctp 3672 〈cop 3673 class class class wbr 4089 ‘cfv 5328 0cc0 8037 1c1 8038 < clt 8219 2c2 9199 8c8 9205 9c9 9206 ;cdc 9616 Struct cstr 13101 ndxcnx 13102 Basecbs 13105 +gcplusg 13183 .rcmulr 13184 Scalarcsca 13186 ·𝑠 cvsca 13187 ·𝑖cip 13188 TopSetcts 13189 lecple 13190 distcds 13192 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-pw 3655 df-sn 3676 df-pr 3677 df-tp 3678 df-op 3679 df-uni 3895 df-int 3930 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-5 9210 df-6 9211 df-7 9212 df-8 9213 df-9 9214 df-n0 9408 df-z 9485 df-dec 9617 df-uz 9761 df-fz 10249 df-struct 13107 df-ndx 13108 df-slot 13109 df-base 13111 df-plusg 13196 df-mulr 13197 df-sca 13199 df-vsca 13200 df-ip 13201 df-tset 13202 df-ple 13203 df-ds 13205 |
| This theorem is referenced by: prdsvalstrd 13377 |
| Copyright terms: Public domain | W3C validator |