| 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 2238 | . . . 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 13590 | . . 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 9485 | . . . . 5 ⊢ 9 ∈ ℕ | |
| 14 | tsetndx 13600 | . . . . 5 ⊢ (TopSet‘ndx) = 9 | |
| 15 | 9lt10 9924 | . . . . 5 ⊢ 9 < ;10 | |
| 16 | 10nn 9808 | . . . . 5 ⊢ ;10 ∈ ℕ | |
| 17 | plendx 13614 | . . . . 5 ⊢ (le‘ndx) = ;10 | |
| 18 | 1nn0 9591 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
| 19 | 0nn0 9590 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 20 | 2nn 9478 | . . . . . 6 ⊢ 2 ∈ ℕ | |
| 21 | 2pos 9405 | . . . . . 6 ⊢ 0 < 2 | |
| 22 | 18, 19, 20, 21 | declt 9821 | . . . . 5 ⊢ ;10 < ;12 |
| 23 | 18, 20 | decnncl 9812 | . . . . 5 ⊢ ;12 ∈ ℕ |
| 24 | dsndx 13629 | . . . . 5 ⊢ (dist‘ndx) = ;12 | |
| 25 | 13, 14, 15, 16, 17, 22, 23, 24 | strle3g 13522 | . . . 4 ⊢ ((𝑂 ∈ 𝑄 ∧ 𝐿 ∈ 𝑅 ∧ 𝐷 ∈ 𝐴) → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 26 | 10, 11, 12, 25 | syl3anc 1278 | . . 3 ⊢ (𝜑 → {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉} Struct 〈9, ;12〉) |
| 27 | 8lt9 9514 | . . . 4 ⊢ 8 < 9 | |
| 28 | 27 | a1i 9 | . . 3 ⊢ (𝜑 → 8 < 9) |
| 29 | 9, 26, 28 | strleund 13517 | . 2 ⊢ (𝜑 → (({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉} ∪ {〈(Scalar‘ndx), 𝑆〉, 〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) ∪ {〈(TopSet‘ndx), 𝑂〉, 〈(le‘ndx), 𝐿〉, 〈(dist‘ndx), 𝐷〉}) Struct 〈1, ;12〉) |
| 30 | 1, 29 | eqbrtrid 4166 | 1 ⊢ (𝜑 → 𝑈 Struct 〈1, ;12〉) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ∪ cun 3218 {ctp 3711 〈cop 3712 class class class wbr 4131 ‘cfv 5380 0cc0 8186 1c1 8187 < clt 8367 2c2 9365 8c8 9371 9c9 9372 ;cdc 9789 Struct cstr 13407 ndxcnx 13408 Basecbs 13411 +gcplusg 13491 .rcmulr 13492 Scalarcsca 13494 ·𝑠 cvsca 13495 ·𝑖cip 13496 TopSetcts 13497 lecple 13498 distcds 13500 |
| 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-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 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-5 9376 df-6 9377 df-7 9378 df-8 9379 df-9 9380 df-n0 9576 df-z 9657 df-dec 9790 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-sca 13507 df-vsca 13508 df-ip 13509 df-tset 13510 df-ple 13511 df-ds 13513 |
| This theorem is used by: prdsvalstrd 13680 |
| Copyright terms: Public domain | W3C validator |